2017 IMO Problems/Problem 1
Problem
For each integer , define the sequence for as Determine all values of such that there exists a number such that for infinitely many values of .
Solution
First we notice the following:
When we start with , we get , , and the pattern repeats.
When we start with , we get , , and the pattern repeats.
When we start with , we get , , and the pattern repeats.
When we start with , we get , ,..., , , , and the pattern repeats.
When this pattern repeats, this means that there exists a number such that for infinitely many values of and that number is either or .
When we start with any number $a_0\not\equiv 0 (mod 3), we don't see a repeating pattern.
Therefore the claim is that$ (Error compiling LaTeX. Unknown error_msg)a_0=3kk$is a positive integer and we need to prove this claim.
When we start with$ (Error compiling LaTeX. Unknown error_msg)a_0=3k3k+33k+63k+3pp(k+p)=3q^2q\sqrt(9q^2)=3qq=kq=36$. In order for these patterns to repeat, any square in the sequence need to be a multiple of 3. This will not work with any number or square that is not a multiple of 3.
So, the answer to this problem is$ (Error compiling LaTeX. Unknown error_msg)a_0=3k\;\forall k \in \mathbb{Z}^{+}$
~Tomas Diaz. orders@tomasdiaz.com
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
2017 IMO (Problems) • Resources | ||
Preceded by First Problem |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |