Maths Olympiad Prep

Library / /324 of 520

Algebra Difficulty 3.4 AMC 10/12 Find the answer

Given that the sum of the first nn terms of the sequence an{a_n} is SnS_n, and Sn=32n2+12nS_n= \frac {3}{2}n^{2}+ \frac {1}{2}n, and the increasing geometric sequence bn{b_n} satisfies b1+b4=18b_{1}+b_{4}=18, b2b3=32b_{2}b_{3}=32,
(1) Find the general term formulas for ana_n and bnb_n;
(2) Let cn=anbnc_{n}=a_{n}b_{n}, nNn∈N^{*}, find the sum of the first nn terms of the sequence cnc_n, denoted as TnT_{n}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

(1) Since Sn=32n2+12nS_n= \frac {3}{2}n^{2}+ \frac {1}{2}n,
when n=1n=1, a1=32+12=2a_{1}= \frac {3}{2}+ \frac {1}{2}=2,
when n2n \geqslant 2, a_{n}=S_{n}-S_{n-1}= \frac {3}{2}n^{2}+ \frac {1}{2}n-\[ \frac {3}{2}(n-1)^{2}+ \frac {1}{2}(n-1)\]=3n-1, this also holds when n=1n=1,
therefore, an=3n1a_{n}=3n-1.
Let the common ratio of the increasing geometric sequence bn{b_n} be qq,
since b1+b4=18b_{1}+b_{4}=18, b2b3=32b_{2}b_{3}=32,
then b1+b4=18b_{1}+b_{4}=18, b1b4=32b_{1}b_{4}=32, solving these equations gives b1=2b_{1}=2, b4=16b_{4}=16, 16=2×q316=2 \times q^{3}, solving for qq gives q=2q=2,
therefore, bn=2nb_{n}=2^{n}.
(2) cn=anbn=(3n1)×2nc_{n}=a_{n}b_{n}=(3n-1) \times 2^{n},
the sum of the first nn terms of the sequence cnc_n is Tn=2×2+5×22+8×23+...+(3n1)×2nT_{n}=2 \times 2+5 \times 2^{2}+8 \times 2^{3}+...+(3n-1) \times 2^{n},
2Tn=2×22+5×23+...+(3n4)×2n+(3n1)×2n+12T_{n}=2 \times 2^{2}+5 \times 2^{3}+...+(3n-4) \times 2^{n}+(3n-1) \times 2^{n+1},
subtracting the two equations gives Tn=4+3×22+3×23+...+3×2n(3n1)×2n+1=3×2×(2n1)212(3n1)×2n+1=(43n)×2n+18-T_{n}=4+3 \times 2^{2}+3 \times 2^{3}+...+3 \times 2^{n}-(3n-1) \times 2^{n+1}=3 \times \frac {2 \times (2^{n}-1)}{2-1}-2-(3n-1) \times 2^{n+1}=(4-3n) \times 2^{n+1}-8,
therefore, Tn=(3n4)×2n+1+8\boxed{T_{n}=(3n-4) \times 2^{n+1}+8}.

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.