Difference between revisions of "2014 AMC 12A Problems/Problem 15"
(Created page with "==Problem== A five-digit palindrome is a positive integer with respective digits <math>abcba</math>, where <math>a</math> is non-zero. Let <math>S</math> be the sum of all five...") |
m (→Solution 4 (Variation of #2)) |
||
(35 intermediate revisions by 17 users not shown) | |||
Line 9: | Line 9: | ||
\textbf{(E) }45\qquad</math> | \textbf{(E) }45\qquad</math> | ||
− | ==Solution== | + | ==Solution 1== |
For each digit <math>a=1,2,\ldots,9</math> there are <math>10\cdot10</math> (ways of choosing <math>b</math> and <math>c</math>) palindromes. So the <math>a</math>s contribute <math>(1+2+\cdots+9)(100)(10^4+1)</math> to the sum. | For each digit <math>a=1,2,\ldots,9</math> there are <math>10\cdot10</math> (ways of choosing <math>b</math> and <math>c</math>) palindromes. So the <math>a</math>s contribute <math>(1+2+\cdots+9)(100)(10^4+1)</math> to the sum. | ||
Line 15: | Line 15: | ||
Similarly, for each <math>c=0,1,2,\ldots,9</math> there are <math>9\cdot10</math> palindromes, so the <math>c</math> contributes <math>(0+1+2+\cdots+9)(90)(10^2)</math> to the sum. | Similarly, for each <math>c=0,1,2,\ldots,9</math> there are <math>9\cdot10</math> palindromes, so the <math>c</math> contributes <math>(0+1+2+\cdots+9)(90)(10^2)</math> to the sum. | ||
− | It just so happens that <cmath> (1+2+\cdots+9)(100)(10^4+1)+(1+2+\cdots+9)(90)(10^3+10)+(1+2+\cdots+9)(90)(10^2)=49500000 </cmath> so the sum of the digits of the sum is | + | It just so happens that <cmath> (1+2+\cdots+9)(100)(10^4+1)+(1+2+\cdots+9)(90)(10^3+10)+(1+2+\cdots+9)(90)(10^2)=49500000 </cmath> so the sum of the digits of the sum is <math>\boxed{\textbf{(B)}\; 18}</math>. |
− | (Solution by | + | ==Solution 2== |
+ | Notice that <math>10001+ 99999 = 110000.</math> In fact, ordering the palindromes in ascending order, we find that the sum of the nth palindrome and the nth to last palindrome is <math>110000.</math> We have <math>9\cdot 10\cdot 10</math> palindromes, or <math>450</math> pairs of palindromes summing to <math>110000.</math> Performing the multiplication gives <math>49500000</math>, so the sum <math> \boxed{\textbf{(B)}\; 18}</math>. | ||
+ | |||
+ | ==Solution 3== | ||
+ | As shown above, there are a total of <math>900</math> five-digit palindromes. We can calculate their sum by finding the expected value of a randomly selected palindrome satisfying the conditions given, then multiplying it by <math>900</math> to get our sum. The expected value for the ten-thousands and the units digit is <math>\frac{1+2+3+\cdots+9}{9}=5</math>, and the expected value for the thousands, hundreds, and tens digit is <math>\frac{0+1+2+\cdots+9}{10}=4.5</math>. Therefore our expected value is <math>5\times10^4+4.5\times10^3+4.5\times10^2+4.5\times10^1+5\times10^0=55,\!000</math>. Since the question asks for the sum of the digits of the resulting sum, we do not need to keep the trailing zeros of either <math>55,\!000</math> or <math>900</math>. Thus we only need to calculate <math>55\times9=495</math>, and the desired sum is <math>\boxed{\textbf{(B) }18}</math>. | ||
+ | |||
+ | ==Solution 4 (Variation of #2)== | ||
+ | First, allow <math>a</math> to be zero, and then subtract by how much we overcount. We'll also sum each palindrome with its <math>\textit{complement}</math>. If <math>\overline{abcba}</math> (the line means a, b, and c are digits and <math>abcba\ne a\cdot b\cdot c\cdot b\cdot a</math>) is a palindrome, then its complement is <math>\overline{defed}</math> where <math>d=9-a</math>, <math>e=9-b</math>, <math>f=9-c</math>. Notice how every palindrome has a unique compliment, and that the sum of a palindrome and its complement is <math>99999</math>. Therefore, the sum of our palindromes is <math>99999\times (10^3/2)</math>. (There are <math>10^3/2</math> pairs.) | ||
+ | |||
+ | However, we have overcounted, as something like <math>05350</math> <math>\textit{isn't}</math> a palindrome by the problem's definition, but we've still included it. So we must subtract the sum of numbers in the form <math>\overline{0nmn0}</math>. By the same argument as before, these sum to <math>9990\times (10^2/2)</math>. Therefore, the sum that the problem asks for is: | ||
+ | |||
+ | <cmath>500\times99999-50\times 9990</cmath> | ||
+ | <cmath>=500\times99999-500\times 999</cmath> | ||
+ | <cmath>=500(99999-999)</cmath> | ||
+ | <cmath>=500\times 99000</cmath> | ||
+ | |||
+ | Since all we care about is the sum of the digits, we can drop the <math>0</math>'s. | ||
+ | |||
+ | <cmath>5\times99</cmath> | ||
+ | <cmath>=5\times(100-1)</cmath> | ||
+ | <cmath>=495</cmath> | ||
+ | |||
+ | And finally, <math>4+9+5=\boxed{\textbf{(B)}18}</math> | ||
+ | |||
+ | ==See Also== | ||
+ | {{AMC12 box|year=2014|ab=A|num-b=14|num-a=16}} | ||
+ | {{MAA Notice}} |
Latest revision as of 21:42, 2 August 2021
Problem
A five-digit palindrome is a positive integer with respective digits , where is non-zero. Let be the sum of all five-digit palindromes. What is the sum of the digits of ?
Solution 1
For each digit there are (ways of choosing and ) palindromes. So the s contribute to the sum. For each digit there are (since ) palindromes. So the s contribute to the sum. Similarly, for each there are palindromes, so the contributes to the sum.
It just so happens that so the sum of the digits of the sum is .
Solution 2
Notice that In fact, ordering the palindromes in ascending order, we find that the sum of the nth palindrome and the nth to last palindrome is We have palindromes, or pairs of palindromes summing to Performing the multiplication gives , so the sum .
Solution 3
As shown above, there are a total of five-digit palindromes. We can calculate their sum by finding the expected value of a randomly selected palindrome satisfying the conditions given, then multiplying it by to get our sum. The expected value for the ten-thousands and the units digit is , and the expected value for the thousands, hundreds, and tens digit is . Therefore our expected value is . Since the question asks for the sum of the digits of the resulting sum, we do not need to keep the trailing zeros of either or . Thus we only need to calculate , and the desired sum is .
Solution 4 (Variation of #2)
First, allow to be zero, and then subtract by how much we overcount. We'll also sum each palindrome with its . If (the line means a, b, and c are digits and ) is a palindrome, then its complement is where , , . Notice how every palindrome has a unique compliment, and that the sum of a palindrome and its complement is . Therefore, the sum of our palindromes is . (There are pairs.)
However, we have overcounted, as something like a palindrome by the problem's definition, but we've still included it. So we must subtract the sum of numbers in the form . By the same argument as before, these sum to . Therefore, the sum that the problem asks for is:
Since all we care about is the sum of the digits, we can drop the 's.
And finally,
See Also
2014 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 14 |
Followed by Problem 16 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.