Difference between revisions of "Mock AIME 5 Pre 2005 Problems/Problem 12"
m (→See also: whoops) |
(→Solution) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | Let <math>m = 101^4 + 256</math>. Find the sum of digits of <math>m</math>. | + | Let <math>m = 101^4 + 256</math>. Find the sum of the digits of <math>m</math>. |
== Solution == | == Solution == | ||
| − | By the [[binomial theorem]], <math>101^4 + 256 = 104060401 + 256 = 104060657</math> | + | By the [[binomial theorem]], <math>\begin{aligned} 101^4 + 256 &= (100 + 1)^4 + 256 \\ &= (100^4 + 4\cdot 100^3 + 6 \cdot 100^2 + 4 \cdot 100 + 1) + 256 \\ &= 104060401 + 256 = 104060657, \end{aligned}</math> and so the sum of the digits is <math>1+4+6+6+5+7 = \boxed{29}.</math> |
== See also == | == See also == | ||
. Find the sum of the digits of 
.
and so the sum of the digits is 
