Understand the problem
If there exists a natural number such that , then prove that either or .
Source of the problem
8 out of 10
Start with hints
Do you really need a hint? Try it first!
Do you know this lemma , Lemma: If and , then .
To prove this, let . ThenEach bracket is divisible by , proving the statement.
We use the fact that the sequence consists of only integers.
We’ll first prove that we cannot have three distinct integers , , and such that , , and (In other words, the variables cannot come in a cycle of 3). Assume that there does exist such numbers. Then we should have , which means . Similarly we can get , which implies equality. Ultimately, it leads to two equal variables, contradiction. In a similar manner we can prove that these variables cannot come in cycles of more than 3.
Therefore, we conclude that the variables of can only come in cycles of most two. We realize that since , we have a cycle . Since the minimal cycle has length at most 2, one of or must be equal to 0, and we are done.
Connected Program at Cheenta
I.S.I. & C.M.I. Entrance Program
Indian Statistical Institute and Chennai Mathematical Institute offer challenging bachelor’s program for gifted students. These courses are B.Stat and B.Math program in I.S.I., B.Sc. Math in C.M.I.
The entrances to these programs are far more challenging than usual engineering entrances. Cheenta offers an intense, problem-driven program for these two entrances.