2006 AIME I Problem 13

Attempt Problem 13 of the 2006 AIME I below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2006 AIME I solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

13.

For each even positive integer x,x, let g(x)g(x) denote the greatest power of 22 that divides x.x. For example, g(20)=4g(20) = 4 and g(16)=16.g(16) = 16. For each positive integer n,n, let Sn=k=12n1g(2k).S_n = \sum_{k=1}^{2^{n-1}} g(2k). Find the greatest integer nn less than 10001000 such that SnS_n is a perfect square.

Answer: 899
Concepts:power of 2perfect squaresummation
Difficulty rating: 2990
Solution:

SnS_n is the sum of gg over the even numbers 2,4,,2n.2, 4, \ldots, 2^n. Among these 2n12^{n-1} numbers, exactly 2n1i2^{n-1-i} are divisible by 2i2^i but not 2i+12^{i+1} (so have g=2ig = 2^i) for each 1in1,1 \le i \le n - 1, and the single number 2n2^n has g=2n.g = 2^n. Hence Sn=i=1n12i2n1i+2n=(n1)2n1+2n=(n+1)2n1. \begin{aligned} S_n &= \sum_{i=1}^{n-1} 2^i \cdot 2^{n-1-i} \\ &\quad {}+ 2^n \\ &= (n-1) 2^{n-1} + 2^n \\ &= (n+1) 2^{n-1}. \end{aligned}

If nn is even, then n+1n + 1 is odd and the exponent n1n - 1 is odd, so SnS_n has an odd number of factors of 22 and cannot be a perfect square. If nn is odd, then 2n12^{n-1} is already a perfect square, so SnS_n is a perfect square exactly when n+1n + 1 is.

For odd n,n, the number n+1n + 1 is even, and the greatest even perfect square at most 10001000 is 900=302.900 = 30^2. Thus the greatest valid n<1000n \lt 1000 is n=899.n = 899.

← Problem 12#12
Full Exam

Problem 13 in Other Years