Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2002 AMC 12A Problems/Problem 21"
m (→‎Solution)
Line 28: Line 28:
  
 
We have <math>\lfloor 10000/60 \rfloor = 166</math> and <math>166\cdot 12 = 1992</math>, therefore <math>S_{1992} = 60\cdot 166 = 9960</math>.
 
We have <math>\lfloor 10000/60 \rfloor = 166</math> and <math>166\cdot 12 = 1992</math>, therefore <math>S_{1992} = 60\cdot 166 = 9960</math>.
−
The rest can now be computed by hand, we get <math>S_{1998} = 9960+4+7+1+8+9+7= 9996</math>, and <math>S_{1999}=9996 + 6 = 10002</math>, thus the answer is <math>\boxed{(B)1999}</math>.
+
The rest can now be computed by hand, we get <math>S_{1998} = 9960+4+7+1+8+9+7= 9996</math>, and <math>S_{1999}=9996 + 6 = 10002</math>, thus the answer is <math>\boxed{\mathrm{(B) }1999}</math>.
  
 
== See Also ==
 
== See Also ==

Revision as of 19:55, 8 April 2023

Problem

Consider the sequence of numbers: $4,7,1,8,9,7,6,\dots$ For $n>2$, the $n$-th term of the sequence is the units digit of the sum of the two previous terms. Let $S_n$ denote the sum of the first $n$ terms of this sequence. The smallest value of $n$ for which $S_n>10,000$ is:

$\text{(A) }1992 \qquad \text{(B) }1999 \qquad \text{(C) }2001 \qquad \text{(D) }2002 \qquad \text{(E) }2004$

Solution

The sequence is infinite. As there are only $100$ pairs of digits, sooner or later a pair of consecutive digits will occur for the second time. As each next digit only depends on the previous two, from this point on the sequence will be periodic.

(Additionally, as every two consecutive digits uniquely determine the previous one as well, the first pair of digits that will occur twice must be the first pair $4,7$.)

Hence it is a good idea to find the period. Writing down more terms of the sequence, we get:

\[4,7,1,8,9,7,6,3,9,2,1,3,4,7,\dots\]

and we found the period. The length of the period is $12$, and its sum is $4+7+\cdots+1+3 = 60$. Hence for each $k$ we have $S_{12k} = 60k$.

We have $\lfloor 10000/60 \rfloor = 166$ and $166\cdot 12 = 1992$, therefore $S_{1992} = 60\cdot 166 = 9960$. The rest can now be computed by hand, we get $S_{1998} = 9960+4+7+1+8+9+7= 9996$, and $S_{1999}=9996 + 6 = 10002$, thus the answer is $\boxed{\mathrm{(B) }1999}$.

See Also

2002 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 20 		Followed by
Problem 22
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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_AMC_12A_Problems/Problem_21&oldid=191929"