Difference between revisions of "1973 USAMO Problems/Problem 2"
m (→Problem) |
m |
||
| Line 30: | Line 30: | ||
Combining both results, we see that <math>X_i</math> and <math>Y_j</math> are not congruent <math>\bmod{8}</math> when <math>i\geq 3</math> and <math>j\geq 2</math>. Thus after the "1", the terms of each sequence are not equal. | Combining both results, we see that <math>X_i</math> and <math>Y_j</math> are not congruent <math>\bmod{8}</math> when <math>i\geq 3</math> and <math>j\geq 2</math>. Thus after the "1", the terms of each sequence are not equal. | ||
| − | ==See | + | ==See Also== |
{{USAMO box|year=1973|num-b=1|num-a=3}} | {{USAMO box|year=1973|num-b=1|num-a=3}} | ||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
Revision as of 07:26, 16 September 2012
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.
See Also
| 1973 USAMO (Problems • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||