Olympiad Maths Prep

Track / Stage 8 / 177 of 180 #1877 of 2000

Problem 1877

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.9 Prove it IMO 2006 Shortlisted Problems · IMO · 2006

The sequence c0,c1,,cn,c_{0}, c_{1}, \ldots, c_{n}, \ldots is defined by c0=1c_{0}=1, c1=0c_{1}=0 and cn+2=cn+1+cnc_{n+2}=c_{n+1}+c_{n} for n0n \geq 0. Consider the set SS of ordered pairs (x,y)(x, y) for which there is a finite set JJ of positive integers such that x=jJcjx=\sum_{j \in J} c_{j}, y=jJcj1y=\sum_{j \in J} c_{j-1}. Prove that there exist real numbers α\alpha, β\beta and mm, MM with the following property: An ordered pair of nonnegative integers (x,y)(x, y) satisfies the inequality
m<αx+βy<M m<\alpha x+\beta y<M
if and only if (x,y)S(x, y) \in S.

N. B. A sum over the elements of the empty set is assumed to be 00.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Let φ=(1+5)/2\varphi=(1+\sqrt{5}) / 2 and ψ=(15)/2\psi=(1-\sqrt{5}) / 2 be the roots of the quadratic equation t2t1=0t^{2}-t-1=0. So φψ=1\varphi \psi=-1, φ+ψ=1\varphi+\psi=1 and 1+ψ=ψ21+\psi=\psi^{2}. An easy induction shows that the general term cnc_{n} of the given sequence satisfies
cn=φn1ψn1φψ for n0 c_{n}=\frac{\varphi^{n-1}-\psi^{n-1}}{\varphi-\psi} \quad \text{ for } n \geq 0
Suppose that the numbers α\alpha and β\beta have the stated property, for appropriately chosen mm and MM. Since (cn,cn1)S\left(c_{n}, c_{n-1}\right) \in S for each nn, the expression
αcn+βcn1=α5(φn1ψn1)+β5(φn2ψn2)=15[(αφ+β)φn2(αψ+β)ψn2]\alpha c_{n}+\beta c_{n-1}=\frac{\alpha}{\sqrt{5}}\left(\varphi^{n-1}-\psi^{n-1}\right)+\frac{\beta}{\sqrt{5}}\left(\varphi^{n-2}-\psi^{n-2}\right)=\frac{1}{\sqrt{5}}\left[(\alpha \varphi+\beta) \varphi^{n-2}-(\alpha \psi+\beta) \psi^{n-2}\right]
is bounded as nn grows to infinity. Because φ>1\varphi>1 and 1<ψ<0-1<\psi<0, this implies αφ+β=0\alpha \varphi+\beta=0.
To satisfy αφ+β=0\alpha \varphi+\beta=0, one can set for instance α=ψ\alpha=\psi, β=1\beta=1. We now find the required mm and MM for this choice of α\alpha and β\beta.
Note first that the above displayed equation gives cnψ+cn1=ψn1c_{n} \psi+c_{n-1}=\psi^{n-1}, n1n \geq 1. In the sequel, we denote the pairs in SS by (aJ,bJ)\left(a_{J}, b_{J}\right), where JJ is a finite subset of the set N\mathbb{N} of positive integers and aJ=jJcja_{J}=\sum_{j \in J} c_{j}, bJ=jJcj1b_{J}=\sum_{j \in J} c_{j-1}. Since ψaJ+bJ=jJ(cjψ+cj1)\psi a_{J}+b_{J}=\sum_{j \in J}\left(c_{j} \psi+c_{j-1}\right), we obtain
ψaJ+bJ=jJψj1 for each (aJ,bJ)S \begin{equation*} \psi a_{J}+b_{J}=\sum_{j \in J} \psi^{j-1} \quad \text{ for each }\left(a_{J}, b_{J}\right) \in S \tag{1} \end{equation*}
On the other hand, in view of 1<ψ<0-1<\psi<0,
1=ψ1ψ2=j=0ψ2j+1<jJψj1<j=0ψ2j=11ψ2=1ψ=φ -1=\frac{\psi}{1-\psi^{2}}=\sum_{j=0}^{\infty} \psi^{2 j+1}<\sum_{j \in J} \psi^{j-1}<\sum_{j=0}^{\infty} \psi^{2 j}=\frac{1}{1-\psi^{2}}=1-\psi=\varphi
Therefore, according to (1),
1<ψaJ+bJ<φ for each (aJ,bJ)S. -1<\psi a_{J}+b_{J}<\varphi \quad \text{ for each }\left(a_{J}, b_{J}\right) \in S .
Thus m=1m=-1 and M=φM=\varphi is an appropriate choice.
Conversely, we prove that if an ordered pair of nonnegative integers (x,y)(x, y) satisfies the inequality 1<ψx+y<φ-1<\psi x+y<\varphi then (x,y)S(x, y) \in S.
Lemma. Let x,yx, y be nonnegative integers such that 1<ψx+y<φ-1<\psi x+y<\varphi. Then there exists a subset JJ of N\mathbb{N} such that
ψx+y=jJψj1 \begin{equation*} \psi x+y=\sum_{j \in J} \psi^{j-1} \tag{2} \end{equation*}
Proof. For x=y=0x=y=0 it suffices to choose the empty subset of N\mathbb{N} as JJ, so let at least one of x,yx, y be nonzero. There exist representations of ψx+y\psi x+y of the form
ψx+y=ψi1++ψik \psi x+y=\psi^{i_{1}}+\cdots+\psi^{i_{k}}
where i1iki_{1} \leq \cdots \leq i_{k} is a sequence of nonnegative integers, not necessarily distinct. For instance, we can take xx summands ψ1=ψ\psi^{1}=\psi and yy summands ψ0=1\psi^{0}=1. Consider all such representations of minimum length kk and focus on the ones for which i1i_{1} has the minimum possible value j1j_{1}. Among them, consider the representations where i2i_{2} has the minimum possible value j2j_{2}. Upon choosing j3,,jkj_{3}, \ldots, j_{k} analogously, we obtain a sequence j1jkj_{1} \leq \cdots \leq j_{k} which clearly satisfies ψx+y=r=1kψjr\psi x+y=\sum_{r=1}^{k} \psi^{j_{r}}. To prove the lemma, it suffices to show that j1,,jkj_{1}, \ldots, j_{k} are pairwise distinct.
Suppose on the contrary that jr=jr+1j_{r}=j_{r+1} for some r=1,,k1r=1, \ldots, k-1. Let us consider the case jr2j_{r} \geq 2 first. Observing that 2ψ2=1+ψ32 \psi^{2}=1+\psi^{3}, we replace jrj_{r} and jr+1j_{r+1} by jr2j_{r}-2 and jr+1j_{r}+1, respectively. Since
ψjr+ψjr+1=2ψjr=ψjr2(1+ψ3)=ψjr2+ψjr+1, \psi^{j_{r}}+\psi^{j_{r+1}}=2 \psi^{j_{r}}=\psi^{j_{r}-2}\left(1+\psi^{3}\right)=\psi^{j_{r}-2}+\psi^{j_{r}+1},
the new sequence also represents ψx+y\psi x+y as needed, and the value of iri_{r} in it contradicts the minimum choice of jrj_{r}.
Let jr=jr+1=0j_{r}=j_{r+1}=0. Then the sum ψx+y=r=1kψjr\psi x+y=\sum_{r=1}^{k} \psi^{j_{r}} contains at least two summands equal to ψ0=1\psi^{0}=1. On the other hand js1j_{s} \neq 1 for all ss, because the equality 1+ψ=ψ21+\psi=\psi^{2} implies that a representation of minimum length cannot contain consecutive iri_{r} 's. It follows that
ψx+y=r=1kψjr>2+ψ3+ψ5+ψ7+=2ψ2=φ, \psi x+y=\sum_{r=1}^{k} \psi^{j_{r}}>2+\psi^{3}+\psi^{5}+\psi^{7}+\cdots=2-\psi^{2}=\varphi,
contradicting the condition of the lemma.
Let jr=jr+1=1j_{r}=j_{r+1}=1; then r=1kψjr\sum_{r=1}^{k} \psi^{j_{r}} contains at least two summands equal to ψ1=ψ\psi^{1}=\psi. Like in the case jr=jr+1=0j_{r}=j_{r+1}=0, we also infer that js0j_{s} \neq 0 and js2j_{s} \neq 2 for all ss. Therefore
ψx+y=r=1kψjr<2ψ+ψ4+ψ6+ψ8+=2ψψ3=1, \psi x+y=\sum_{r=1}^{k} \psi^{j_{r}}<2 \psi+\psi^{4}+\psi^{6}+\psi^{8}+\cdots=2 \psi-\psi^{3}=-1,
which is a contradiction again. The conclusion follows. \square

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.