Maths Olympiad Prep

Library / /8 of 23

Algebra Difficulty 4.9 AIME Prove it United States

Problem:

A sequence of numbers {an}\{a_n\} is given by a1=1a_1 = 1, an+1=2an+3an2+1a_{n+1} = 2a_n + \sqrt{3a_n^2 + 1} for n1n \geq 1. Prove that each term of the sequence is an integer.

Solution

Solution:

From the definition of the sequence we see that (an+12an)2=3an2+1\left(a_{n+1} - 2a_n\right)^2 = 3a_n^2 + 1. After simplification we get
an+12+an24anan+1=1 a_{n+1}^2 + a_n^2 - 4a_n a_{n+1} = 1
Adding 3an+123a_{n+1}^2 to both sides of the last equation gives us (2an+1an)2=3an+12+1\left(2a_{n+1} - a_n\right)^2 = 3a_{n+1}^2 + 1 and after taking the square root of both sides we get
3an+12+1=2an+1an \sqrt{3a_{n+1}^2 + 1} = 2a_{n+1} - a_n
On the other hand, from the definition of the sequence we see that
3an+12+1=an+22an+1. \sqrt{3a_{n+1}^2 + 1} = a_{n+2} - 2a_{n+1}.
From (1) and (2) we conclude that an+2=4an+1ana_{n+2} = 4a_{n+1} - a_n which together with a1=1a_1 = 1, a2=4a_2 = 4 implies that all terms are integers.

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.