For unlimited access to Homework Help, a Homework+ subscription is required.
3. Consider the following recursively defined sequence: 4 = aut = : (n + 2) (for neN) . Prove, by induction, that an for all neN.
3. Let {an} be a sequence such that ai = 1 and an+1 = an +3n(n+1) for neN. Prove that an = n - n +1 for neN.
4. Let irn} be a sequence given by the following recursion formula: for n > 2. 11 =3, 12 = 7 and In+1 = 5. In - 6. In-1 Prove that for all neN, In = 2 + 3n-1.
