Difference between revisions of "1973 USAMO Problems/Problem 2"
Juicefruit (talk | contribs) (→Solution 2) |
|||
(6 intermediate revisions by the same user not shown) | |||
Line 34: | Line 34: | ||
{{alternate solutions}} | {{alternate solutions}} | ||
+ | |||
+ | ==Solution 2== | ||
+ | |||
+ | We can solve this problem by finding a particular solution for each linear recurrence. | ||
+ | |||
+ | <math>X_{n+1} - X_n - 2X_{n-1} = 0</math> with characteristic polynomial | ||
+ | |||
+ | <math>X^2 - X - 2 = (X - 2)(X + 1)</math>, so <math>X = -1, 2</math> | ||
+ | |||
+ | <math>X_n = A(2)^n + B(-1)^n</math> | ||
+ | |||
+ | After plugging in to find the particular solution: | ||
+ | |||
+ | <math>X_0 = 1 = A + B</math> | ||
+ | |||
+ | <math>X_1 = 1 = 2A - B</math> | ||
+ | |||
+ | <math>A = \frac{1}{3}</math> and <math>B = \frac{2}{3}</math>, so | ||
+ | |||
+ | <math>X_n = \frac{1}{3}(2)^n + \frac{2}{3}(-1)^n</math> | ||
+ | |||
+ | Doing the same for <math>Y_n</math>, we get | ||
+ | |||
+ | <math>Y_n = 2(3)^n - (-1)^n</math> | ||
+ | |||
+ | We know they're equal at <math>n = 0</math>, so let's set them equal and compare. | ||
+ | |||
+ | <math>2(3)^n - (-1)^n = \frac{1}{3}((2)^n + 2(-1)^n)</math> | ||
+ | |||
+ | <math>6(3)^n - 3(-1)^n = (2)^n + 2(-1)^n</math> | ||
+ | |||
+ | <math>6(3)^n - 2^n = 5(-1)^n</math> | ||
+ | |||
+ | By induction, we know in general that <math>(\alpha + 1)^n > \alpha^n</math> for all <math>\alpha, n > 0</math>, so <math>6(3)^n > 2^n</math> for all <math>n > 1</math>. | ||
+ | |||
+ | Therefore, the left hand side is always increasing and will never equal 5 again, so equality between <math>X_n</math> and <math>Y_n</math> only holds when <math>n = 0</math>, so they only share 1 term. | ||
==See Also== | ==See Also== |
Latest revision as of 10:38, 3 June 2024
Contents
Problem
Let and denote two sequences of integers defined as follows:
Thus, the first few terms of the sequences are:
Prove that, except for the "1", there is no term which occurs in both sequences.
Solution
We can look at each sequence :
- Proof that repeats :
The third and fourth terms are and . Plugging into the formula, we see that the next term is , and plugging and , we get that the next term is . Thus the sequence repeats, and the pattern is .
- Proof that repeats :
The first and second terms are and . Plugging into the formula, we see that the next term is , and plugging and , we get that the next term is . Thus the sequence repeats, and the pattern is .
Combining both results, we see that and are not congruent when and . Thus after the "1", the terms of each sequence are not equal.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
Solution 2
We can solve this problem by finding a particular solution for each linear recurrence.
with characteristic polynomial
, so
After plugging in to find the particular solution:
and , so
Doing the same for , we get
We know they're equal at , so let's set them equal and compare.
By induction, we know in general that for all , so for all .
Therefore, the left hand side is always increasing and will never equal 5 again, so equality between and only holds when , so they only share 1 term.
See Also
1973 USAMO (Problems • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.