Difference between revisions of "1986 AIME Problems/Problem 7"
m (→Solution 3) |
m (Fixed LaTeX in Solution 3) |
||
Line 14: | Line 14: | ||
=== Solution 3 === | === Solution 3 === | ||
− | After the | + | After the <math>n</math>th power of 3 in the sequence, the number of terms after that power but before the <math>n+1</math>th power of 3 is equal to the number of terms before the <math>n</math>th power, because those terms after the <math>n</math>th power are just the <math>n</math>th power plus all the distinct combinations of powers of 3 before it, which is just all the terms before it. Adding the powers of <math>3</math> and the terms that come after them, we see that the <math>100</math>th term is after <math>729</math>, which is the <math>64</math>th term. Also, note that the <math>k</math>th term after the <math>n</math>th power of 3 is equal to the power plus the <math>k</math>th term in the entire sequence. Thus, the <math>100</math>th term is <math>729</math> plus the <math>36</math>th term. Using the same logic, the <math>36</math>th term is <math>243</math> plus the <math>4</math>th term, <math>9</math>. We now have <math>729+243+9=\boxed{981}</math> |
== See also == | == See also == |
Revision as of 21:46, 2 April 2018
Problem
The increasing sequence consists of all those positive integers which are powers of 3 or sums of distinct powers of 3. Find the
term of this sequence.
Solution
Solution 1
Rewrite all of the terms in base 3. Since the numbers are sums of distinct powers of 3, in base 3 each number is a sequence of 1s and 0s (if there is a 2, then it is no longer the sum of distinct powers of 3). Therefore, we can recast this into base 2 (binary) in order to determine the 100th number. is equal to
, so in binary form we get
. However, we must change it back to base 10 for the answer, which is
.
Solution 2
Notice that the first term of the sequence is , the second is
, the fourth is
, and so on. Thus the
term of the sequence is
. Now out of
terms which are of the form
+
,
of them include
and
do not. The smallest term that includes
, i.e.
, is greater than the largest term which does not, or
. So the
th term will be
, then
, then
, then
, and finally
Solution 3
After the th power of 3 in the sequence, the number of terms after that power but before the
th power of 3 is equal to the number of terms before the
th power, because those terms after the
th power are just the
th power plus all the distinct combinations of powers of 3 before it, which is just all the terms before it. Adding the powers of
and the terms that come after them, we see that the
th term is after
, which is the
th term. Also, note that the
th term after the
th power of 3 is equal to the power plus the
th term in the entire sequence. Thus, the
th term is
plus the
th term. Using the same logic, the
th term is
plus the
th term,
. We now have
See also
1986 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
- AIME Problems and Solutions
- American Invitational Mathematics Examination
- Mathematics competition resources
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.