Did you count your hops?

Hoppy the Rabbit lives on the vertices of a regular 2015-gon with vertices labelled 1 , 2 , 3 , 4 2015 1,2,3,4\dots 2015 . Hoppy lives on vertex 1, and he wishes to visit every vertex this year. To do this he buys a k k -hopping machine. The k k -hopping machine allows Hoppy to hop from his current vertex (assume it has number v v ) to the vertex with the number v + k v+k . If v + k > 2015 v+k>2015 it sends him to vertex v + k 2015 v+k-2015 instead. The k k hopping machines exist for k = 1 , 2 , 3 2015 k=1,2,3\dots 2015 . What is the sum of the values of k k for which the k k -hopping machine allows Hoppy to reach all of the vertices, starting at vertex 1 and hopping a finite number of times?


The answer is 1450800.

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.

1 solution

Jorge Fernández
Sep 8, 2015

The values of k k so that the k k -hopping machine allows Hoppy to reach every vertex are those so that k k and 2015 2015 are coprime. Notice there are φ ( 2015 ) = 4 12 30 \varphi(2015)=4\cdot 12 \cdot 30 such values of k k . Now notice we can pair them up in pairs that add 2015 2015 . that is because if k k and 2015 2015 are coprime then so are 2015 k 2015-k and 2015 2015 . There are 2 12 30 2\cdot12\cdot30 pairs, and each add 2015 2015 . Therefore the answer is 2015 2 12 30 = 1450800 2015\cdot2\cdot12\cdot30=1450800

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...