Difference between revisions of "2007 AMC 12A Problems/Problem 11"
Banspeedrun (talk | contribs) (→Solution 2 (Using the provided sequence/Guessing)) |
|||
(19 intermediate revisions by 11 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{duplicate|[[2007 AMC 12A Problems|2007 AMC 12A #11]] and [[2007 AMC 10A Problems/Problem 22|2007 AMC 10A #22]]}} | ||
==Problem== | ==Problem== | ||
− | A finite sequence of three-digit integers has the property that the tens and units digits of each term are, respectively, the hundreds and tens digits of the next term, and the tens and units digits of the last term are, respectively, the hundreds and tens digits of the first term. For example, such a sequence might begin with the terms 247, 475, and 756 and end with the term 824. Let S be the sum of all the terms in the sequence. What is the largest prime factor that always divides S? | + | A finite [[sequence]] of three-digit integers has the property that the tens and units digits of each term are, respectively, the hundreds and tens digits of the next term, and the tens and units digits of the last term are, respectively, the hundreds and tens digits of the first term. For example, such a sequence might begin with the terms 247, 475, and 756 and end with the term 824. Let <math>S</math> be the sum of all the terms in the sequence. What is the largest [[prime]] [[factor]] that always divides <math>S</math>? |
+ | |||
+ | <math>\mathrm{(A)}\ 3\qquad \mathrm{(B)}\ 7\qquad \mathrm{(C)}\ 13\qquad \mathrm{(D)}\ 37\qquad \mathrm{(E)}\ 43</math> | ||
==Solution== | ==Solution== | ||
+ | A given digit appears as the hundreds digit, the tens digit, and the units digit of a term the same number of times. Let <math>k</math> be the sum of the units digits in all the terms. Then <math>S=111k=3 \cdot 37k</math>, so <math>S</math> must be divisible by <math>37\ \mathrm{(D)}</math>. To see that it need not be divisible by any larger prime, the sequence <math>123, 231, 312</math> gives <math>S=666=2 \cdot 3^2 \cdot 37\Rightarrow \mathrm{\boxed{(D)}}</math>. | ||
− | + | ==Solution 2 (Using the provided sequence/Guessing)== | |
+ | Since a prime number will always divide <math>S</math>, the prime number must work on any sequence that follows the stated rule. Since the solution kindly provides us with the terms <math>247,475,756,824</math>,all we have to do is finish the sequence. | ||
+ | |||
+ | One way of finishing the sequence is by adding <math>568,682</math> (before 824) to the sequence and adding them all together. After this, we just divide the result by each of the answer choices. Of the five, <math>37</math> is the largest prime number that divides this sequence, so the answer is <math>{\boxed{(D)}}</math>. | ||
+ | ~Banspeedrun | ||
+ | |||
+ | == Video Solution == | ||
+ | |||
+ | https://www.youtube.com/watch?v=P-phdgVAQqI ~David | ||
==See also== | ==See also== | ||
− | + | {{AMC12 box|year=2007|ab=A|num-b=10|num-a=12}} | |
− | + | {{AMC10 box|year=2007|ab=A|num-b=21|num-a=23}} | |
− | + | ||
+ | [[Category:Introductory Algebra Problems]] | ||
+ | [[Category:Introductory Number Theory Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 15:23, 15 June 2024
- The following problem is from both the 2007 AMC 12A #11 and 2007 AMC 10A #22, so both problems redirect to this page.
Contents
Problem
A finite sequence of three-digit integers has the property that the tens and units digits of each term are, respectively, the hundreds and tens digits of the next term, and the tens and units digits of the last term are, respectively, the hundreds and tens digits of the first term. For example, such a sequence might begin with the terms 247, 475, and 756 and end with the term 824. Let be the sum of all the terms in the sequence. What is the largest prime factor that always divides ?
Solution
A given digit appears as the hundreds digit, the tens digit, and the units digit of a term the same number of times. Let be the sum of the units digits in all the terms. Then , so must be divisible by . To see that it need not be divisible by any larger prime, the sequence gives .
Solution 2 (Using the provided sequence/Guessing)
Since a prime number will always divide , the prime number must work on any sequence that follows the stated rule. Since the solution kindly provides us with the terms ,all we have to do is finish the sequence.
One way of finishing the sequence is by adding (before 824) to the sequence and adding them all together. After this, we just divide the result by each of the answer choices. Of the five, is the largest prime number that divides this sequence, so the answer is . ~Banspeedrun
Video Solution
https://www.youtube.com/watch?v=P-phdgVAQqI ~David
See also
2007 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 10 |
Followed by Problem 12 |
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 |
2007 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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.