Skip to main content
OlympiadHQ

Browse · MathNet

Print

National Competition

Austria counting and probability

Problem

Consider points arranged on a circle. We are allowed to jump ahead by or points in clockwise direction. What is the minimum number of jumps required to visit all points and return to the starting point?
Solution
If the problem could be solved with jumps, the total distance covered by these jumps would be strictly between and which makes a return to the original point impossible. Therefore, at least jumps are required. This is indeed possible, for example with the following sequence of points on the circle.
Final answer
2017

Techniques

Invariants / monovariantsModular Arithmetic