Maths Olympiad Prep

Library / /422 of 520

Algebra Difficulty 4.5 AIME Prove it

Given a sequence {an}\{a_n\} that satisfies a1=1a_1=1, a2=3a_2=3, and an+2=3an+12ana_{n+2}=3a_{n+1}-2a_n for nNn\in \mathbb{N}^{*},
(I) Prove that the sequence {an+1an}\{a_{n+1}-a_n\} is a geometric sequence;
(II) Find the general term formula for the sequence {an}\{a_n\};
(III) If the sequence {bn}\{b_n\} satisfies 4b114b214bn1=(an+1)bn4^{b_1-1} \cdot 4^{b_2-1} \cdots 4^{b_n-1} = (a_n+1)^{b_n} for nNn\in \mathbb{N}^{*}, prove that {bn}\{b_n\} is an arithmetic sequence.

Solution

(I) To prove: Since an+2=3an+12ana_{n+2}=3a_{n+1}-2a_n, we have
an+2an+1=2(an+1an)a_{n+2}-a_{n+1}=2(a_{n+1}-a_n).
Because a1=1a_1=1 and a2=3a_2=3, we get
an+2an+1an+1an=2 for nN.\frac{a_{n+2}-a_{n+1}}{a_{n+1}-a_n}=2 \text{ for } n\in \mathbb{N}^{*}.
Thus, {an+1an}\{a_{n+1}-a_n\} is a geometric sequence with the first term a2a1=2a_2-a_1=2 and a common ratio of 22.

(II) We know from (I) that an+1an=2na_{n+1}-a_n=2^n for nNn\in \mathbb{N}^{*}, therefore,
an=(anan1)+(an1an2)++(a2a1)+a1a_n=(a_n-a_{n-1})+(a_{n-1}-a_{n-2})+\cdots+(a_2-a_1)+a_1
=2n1+2n2++2+1=2^{n-1}+2^{n-2}+\cdots+2+1
=2n1 for nN.=2^n-1 \text{ for } n\in \mathbb{N}^{*}.
So, the general term formula for the sequence is an=2n1\boxed{a_n=2^n-1}.

(III) To prove: Since 4b114b214bn1=(an+1)bn4^{b_1-1} \cdot 4^{b_2-1} \cdots 4^{b_n-1} = (a_n+1)^{b_n}, we have
4b1+b2++bnn=22(b1+b2++bnn)=2nbn4^{b_1+b_2+\cdots+b_n-n}=2^{2(b_1+b_2+\cdots+b_n-n)}=2^{nb_n}.
Thus, 2[(b1+b2++bn)n]=nbn2[(b_1+b_2+\cdots+b_n)-n]=nb_n (Equation 1).
For the next term in the sequence, we have
2[(b1+b2++bn+bn+1)(n+1)]=(n+1)bn+12[(b_1+b_2+\cdots+b_n+b_{n+1})-(n+1)]=(n+1)b_{n+1} (Equation 2).
Subtract Equation 1 from Equation 2 to get
2(bn+11)=((n+1)bn+1nbn)2(b_{n+1}-1)=((n+1)b_{n+1}-nb_n),
which simplifies to (n1)bn+1nbn+2=0(n-1)b_{n+1}-nb_n+2=0 (Equation 3).
For the (n+2)(n+2)-th term, we have
nbn+2(n+1)bn+1+2=0nb_{n+2}-(n+1)b_{n+1}+2=0 (Equation 4).
Subtracting Equation 3 from Equation 4, we get
nbn+22nbn+1+nbn=0nb_{n+2}-2nb_{n+1}+nb_n=0,
which simplifies to bn+22bn+1+bn=0b_{n+2}-2b_{n+1}+b_n=0.
Therefore, bn+2bn+1=bn+1bnb_{n+2}-b_{n+1}=b_{n+1}-b_n for nNn\in \mathbb{N}^{*},
indicating that {bn}\{b_n\} is an arithmetic sequence. Thus, the proof is complete.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.