Posted by **zgord** on Wednesday, September 3, 2008 at 8:15pm.

*if it is in parentheses, it is subscripted.

the sequence {a(n)} is defined recursively by a(1) = 1, a(2) = 1 and for all n>= 1, a(n+2) = a(n+1) + a(n). use the principle of mathematical induction to prove that a(1) + a(2) + a(3) + ... + a(n) = a(n+2) - 1

## Answer This Question

## Related Questions

- Discrete Mathematics - Suppose a0, a1, a2 ,... is a sequence defined recursively...
- Math - Mathematical Induction - 3. Prove by induction that∑_(r=1)^n▒...
- Calculus - Use mathematical induction to prove that the statement holds for all ...
- AP Calc - Use mathematical induction to prove that the statement holds for all ...
- calculus - A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)...
- Calculus - A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)...
- calculus - A) How do you prove that if 0(<or=)x(<or=)10, then 0(<or=)...
- Math - Use mathematical induction to prove that 2^(3n) - 3^n is divisible by 5 ...
- Math sequence - Let {An} be the sequence defined recursively by A1=sqr(2) and A(...
- math - use mathematical induction to prove -1/2^n = 1/2^n - 1

More Related Questions