Browse · MathNet
PrintBaltic Way shortlist
Baltic Way number theory
Problem
A grasshopper is jumping along the set of integers. He starts at the origin; and for each jump, he may decide whether to jump to the left or to the right. For each , the -th jump has length . Prove or disprove that for each the grasshopper can arrive at starting from origin.
Solution
Clearly, the grasshopper can arrive at the integers and , in one jump. And also, he can arrive at the integer using three jumps to the right (). Note the following: if the grasshopper can arrive at a number using jumps, then he can also arrive at the numbers and using jumps, by jumping left, right, right, left (for ), and right, left, left, right (for ), because of Since the numbers , , and all have distinct remainders modulo four, the grasshopper can arrive at each integer in a finite number of jumps.
Techniques
Modular ArithmeticInvariants / monovariants