Olympiad Maths Prep

Track / Stage 3 / 22 of 260 #22 of 2000

Problem 22

AMC 10/12, early questions
Algebra Difficulty 3.0 Find the answer

Given a sequence {an}\{a_n\}, the sum of the first nn terms SnS_n satisfies Sn=2an2S_n=2a_n-2.
(1) Find a1a_1, a2a_2, a3a_3 and from this conjecture the general formula for ana_n;
(2) Use mathematical induction to prove the general formula for {an}\{a_n\}.

Official solution

Solution:
(1) Since Sn=2an2S_n=2a_n-2,
When n=1n=1, a1=2a12a_1=2a_1-2, solving this gives a1=2a_1=2.
When n=2n=2, a1+a2=2a22a_1+a_2=2a_2-2, solving this gives a2=4a_2=4.
When n=3n=3, a1+a2+a3=2a32a_1+a_2+a_3=2a_3-2, solving this gives a3=8a_3=8.
Conjecture: an=2na_n=2^n.
(2) When n=1n=1, the conjecture obviously holds.
Assume when n=kn=k, the conjecture holds, i.e., ak=2ka_k=2^k.
Then when n=k+1n=k+1, Sk+1=2ak+12S_{k+1}=2a_{k+1}-2.
Therefore, Sk+ak+1=2ak+12S_k+a_{k+1}=2a_{k+1}-2,
Therefore, 2ak2+ak+1=2ak+122a_k-2+a_{k+1}=2a_{k+1}-2,
Therefore, ak+1=2ak=22k=2k+1a_{k+1}=2a_k=2\cdot2^k=2^{k+1}.
Therefore, when n=k+1n=k+1, the conjecture holds.
Therefore, an=2na_n=2^n.

Thus, the final answer is an=2n\boxed{a_n=2^n}.

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