Maths Olympiad Prep

Library / /147 of 348

Number theory Difficulty 4.8 AIME Find the answer

Let the sequence aia_{i} be defined as ai+1=2aia_{i+1}=2^{a_{i}}. Find the number of integers 1n10001 \leq n \leq 1000 such that if a0=na_{0}=n, then 100 divides a1000a1a_{1000}-a_{1}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

We claim that a1000a_{1000} is constant mod100\bmod 100. a997a_{997} is divisible by 2. This means that a998a_{998} is divisible by 4. Thus a999a_{999} is constant mod5\bmod 5. Since it is also divisible by 4, it is constant mod20\bmod 20. Thus a1000a_{1000} is constant mod25\bmod 25, since ϕ(25)=20\phi(25)=20. Since a1000a_{1000} is also divisible by 4, it is constant mod100\bmod 100. We know that a1000a_{1000} is divisible by 4, and let it be congruent to kmod25k \bmod 25. Then 2n2^{n} is divisible by 4(n2)4(n \geq 2) and 2nkmod25We2^{n} \equiv k \bmod 25 \mathrm{We} can also show that 2 is a primitive root mod 25, so there is one unique value of nmod20n \bmod 20. It suffices to show this value isn't 1. But 220 mod 4216 mod 202^{2^{0 \text { mod } 4}} \equiv 2^{16 \text { mod } 20} mod25\bmod 25, so n16mod20n \equiv 16 \bmod 20. Thus there are 1000/20=501000 / 20=50 values of nn.

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.