2007 AMC 12B Problem 21

Attempt Problem 21 of the 2007 AMC 12B 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 2007 AMC 12B solutions, or check the answer key.

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

21.

The first 20072007 positive integers are each written in base 3.3. How many of these base-33 representations are palindromes? (A palindrome is a number that reads the same forward and backward.)

100100

101101

102102

103103

104104

Answer: A
Concepts:number basepalindromecasework
Difficulty rating: 2100
Solution:

A palindrome is fixed by its first half. Counting base-33 palindromes by length gives 22 of length 11 or 2,2, 66 of length 33 or 4,4, 1818 of length 55 or 6,6, and 5454 of length 7.7.

That totals 2+2+6+6+18+182+2+6+6+18+18 +54=106+54=106 palindromes with at most 77 digits. Since 2007=22021003,2007=2202100_3, the 77-digit palindromes larger than it are 2210122,2210122, 2211122,2211122, 2212122,2212122, 2220222,2220222, 2221222,2221222, and 2222222,2222222, which is 66 of them.

Therefore the count is 1066=100.106-6=100.

Thus, the correct answer is A.

← Problem 20#20
Full Exam

Problem 21 in Other Years