Browse · MathNet
PrintFinal Round
Netherlands algebra
Problem
For a given value , we consider number sequences such that for all .
a. Suppose that . Determine all starting values such that holds for all .
b. Suppose that . Investigate whether for all starting values different from and .
a. Suppose that . Determine all starting values such that holds for all .
b. Suppose that . Investigate whether for all starting values different from and .
Solution
a. First, we determine for what starting values the inequalities hold. Then, we will prove that for those starting values, the inequalities are also valid for all .
First, we observe that and that the denominator, , is positive (since ). The inequality is therefore equivalent to the inequality as we can multiply all parts in the inequality by the positive number . Subtracting from all parts of the inequality, we see that this is equivalent to We therefore need to have (i.e. ), and (i.e. ). The starting value must therefore satisfy .
Now suppose that , so that satisfies . Looking at , we see that . That is the same expression as for , only with replaced by . Since also satisfies , the same argument now shows that .
We can repeat the same argument to show this for , , etcetera. Hence, we find that holds for all . The formal proof is done using induction: the induction basis has been shown above. For the induction step, see the solution of part (b) of the version for klas 5 & klas 4 and below. The result is that all inequalities hold if and only if .
b. Let's start by computing the first few numbers of the sequence in terms of . We see that and Here, it is important that we do not divide by zero, that is, and . The first inequality follows directly from the assumption. For the second inequality we consider when holds. This is the case if and only if , if and only if . Since we assumed that , we see that . The next number in the sequence is Again, we are not dividing by zero since only holds when , which is never the case.
We see that . Since only depends on , we see that , , , etcetera. In other words: the sequence is periodic with period 3, and we see that To conclude: indeed we have for all starting values unequal to 1 and .
First, we observe that and that the denominator, , is positive (since ). The inequality is therefore equivalent to the inequality as we can multiply all parts in the inequality by the positive number . Subtracting from all parts of the inequality, we see that this is equivalent to We therefore need to have (i.e. ), and (i.e. ). The starting value must therefore satisfy .
Now suppose that , so that satisfies . Looking at , we see that . That is the same expression as for , only with replaced by . Since also satisfies , the same argument now shows that .
We can repeat the same argument to show this for , , etcetera. Hence, we find that holds for all . The formal proof is done using induction: the induction basis has been shown above. For the induction step, see the solution of part (b) of the version for klas 5 & klas 4 and below. The result is that all inequalities hold if and only if .
b. Let's start by computing the first few numbers of the sequence in terms of . We see that and Here, it is important that we do not divide by zero, that is, and . The first inequality follows directly from the assumption. For the second inequality we consider when holds. This is the case if and only if , if and only if . Since we assumed that , we see that . The next number in the sequence is Again, we are not dividing by zero since only holds when , which is never the case.
We see that . Since only depends on , we see that , , , etcetera. In other words: the sequence is periodic with period 3, and we see that To conclude: indeed we have for all starting values unequal to 1 and .
Final answer
a) Exactly those starting values with 1 ≤ a1 ≤ 2. b) Yes; for all starting values not equal to −1 and 1, the sequence is periodic with period 3, so a2020 = a1.
Techniques
Recurrence relationsLinear and quadratic inequalities