Let be an integer. A frog is to jump along the real axis, starting at the point 0 and making jumps: one of length 1 , one of length , one of length . It may perform these jumps in any order. If at some point the frog is sitting on a number , its next jump must be to the right (towards the positive numbers). If at some point the frog is sitting on a number , its next jump must be to the left (towards the negative numbers). Find the largest positive integer for which the frog can perform its jumps in such an order that it never lands on any of the numbers .
BxMO 2013
Benelux Mathematical Olympiad 2013.
Other problems
Find all functions such that
holds for all .
Let be a triangle with circumcircle , and let be the center of the incircle of . The lines and intersect in and . The tangent lines to in and intersect the lines and in and , respectively. Prove that
a) Find all positive integers with the following property: for each odd prime number there exists a positive integer such that divides the two integers
b) Find all positive integers with the following property: for each odd prime number there exists a positive integer such that divides the two integers