Maths Olympiad Prep

Library / National Math Olympiad – Final Round /3 of 8

National Math Olympiad – Final Round, 2015

Algebra Difficulty 5.6 AIME, harder Prove it Slovenia

Let a1,a2,a3,…a_1, a_2, a_3, \dots be a sequence of non-zero real numbers which satisfies an2=−an+1an−1a_n^2 = -a_{n+1}a_{n-1} for all positive integers nn, n≥2n \ge 2. Prove that the sequence a2,a4,a6,…a_2, a_4, a_6, \dots is geometric.

Solutions — 3

Solution 1

For each n≥2n \ge 2 we can rearrange the given recursive formula to an+1an=−anan−1\frac{a_{n+1}}{a_n} = -\frac{a_n}{a_{n-1}}. Using this we calculate
a2n+2a2n=a2n+2a2n+1⋅a2n+1a2n=(−a2n+1a2n)⋅(−a2na2n−1)=a2n+1a2n−1. \frac{a_{2n+2}}{a_{2n}} = \frac{a_{2n+2}}{a_{2n+1}} \cdot \frac{a_{2n+1}}{a_{2n}} = \left(-\frac{a_{2n+1}}{a_{2n}}\right) \cdot \left(-\frac{a_{2n}}{a_{2n-1}}\right) = \frac{a_{2n+1}}{a_{2n-1}}.
Using this equation twice in a row we get
a2n+2a2n=a2n+1a2n−1=a2na2n−2, \frac{a_{2n+2}}{a_{2n}} = \frac{a_{2n+1}}{a_{2n-1}} = \frac{a_{2n}}{a_{2n-2}},
which means that the sequence a2,a4,a6,…a_2, a_4, a_6, \dots is geometric.

Solution 2

After we rearrange the formula to an+1an=−anan−1\frac{a_{n+1}}{a_n} = -\frac{a_n}{a_{n-1}} we see that the sequence of positive real numbers ∣a1∣,∣a2∣,∣a3∣,…|a_1|, |a_2|, |a_3|, \dots is geometric, hence there exist positive real numbers aa and qq so that ∣an∣=aqn−1|a_n| = aq^{n-1} for all positive integers nn. It follows that for every nn we have either an=aqn−1a_n = aq^{n-1} or an=−aqn−1a_n = -aq^{n-1}. If we insert 2n+12n+1 instead of nn in the equation that the original sequence is defined with we get a2n+2a2n=−a2n+12≤0a_{2n+2}a_{2n} = -a_{2n+1}^2 \le 0, hence the neighbouring terms in the sequence a2,a4,a6,…a_2, a_4, a_6, \dots are of opposite signs. We deduce that either
a2n=(−1)naq2n−1=−aq(−q2)n−1 a_{2n} = (-1)^n a q^{2n-1} = -a q (-q^2)^{n-1}
for all nn or
a2n=aq(−q2)n−1 a_{2n} = a q (-q^2)^{n-1}
for all nn. In both cases the sequence a2,a4,a6,…a_2, a_4, a_6, \dots is geometric.

Solution 3

We square the equality an2=−an+1an−1a_n^2 = -a_{n+1}a_{n-1} to get (an2)2=an+12an−12(a_n^2)^2 = a_{n+1}^2 a_{n-1}^2. We rearrange this to an+12an2=an2an−12\frac{a_{n+1}^2}{a_n^2} = \frac{a_n^2}{a_{n-1}^2} and notice that the sequence of positive real numbers a12,a22,a32,…a_1^2, a_2^2, a_3^2, \dots is geometric. Therefore there exist positive real numbers aa and qq such that an2=aqn−1a_n^2 = aq^{n-1} for all positive integers nn. It follows that for each nn we have either an=aqn−1a_n = \sqrt{a}\sqrt{q^{n-1}} or an=−aqn−1a_n = -\sqrt{a}\sqrt{q^{n-1}}. Similarly as in Solution 2 we get that either
a2n=(−1)naq2n−1=(−1)naqq2n−2=(−1)naqqn−1=−aq(−q)n−1 a_{2n} = (-1)^n \sqrt{a} \sqrt{q^{2n-1}} = (-1)^n \sqrt{a} \sqrt{q} \sqrt{q^{2n-2}} = (-1)^n \sqrt{a q q^{n-1}} = -\sqrt{a q} (-q)^{n-1}
for all nn or
a2n=aq(−q)n−1 a_{2n} = \sqrt{a q} (-q)^{n-1}
for all nn. In both cases the sequence a2,a4,a6,…a_2, a_4, a_6, \dots is geometric.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.