Olympiad Maths Prep

Track / Stage 7 / 276 of 300 #1676 of 2000

Problem 1676

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.8 Prove it

The sequence (an)n1(a_n)_{n\geq 1} is defined by a1=1,a2=2,a3=24,a_1=1,a_2=2,a_3=24, and, for n4,n\geq 4, an=6an12an38an1an22an2an3.a_n=\dfrac{6a_{n-1}^2a_{n-3}-8a_{n-1}a_{n-2}^2}{a_{n-2}a_{n-3}}. Show that, for all nn, ana_n is an integer multiple of nn.

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

1. Define the sequence transformation:
We start by defining bn=anan1 b_n = \frac{a_n}{a_{n-1}} . This transformation helps us simplify the given recurrence relation.

2. Substitute and simplify the recurrence relation:
Given the recurrence relation for an a_n :
an=6an12an38an1an22an2an3 a_n = \frac{6a_{n-1}^2 a_{n-3} - 8a_{n-1} a_{n-2}^2}{a_{n-2} a_{n-3}}
Substitute an=bnan1 a_n = b_n a_{n-1} , an1=bn1an2 a_{n-1} = b_{n-1} a_{n-2} , and an2=bn2an3 a_{n-2} = b_{n-2} a_{n-3} :
bnan1=6(bn1an2)2an38(bn1an2)(bn2an3)2(bn2an3)an3 b_n a_{n-1} = \frac{6(b_{n-1} a_{n-2})^2 a_{n-3} - 8(b_{n-1} a_{n-2})(b_{n-2} a_{n-3})^2}{(b_{n-2} a_{n-3}) a_{n-3}}
Simplify the expression:
bnan1=6bn12an22an38bn1bn22an2an32bn2an32 b_n a_{n-1} = \frac{6b_{n-1}^2 a_{n-2}^2 a_{n-3} - 8b_{n-1} b_{n-2}^2 a_{n-2} a_{n-3}^2}{b_{n-2} a_{n-3}^2}
bnan1=6bn12an228bn1bn22an2bn2an3 b_n a_{n-1} = \frac{6b_{n-1}^2 a_{n-2}^2 - 8b_{n-1} b_{n-2}^2 a_{n-2}}{b_{n-2} a_{n-3}}
bnan1=6bn12an28bn1bn22bn2 b_n a_{n-1} = \frac{6b_{n-1}^2 a_{n-2} - 8b_{n-1} b_{n-2}^2}{b_{n-2}}
bnan1=6bn128bn1bn2 b_n a_{n-1} = 6b_{n-1}^2 - 8b_{n-1} b_{n-2}
bn=6bn18bn2 b_n = 6b_{n-1} - 8b_{n-2}

3. **Solve the recurrence relation for bn b_n :**
The recurrence relation bn=6bn18bn2 b_n = 6b_{n-1} - 8b_{n-2} is a linear homogeneous recurrence relation with constant coefficients. To solve it, we find the characteristic equation:
x26x+8=0 x^2 - 6x + 8 = 0
Solving the characteristic equation:
x=6±36322=6±22=4 or 2 x = \frac{6 \pm \sqrt{36 - 32}}{2} = \frac{6 \pm 2}{2} = 4 \text{ or } 2
Thus, the general solution for bn b_n is:
bn=A4n+B2n b_n = A \cdot 4^n + B \cdot 2^n

4. **Determine the constants A A and B B :**
Using the initial conditions b2=a2a1=2 b_2 = \frac{a_2}{a_1} = 2 and b3=a3a2=12 b_3 = \frac{a_3}{a_2} = 12 :
b2=A42+B22=16A+4B=2 b_2 = A \cdot 4^2 + B \cdot 2^2 = 16A + 4B = 2
b3=A43+B23=64A+8B=12 b_3 = A \cdot 4^3 + B \cdot 2^3 = 64A + 8B = 12
Solving these equations:
16A+4B=2(1) 16A + 4B = 2 \quad \text{(1)}
64A+8B=12(2) 64A + 8B = 12 \quad \text{(2)}
Divide equation (2) by 4:
16A+2B=3(3) 16A + 2B = 3 \quad \text{(3)}
Subtract equation (1) from equation (3):
16A+2B(16A+4B)=32 16A + 2B - (16A + 4B) = 3 - 2
2B=1    B=12 -2B = 1 \implies B = -\frac{1}{2}
Substitute B B back into equation (1):
16A+4(12)=2 16A + 4 \left(-\frac{1}{2}\right) = 2
16A2=2    16A=4    A=14 16A - 2 = 2 \implies 16A = 4 \implies A = \frac{1}{4}
Thus, the solution for bn b_n is:
bn=144n122n=4n12n1 b_n = \frac{1}{4} \cdot 4^n - \frac{1}{2} \cdot 2^n = 4^{n-1} - 2^{n-1}

5. **Express an a_n in terms of bn b_n :**
Since bn=anan1 b_n = \frac{a_n}{a_{n-1}} , we have:
an=bnan1=(4n12n1)an1 a_n = b_n a_{n-1} = (4^{n-1} - 2^{n-1}) a_{n-1}
By induction, we can show that:
an=i=1n1(4i2i) a_n = \prod_{i=1}^{n-1} (4^i - 2^i)

6. **Show that an a_n is an integer multiple of n n :**
We need to show that nan n \mid a_n . Note that:
an=i=1n1(4i2i) a_n = \prod_{i=1}^{n-1} (4^i - 2^i)
Each term 4i2i 4^i - 2^i is divisible by 2i1 2^i - 1 . The product of these terms includes all factors of n n because n! n! divides the product of the first n1 n-1 terms.

Therefore, an a_n is an integer multiple of n n .

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.