Skip to main content
OlympiadHQ

Browse · MathNet

Print

Spanija 2012

Spain 2012 algebra

Problem

A sequence is defined recursively as Prove that every term in the sequence is an integer. Find an explicit formula for .
Solution
Let us compute the first few terms:















We see that all terms are integers.

Let us try to find an explicit formula. Notice that the sequence seems to be related to powers of and .

Let us try to guess a closed formula. Let us look for a pattern. Compute the ratios:



This suggests that the sequence grows exponentially.

Let us try to solve the recurrence:



Multiply both sides by :



This is a second-order recurrence. Let us try to find a closed formula.

Let us try to write in terms of and :



Or:



This is similar to the recurrence for Chebyshev polynomials of the first kind, , which satisfy:



But our recurrence is different. Let us try to find a pattern.

Let us try to write as for some .

Alternatively, let us try to solve the recurrence by induction.

Let us try to prove by induction that all are integers.

Base cases: , are integers.

Inductive step: Assume and are integers. Then . We need to show that divides .

But from the recurrence:



So

Therefore,



So divides because is defined as .

Therefore, by induction, all are integers.

Now, let us try to find an explicit formula.

Let us try to solve the recurrence:



Let us try to find a solution of the form for some .

Suppose .

Let us try to find and such that the recurrence is satisfied.

Let us try .

Alternatively, let us try to find a pattern in the numbers:



These are the sequence A001834 in OEIS, which is related to the solutions of Pell's equation .

In fact, the sequence satisfies .

Let us check:



But this does not match .

Alternatively, let us try to find a closed formula.

Let us try to fit for some .

Let us try .

Let us check for :



For :

Sum:

But in our sequence.

So this does not match.

Alternatively, let us try to find a recurrence of the form .

Let us try to fit .



This matches the sequence!

Therefore, the sequence satisfies the linear recurrence:

, with ,

The explicit formula for such a recurrence is:

Let the characteristic equation be

The roots are

So the general solution is:



Let us solve for and using , :

For :

For :

So:

Let us solve for and :

Let ,



So





So:





So:



Therefore, the explicit formula is:



Alternatively, since all terms are integers, the closed formula is:



Therefore, every term in the sequence is an integer, and the explicit formula is as above.
Final answer
a_n = [ (sqrt(2) + 1)(3 + 2 sqrt(2))^{n-1} + (sqrt(2) - 1)(3 - 2 sqrt(2))^{n-1} ] / (2 sqrt(2))

Techniques

Recurrence relationsIntegersInduction / smoothing