Three-distance theorem

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.creator	Rowland, Eric
dc.date	2013-09-25T18:11:58Z
dc.date	2013-09-25T18:11:58Z
dc.date	2013-09-25
dc.date.accessioned	2017-04-05T18:56:57Z
dc.date.available	2017-04-05T18:56:57Z
dc.identifier	http://acervodigital.unesp.br/handle/unesp/70213
dc.identifier	http://objetoseducacionais2.mec.gov.br/handle/mec/23153
dc.identifier.uri	http://repositorioslatinoamericanos.uchile.cl/handle/2250/847760
dc.description	Educação Superior::Ciências Exatas e da Terra::Matemática
dc.description	Let α be a real number, and consider the arithmetic progression 0, α, 2α, 3α, ..., nα modulo 1. You can think of this as walking along a circle with n steps of a fixed length. The three-distance theorem states that the distance between any two consecutive footprints is one of at most three distinct numbers. That is, the circle is partitioned into arcs with at most three distinct lengths
dc.publisher	Wolfram Demonstration Project
dc.relation	ThreeDistanceTheorem.nbp
dc.rights	Demonstration freeware using Mathematica Player
dc.subject	Number theory
dc.subject	Discrete Mathematics
dc.subject	Combinatorics
dc.subject	Educação Superior::Ciências Exatas e da Terra::Matemática::Matemática Discreta e Combinatória
dc.subject	Educação Superior::Ciências Exatas e da Terra::Matemática::Teoria dos Números
dc.title	Three-distance theorem
dc.type	Software