Let the sequence ai be defined as ai+1=2ai. Find the number of integers 1≤n≤1000 such that if a0=n, then 100 divides a1000−a1.
A number or a short expression. Spacing and $ signs are ignored.
Solution
We claim that a1000 is constant mod100. a997 is divisible by 2. This means that a998 is divisible by 4. Thus a999 is constant mod5. Since it is also divisible by 4, it is constant mod20. Thus a1000 is constant mod25, since ϕ(25)=20. Since a1000 is also divisible by 4, it is constant mod100. We know that a1000 is divisible by 4, and let it be congruent to kmod25. Then 2n is divisible by 4(n≥2) and 2n≡kmod25We can also show that 2 is a primitive root mod 25, so there is one unique value of nmod20. It suffices to show this value isn't 1. But 220 mod 4≡216 mod 20mod25, so n≡16mod20. Thus there are 1000/20=50 values of n.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.