2013 AMC 10B Problem 21
Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term, beginning with the third, is the sum of the previous two terms, and the seventh term of each sequence is . What is the smallest possible value of ?
Show solution without answering
Key insight
The seventh term is 5a + 8b. Two different starts give the same seventh term only if one start is 8 more in a and 5 less in b.
Solution
1. Call the first two terms and and write out the sequence:
So the seventh term is .
2. "Non-decreasing" means no term is smaller than the one before. The only step that can fail is from to , so we need . After that, each new term adds a number that is or more, so it never goes down.
3. Now take two sequences, starting with and , where . They have the same seventh term:
4. The right side is a multiple of , and shares no factor with , so must be a multiple of . The smallest possibility is , and then . (Raising by adds , and lowering by takes away.)
5. The second sequence must also be non-decreasing, so :
A bigger jump in (like ) only makes this worse.
cannot be below : from step 5, , so .
works: take , and its partner , :
Both are non-decreasing, their first terms differ, and both reach .
The answer is .
Why this works
A sequence where each term is the sum of the two before it is completely decided by its first two terms, and every later term is a simple combination of them. "Same seventh term" becomes one equation, and because and share no factor, two solutions must differ by a fixed jump. The non-decreasing rule on the shifted sequence then gives a lower limit.
Alternative approach
Test the answer choices from the smallest, listing pairs with and .
- : gives ; gives . Only one valid pair, so fails.
- : gives ; gives . Only one valid pair, so fails.
- : gives ; gives ; gives . Two valid pairs, so works.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let the first two terms be and . The sequence is
so . Non-decreasing requires (after that, every term is a sum of nonnegative terms, so the condition holds automatically).
Suppose and with both give : , so . Since , is a multiple of and the same multiple of . The smallest jump is , .
The second pair must still be non-decreasing: , i.e. . To minimize take and , giving , with the partner pair .
Check: and . Both are non-decreasing with different first terms. Any valid configuration has , so .
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Introduction to Number Theory, Chapter 7: Algebra With Integers
- Introduction to Algebra, Chapter 11: Special Factorizations
- Intermediate Algebra, Chapter 17: More Sequences and Series (§17.1, §17.2)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.