Difference between revisions of "2018 AMC 10B Problems/Problem 20"
Random guy (talk | contribs) |
m (→Solution 2 (A Bit Bashy)) |
||
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{(B) 2017}.</cmath> |
− | |||
==Solution 3(Bashy Pattern Finding)== | ==Solution 3(Bashy Pattern Finding)== | ||
Writing out the first few values, we get: | Writing out the first few values, we get: |
Revision as of 00:53, 19 February 2018
Contents
Problem
A function is defined recursively by and for all integers . What is ?
Solution 1
Thus, .
Solution 2 (A Bit Bashy)
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
Solution 3(Bashy Pattern Finding)
Writing out the first few values, we get: . Examining, we see that every number where has , , and . The greatest number that's 1 (mod 6) and less is , so we have \boxed B$ (Random_Guy)
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.