Difference between revisions of "2009 AMC 10A Problems/Problem 5"
m (→Solution 1) |
m (→Solution 1) |
||
(15 intermediate revisions by 7 users not shown) | |||
Line 5: | Line 5: | ||
==Solution 1== | ==Solution 1== | ||
− | Using the standard multiplication algorithm, <math>111,111,111^2=12,345,678,987,654,321,</math> whose digit sum is <math> | + | Using the standard multiplication algorithm, <math>111,111,111^2=12,345,678,987,654,321,</math> whose digit sum is <math>\fbox{(E) 81}.</math> |
− | |||
− | + | (I hope you didn't seriously multiply it out... right?) | |
− | |||
− | + | ==Solution 2 -- Nonrigorous solution== | |
+ | We note that | ||
− | We | + | <math>1^2 = 1</math>, |
+ | |||
+ | <math>11^2 = 121</math>, | ||
+ | |||
+ | <math>111^2 = 12321</math>, | ||
+ | |||
+ | and <math>1,111^2 = 1234321</math>. | ||
+ | |||
+ | We can clearly see the pattern: If <math>X</math> is <math>111\cdots111</math>, with <math>n</math> ones (and for the sake of simplicity, assume that <math>n<10</math>), then the sum of the digits of <math>X^2</math> is | ||
+ | |||
+ | <math>1+2+3+4+5\cdots n+(n-1)+(n-2)\cdots+1</math> | ||
+ | |||
+ | <math>=(1+2+3\cdots n)+(1+2+3+\cdots n-1)</math> | ||
+ | |||
+ | <math>=\dfrac{n(n+1)}{2}+\dfrac{(n-1)n}{2}</math> | ||
+ | |||
+ | <math>=\dfrac{n(n+1+n-1)}{2}=\dfrac{2n^2}{2}=n^2.</math> | ||
+ | |||
+ | Aha! We know that <math>111,111,111</math> has <math>9</math> digits, so its digit sum is <math>9^2=\boxed{81(E)}</math>. | ||
==Solution 3== | ==Solution 3== | ||
Line 19: | Line 36: | ||
We can apply this strategy to find <math>111,111,111^2</math>, as seen below. | We can apply this strategy to find <math>111,111,111^2</math>, as seen below. | ||
− | |||
− | |||
− | |||
− | |||
− | = | + | <math>111111111^2=111111111(100000000+10000000\cdots+10+1)</math> |
− | |||
− | <math> | + | <math>=11111111100000000+1111111110000000+\cdots+111111111</math> |
− | <math> | + | <math>=12,345,678,987,654,321</math> |
− | <math> | + | The digit sum is thus <math>1+2+3+4+5+6+7+8+9+8+7+6+5+4+3+2+1=81 \boxed{(E)}</math>. |
− | |||
− | + | ==Solution 4== | |
+ | Note that any number when taken <math>\mod{9}</math> yields the digit sum of that number. So, the problem has simplified to finding <math>111,111,111^2 \pmod{9}</math>. We note that <math>111,111,111 \mod{9}</math> is <math>9</math>, so <math>9^2=81</math>. | ||
==See also== | ==See also== | ||
{{AMC10 box|year=2009|ab=A|num-b=4|num-a=6}} | {{AMC10 box|year=2009|ab=A|num-b=4|num-a=6}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 14:52, 13 September 2020
Contents
Problem
What is the sum of the digits of the square of ?
Solution 1
Using the standard multiplication algorithm, whose digit sum is
(I hope you didn't seriously multiply it out... right?)
Solution 2 -- Nonrigorous solution
We note that
,
,
,
and .
We can clearly see the pattern: If is , with ones (and for the sake of simplicity, assume that ), then the sum of the digits of is
Aha! We know that has digits, so its digit sum is .
Solution 3
We see that can be written as .
We can apply this strategy to find , as seen below.
The digit sum is thus .
Solution 4
Note that any number when taken yields the digit sum of that number. So, the problem has simplified to finding . We note that is , so .
See also
2009 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
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 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.