Hoppy the Rabbit lives on the vertices of a regular 2015-gon with vertices labelled . Hoppy lives on vertex 1, and he wishes to visit every vertex this year. To do this he buys a -hopping machine. The -hopping machine allows Hoppy to hop from his current vertex (assume it has number ) to the vertex with the number . If it sends him to vertex instead. The hopping machines exist for . What is the sum of the values of for which the -hopping machine allows Hoppy to reach all of the vertices, starting at vertex 1 and hopping a finite number of times?
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.
The values of k so that the k -hopping machine allows Hoppy to reach every vertex are those so that k and 2 0 1 5 are coprime. Notice there are φ ( 2 0 1 5 ) = 4 ⋅ 1 2 ⋅ 3 0 such values of k . Now notice we can pair them up in pairs that add 2 0 1 5 . that is because if k and 2 0 1 5 are coprime then so are 2 0 1 5 − k and 2 0 1 5 . There are 2 ⋅ 1 2 ⋅ 3 0 pairs, and each add 2 0 1 5 . Therefore the answer is 2 0 1 5 ⋅ 2 ⋅ 1 2 ⋅ 3 0 = 1 4 5 0 8 0 0