cmi-entrance 2024 Q7

cmi-entrance · India · ugmath 3 marks Number Theory Modular Arithmetic Computation
Two mighty frogs jump once per unit time on the number line as described in the question.
The first frog is at $x = 2^i$ at time $t = i$. How many numbers of the form $7n+1$ (with $n$ an integer) does the frog visit from $t=0$ to $t=99$ (both endpoints included)? [3 points]
Two mighty frogs jump once per unit time on the number line as described in the question.

The first frog is at $x = 2^i$ at time $t = i$. How many numbers of the form $7n+1$ (with $n$ an integer) does the frog visit from $t=0$ to $t=99$ (both endpoints included)? [3 points]