Difference between revisions of "2000 AMC 12 Problems/Problem 4"
Kevinmathz (talk | contribs) (→See also) |
(→See also) |
||
Line 14: | Line 14: | ||
== See also == | == See also == | ||
− | {{AMC12 box|year= | + | {{AMC12 box|year=2000|num-b=3|num-a=5}} |
− | {{AMC10 box|year= | + | {{AMC10 box|year=2000|num-b=5|num-a=7}} |
[[Category:Introductory Combinatorics Problems]] | [[Category:Introductory Combinatorics Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 18:46, 27 April 2017
- The following problem is from both the 2000 AMC 12 #4 and 2000 AMC 10 #6, so both problems redirect to this page.
Problem
The Fibonacci sequence starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci sequence?
Solution
Note that any digits other than the units digit will not affect the answer. So to make computation quicker, we can just look at the Fibonacci sequence in :
The last digit to appear in the units position of a number in the Fibonacci sequence is .
See also
2000 AMC 12 (Problems • Answer Key • Resources) | |
Preceded by Problem 3 |
Followed by Problem 5 |
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 |
2000 AMC 10 (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.