Difference between revisions of "2018 AMC 10B Problems/Problem 20"
m (→Solution 2) |
(edit Solution 2) |
||
Line 37: | Line 37: | ||
<cmath>f(14)=13</cmath> | <cmath>f(14)=13</cmath> | ||
− | f(15)=15 | + | <cmath>f(15)=15</cmath> |
− | ..... | + | <cmath>.....</cmath> |
− | Notice | + | Notice that <math>f(n)=n</math> whenever <math>n</math> is an odd multiple of <math>3</math>, and the pattern of numbers that follow will always be +3, +2, +0, -1, +0. |
− | The closest | + | The closest odd multiple of <math>3</math> to <math>2018</math> is <math>2013</math>, so we have |
<cmath>f(2013)=2013</cmath> | <cmath>f(2013)=2013</cmath> | ||
<cmath>f(2014)=2016</cmath> | <cmath>f(2014)=2016</cmath> | ||
Line 46: | Line 46: | ||
<cmath>f(2016)=2018</cmath> | <cmath>f(2016)=2018</cmath> | ||
<cmath>f(2017)=2017</cmath> | <cmath>f(2017)=2017</cmath> | ||
− | <cmath>f(2018)=\boxed{2017}</cmath> | + | <cmath>f(2018)=\boxed{2017}.</cmath> |
==See Also== | ==See Also== | ||
{{AMC10 box|year=2018|ab=B|num-b=19|num-a=21}} | {{AMC10 box|year=2018|ab=B|num-b=19|num-a=21}} | ||
+ | {{AMC12 box|year=2018|ab=B|num-b=17|num-a=19}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 21:31, 16 February 2018
Contents
Problem
A function is defined recursively by and for all integers . What is ?
Solution 1
Thus, .
Solution 2
Start out by listing some terms of the sequence.
Notice that whenever is an odd multiple of , and the pattern of numbers that follow will always be +3, +2, +0, -1, +0. The closest odd multiple of to is , so we have
See Also
2018 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 19 |
Followed by Problem 21 | |
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 |
2018 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 17 |
Followed by Problem 19 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.