Suppose you choose a point on a circle's circumference. Then you choose another point on the circumference that is precisely 1 radian away clockwise. Repeat this step until you have ended up back at your initial point. Which interval most accurately contains the number of steps you have performed?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Modular arithmetic may also be used, but here is a less formal approach. Unwrap the circle and an arbitrary number of revolutions around it and turn it into a number line. Mark intervals on the number line every τ r (where τ = 2 π and r is the radius) units. Notice that every 1 radian turn will take us r units (by the definition of a radian). Our number line approach tells us that we need some multiple of r that is also a multiple of τ r . In other words, we seek integer solutions ( x , y ) to the Diophantine equation: x r = y τ r Rearranging this equation yields: y x = τ Since τ is irrational, it cannot be expressed as the ratio of two integers. This means that x and y cannot simultaneously be integers which means that there are no integer solutions to the Diophantine equation. Since a multiple of a radius will never equal a multiple of the circumference, we are forced to conclude that we will continue to label points forever and we will never reach our initial point as an endpoint after a finite amount of labelling. Therefore, we will label an infinite number of points.