Difference between revisions of "1986 AIME Problems/Problem 7"
m (Added brackets to "(n+1)th term") |
m (→Solution 2) |
||
Line 9: | Line 9: | ||
=== Solution 2 === | === Solution 2 === | ||
− | Notice that the first term of the sequence is <math>1</math>, the second is <math>3</math>, the fourth is <math>9</math>, and so on. Thus the <math>64th</math> term of the sequence is <math>729</math>. Now out of <math>64</math> terms which are of the form <math>729</math> + <math>'''S'''</math>, <math>32</math> of them include <math>243</math> and <math>32</math> do not. The smallest term that includes <math>243</math>, i.e. <math>972</math>, is greater than the largest term which does not, or <math>854</math>. So the <math> | + | Notice that the first term of the sequence is <math>1</math>, the second is <math>3</math>, the fourth is <math>9</math>, and so on. Thus the <math>64th</math> term of the sequence is <math>729</math>. Now out of <math>64</math> terms which are of the form <math>729</math> + <math>'''S'''</math>, <math>32</math> of them include <math>243</math> and <math>32</math> do not. The smallest term that includes <math>243</math>, i.e. <math>972</math>, is greater than the largest term which does not, or <math>854</math>. So the <math>96</math>th term will be <math>972</math>, then <math>973</math>, then <math>975</math>, then <math>976</math>, and finally <math>\boxed{981}</math> |
− | |||
=== Solution 3 === | === Solution 3 === |
Revision as of 23:03, 18 March 2020
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.