Maths Olympiad Prep

Library / /66 of 158

Number theory Difficulty 5.6 AIME, harder Prove it Estonia

Find the largest natural number nn for which 3201613^{2016} - 1 is divisible by 2n2^n.

Solution

We have 320161=(3631)(363+1)(3126+1)(3252+1)(3504+1)(31008+1)3^{2016} - 1 = (3^{63} - 1)(3^{63} + 1)(3^{126} + 1)(3^{252} + 1) \cdot (3^{504} + 1)(3^{1008} + 1).

Numbers 31263^{126}, 32523^{252}, 35043^{504} and 310083^{1008} are squares of odd numbers, hence congruent to 11 modulo 88. Thus 3126+13^{126} + 1, 3252+13^{252} + 1, 3504+13^{504} + 1 and 31008+13^{1008} + 1 are congruent to 22 modulo 88. Consequently, these four factors are divisible by 22 but not by 44.

As 3621(mod8)3^{62} \equiv 1 \pmod{8}, we have 363(mod8)3^6 \equiv 3 \pmod{8} (mod 88). Hence 36313^{63} - 1 and 363+13^{63} + 1 are congruent to 22 and 44 modulo 88, respectively. The former thus is divisible by 22 but not by 44 and the latter is divisible by 44 but not by 88.

Putting it all together, the exponent of 22 in the product is 1+2+1+1+1+1=71+2+1+1+1+1=7.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.