Maths Olympiad Prep

Library / /75 of 377

Number theory Difficulty 4.7 AIME Prove it United States

Problem:
Find the largest integer nn such that 351213^{512}-1 is divisible by 2n2^{n}.

Solution

Solution:
Write
35121=(3256+1)(32561)=(3256+1)(3128+1)(31281)==(3256+1)(3128+1)(3+1)(31) \begin{aligned} 3^{512}-1 & =\left(3^{256}+1\right)\left(3^{256}-1\right)=\left(3^{256}+1\right)\left(3^{128}+1\right)\left(3^{128}-1\right) \\ & =\cdots=\left(3^{256}+1\right)\left(3^{128}+1\right) \cdots(3+1)(3-1) \end{aligned}
Now each factor 32k+13^{2^{k}}+1, k1k \geq 1, is divisible by just one factor of 22, since 32k+1=(32)2k1+112k1+1=2(mod4)3^{2^{k}}+1=\left(3^{2}\right)^{2^{k-1}}+1 \equiv 1^{2^{k-1}}+1=2 \pmod{4}. Thus we get 88 factors of 22 here, and the remaining terms (3+1)(31)=8(3+1)(3-1)=8 give us 33 more factors of 22, for a total of 1111.

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.