Maths Olympiad Prep

Library / /13 of 56

Algebra Difficulty 5.1 AIME, harder Prove it Singapore

Let an,bna_n, b_n, n=1,2,n = 1, 2, \ldots be two sequences of integers defined by a1=1a_1 = 1, b1=0b_1 = 0 and for n1n \ge 1,
an+1=7an+12bn+6 a_{n+1} = 7a_n + 12b_n + 6
bn+1=4an+7bn+3. b_{n+1} = 4a_n + 7b_n + 3.

Prove that an2a_n^2 is the difference of two consecutive cubes.

Solution

First we shall prove that an2a_n^2 is the difference of two consecutive cubes. To do so, we shall prove by induction that an2=(bn+1)3bn3a_n^2 = (b_n + 1)^3 - b_n^3.

When n=1n = 1, this is true.

Suppose for n1n \ge 1, this is true. We have
(bn+1+1)3bn+13=3bn+12+3bn+1+1=3(4an+7bn+3)2+3(4an+7bn+3)+1=48an2+147bn2+168anbn+84an+147bn+37=(7an+12bn+6)2+(3bn2+3bn+1)an2=an+12+(bn+1)3bn3an2=an+12 \begin{aligned} (b_{n+1} + 1)^3 - b_{n+1}^3 &= 3b_{n+1}^2 + 3b_{n+1} + 1 \\ &= 3(4a_n + 7b_n + 3)^2 + 3(4a_n + 7b_n + 3) + 1 \\ &= 48a_n^2 + 147b_n^2 + 168a_n b_n + 84a_n + 147b_n + 37 \\ &= (7a_n + 12b_n + 6)^2 + (3b_n^2 + 3b_n + 1) - a_n^2 \\ &= a_{n+1}^2 + (b_n + 1)^3 - b_n^3 - a_n^2 = a_{n+1}^2 \end{aligned}
where the last equality is by induction hypothesis.

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

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