2015 AIME I Problems/Problem 1: Difference between revisions
Jackshi2006 (talk | contribs) |
Shubhashubha (talk | contribs) |
||
| Line 28: | Line 28: | ||
< | <cmath>2, 12, 30, 56, 90...(39)</cmath> | ||
< | <cmath>6, 18, 26, 34...</cmath> | ||
< | <cmath>8, 8, 8...</cmath> | ||
and | and | ||
< | <cmath>(1) 6, 20, 42, 72...</cmath> | ||
<cmath>14, 22, 30...</cmath> | |||
< | <cmath>8, 8, 8...</cmath> | ||
Then we use Newton's Little Formula for the sum of <math>n</math> terms in a sequence. | |||
Notice that there are <math>19</math> terms in each sequence, plus the tails of <math>39</math> and <math>1</math> on the first and second equations, respectively. | |||
So, | |||
<cmath>2\binom{19}{1}+10\binom{19}{2}+8\binom{19}{3}+1</cmath> | |||
<cmath>6\binom{19}{1}+14\binom{19}{2}+8\binom{19}{3}+39</cmath> | |||
Subtracting <math>A</math> from <math>B</math> gives: | |||
<cmath>4\binom{19}{1}+4\binom{19}{2}-38</cmath> | |||
Revision as of 11:30, 30 May 2020
Problem
The expressions
=
and
=
are obtained by writing multiplication and addition operators in an alternating pattern between successive integers. Find the positive difference between integers
and
.
Solution 1
We see that
and
.
Therefore,
Solution 2 (slower solution)
For those that aren't shrewd enough to recognize the above, we may use Newton's Little Formula to semi-bash the equations.
We write down the pairs of numbers after multiplication and solve each layer:
and
Then we use Newton's Little Formula for the sum of
terms in a sequence.
Notice that there are
terms in each sequence, plus the tails of
and
on the first and second equations, respectively.
So,
Subtracting
from
gives:
Which unsurprisingly gives us
-jackshi2006
See also
| 2015 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by First Problem |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America.