Asmi, the bunny is hopping on the positive integers. First, she is told
a positive integer n. Then, Asmi chooses positive integers a, d and hops on
all of the spaces a, a + d, a + 2d, ........, a + 2013d. However, Asmi must make
these choices so that the number of every space that she hops on is less than n and relatively
prime to n.
A positive integer n is called bunny-unfriendly if, when given that n, Asmi is unable
to find positive integers a, d that allow her to perform the hops she wants. Find the maximum
bunny-unfriendly integer, or prove that no such maximum exists.
for exclusively for OLYMPIAD aspirants
a positive integer n. Then, Asmi chooses positive integers a, d and hops on
all of the spaces a, a + d, a + 2d, ........, a + 2013d. However, Asmi must make
these choices so that the number of every space that she hops on is less than n and relatively
prime to n.
A positive integer n is called bunny-unfriendly if, when given that n, Asmi is unable
to find positive integers a, d that allow her to perform the hops she wants. Find the maximum
bunny-unfriendly integer, or prove that no such maximum exists.
for exclusively for OLYMPIAD aspirants
No comments:
Post a Comment