AMC 10 Step by Step

2020 AMC 10A Problem 21

P21-25~7 minPrint

There exists a unique strictly increasing sequence of nonnegative integers a1<a2<…<aka_1 < a_2 < … < a_k such that 2289+1217+1=2a1+2a2+…+2ak.\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}. What is k?k?

Log in to save your progress.
Show solution without answering

Key insight

Let x be 2 to the 17th. The fraction becomes x^16 - x^15 + ... + 1, and each pair like x^16 - x^15 is seventeen ones in binary.

Solution

The right side is just the number written in binary: kk is how many 11s the number has in base 22. So we need to write the fraction in binary.

A small example first. Try 29+123+1=5139=57\frac{2^9 + 1}{2^3 + 1} = \frac{513}{9} = 57. With x=23=8x = 2^3 = 8, this is x2−x+1=64−8+1x^2 - x + 1 = 64 - 8 + 1. Now 64−8=5664 - 8 = 56, which is 111000111000 in binary: a run of three 11s. Adding 11 gives 111001111001, with four 11s in all. The same idea works for the real problem.

1. Simplify. 289=17×17289 = 17 \times 17, so 2289=(217)172^{289} = (2^{17})^{17}. Let x=217x = 2^{17}. The fraction is x17+1x+1\frac{x^{17} + 1}{x + 1}.
2. Divide. Because 1717 is odd, x+1x + 1 divides x17+1x^{17} + 1 evenly, and
x17+1x+1=x16−x15+x14−x13+⋯+x2−x+1.\frac{x^{17} + 1}{x + 1} = x^{16} - x^{15} + x^{14} - x^{13} + \cdots + x^2 - x + 1.
(Check by multiplying by x+1x + 1: almost every term cancels, leaving x17+1x^{17} + 1.)
3. Get rid of the minus signs. Binary allows only plus signs, so group the terms in pairs:
(x16−x15)+(x14−x13)+⋯+(x2−x)+1.(x^{16} - x^{15}) + (x^{14} - x^{13}) + \cdots + (x^2 - x) + 1.
There are 88 pairs.
4. What does one pair look like in binary? Take x2−x=x(x−1)=217(217−1)x^2 - x = x(x - 1) = 2^{17}(2^{17} - 1). The number 217−12^{17} - 1 is seventeen 11s in binary (just as 23−1=7=1112^3 - 1 = 7 = 111). Multiplying by 2172^{17} shifts it left, adding zeros on the right. So each pair is a run of 1717 ones.
5. Do the runs overlap? The pair x2−xx^2 - x fills binary places 1717 through 3333. The pair x4−x3x^4 - x^3 fills places 5151 through 6767, and so on: each pair has its own block, with a gap of 1717 zeros between blocks. The final +1+1 sits at place 00, which no block touches.
6. Count. 88 runs of 1717 ones, plus the final 11: 8×17+1=1378 \times 17 + 1 = 137.

The answer is (C) 137\boxed{\textbf{(C)}\ 137}.

Why this works

A difference like 2a−2b2^{a} - 2^{b} (with a>ba > b) is a run of a−ba - b ones in binary. So a sum with alternating signs can be turned into pure binary by pairing each plus term with the minus term right after it. Trying a tiny version of the problem first shows the pattern and catches the easy-to-miss final +1+1.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Since 289=172289 = 17^2, set x=217x = 2^{17}. Then 2289=x172^{289} = x^{17} and the fraction becomes
x17+1x+1=x16−x15+x14−⋯−x+1,\frac{x^{17} + 1}{x + 1} = x^{16} - x^{15} + x^{14} - \cdots - x + 1,
the standard factorization of a sum of odd powers. The question asks how many 11s this number has in binary, since the aia_i are the positions of the 11 bits.

The alternating signs must be removed. Group consecutive pairs:
(x16−x15)+(x14−x13)+⋯+(x2−x)+1.(x^{16} - x^{15}) + (x^{14} - x^{13}) + \cdots + (x^2 - x) + 1.
Each pair is x2j−1(x−1)=217(2j−1)⋅(217−1)x^{2j-1}(x - 1) = 2^{17(2j-1)} \cdot (2^{17} - 1). In binary 217−12^{17} - 1 is seventeen 11s, and multiplying by a power of 22 just shifts, so each pair contributes exactly 1717 ones, occupying bits 17(2j−1)17(2j-1) through 17⋅2j−117 \cdot 2j - 1. These bit ranges for j=1,…,8j = 1, \dots, 8 are disjoint and never touch bit 00, where the lone +1+1 sits.

Counting: 88 pairs ×\times 1717 ones +1=137+ 1 = 137.

The answer is (C) 137\boxed{\textbf{(C)}\ 137}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.