Number TheoryHardModular Arithmetic
Modular Arithmetic · Hard problem
A frog sits on one of lily pads arranged in a circle and always jumps pads clockwise. How many different pads does it ever land on (including its starting pad)?
A frog sits on one of lily pads arranged in a circle and always jumps pads clockwise. How many different pads does it ever land on (including its starting pad)?