Maths Olympiad Prep

Library / /27 of 69

, 2011

Algebra Difficulty 4.9 AIME Prove it South Africa

A sequence (an)(a_n) is defined by
a1=1,an=3an1+2n1,for n2. a_1 = 1, \quad a_n = 3a_{n-1} + 2^{n-1}, \quad \text{for } n \ge 2.
Find a formula for the general term ana_n in terms of nn.

Solution

Evaluating the first few terms, one finds a1=1a_1 = 1, a2=5a_2 = 5, a3=19a_3 = 19, a4=65a_4 = 65, a5=211a_5 = 211 and a6=665a_6 = 665. The values always increase by a factor of 33, plus a little bit. A guess is that the terms are similar to 3n3^n, and computing the difference one fits it to be 2n2^n. We'll show by induction that an=3n2na_n = 3^n - 2^n.

The base case (n=1n=1) works. Then, for all nNn \in \mathbb{N},
an+1=3an+2n=3(3n2n)+2n=3n+132n+2n=3n+12n+1, a_{n+1} = 3a_n + 2^n = 3(3^n - 2^n) + 2^n = 3^{n+1} - 3 \cdot 2^n + 2^n = 3^{n+1} - 2^{n+1},
as required, so the induction holds and an=3n2na_n = 3^n - 2^n for all nNn \in \mathbb{N}.

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.