Three-Distance Theorem


	Let be a real number, and consider the arithmetic progression modulo 1. You can think of this as walking along a circle with 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.


	Contributed by: Eric Rowland

is rational, then eventually

(namely when

is the denominator of

), so the steps are then retraced. In this case there is eventually only one length between distinct consecutive points.

The interesting case is when

is irrational. This is the so-called "irrational rotation", and there are either two or three distinct lengths.

"Three-Distance Theorem" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ThreeDistanceTheorem/

Contributed by: Eric Rowland

Free Download: Mathematica Player--Runs all Demonstrations & more

Browse all topics

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »