Maths Olympiad Prep

Library / HMMT February /270 of 1302

HMMT February

Number theory Difficulty 5.0 AIME Find the answer

Find the largest integer nn such that 3512−13^{512}-1 is divisible by 2n2^{n}.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Write 3512−1=(3256+1)(3256−1)=(3256+1)(3128+1)(3128−1)=⋯=(3256+1)(3128+1)⋯(3+1)(3−1) \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+1,k≥13^{2^{k}}+1, k \geq 1, is divisible by just one factor of 2 , since 32k+1=3^{2^{k}}+1= (32)2k−1+1≡12k−1+1=2( mod 4)\left(3^{2}\right)^{2^{k-1}}+1 \equiv 1^{2^{k-1}}+1=2(\bmod 4). Thus we get 8 factors of 2 here, and the remaining terms (3+1)(3−1)=8(3+1)(3-1)=8 give us 3 more factors of 2 , for a total of 11.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.