Difference between revisions of "2019 AMC 8 Problems/Problem 13"
(→Problem 13) |
(→See Also) |
||
Line 12: | Line 12: | ||
Video Solution - https://youtu.be/Lw8fSbX_8FU (Also explains problems 11-20) | Video Solution - https://youtu.be/Lw8fSbX_8FU (Also explains problems 11-20) | ||
− | ==See | + | ==See also== |
{{AMC8 box|year=2019|num-b=12|num-a=14}} | {{AMC8 box|year=2019|num-b=12|num-a=14}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 11:31, 31 October 2020
Contents
Problem 13
A palindrome is a number that has the same value when read from left to right or from right to left. (For example, 12321 is a palindrome.) Let be the least three-digit integer which is not a palindrome but which is the sum of three distinct two-digit palindromes. What is the sum of the digits of ?
Solution 1
Note that the only positive 2-digit palindromes are multiples of 11, namely . Since is the sum of 2-digit palindromes, is necessarily a multiple of 11. The smallest 3-digit multiple of 11 which is not a palindrome is 110, so is a candidate solution. We must check that 110 can be written as the sum of three distinct 2-digit palindromes; this suffices as . Then , and the sum of the digits of is .
Solution 2
Associated video - https://www.youtube.com/watch?v=bOnNFeZs7S8
Video Solution - https://youtu.be/Lw8fSbX_8FU (Also explains problems 11-20)
See also
2019 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
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 AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.