In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 2 + 4 + 8 + ... + 2n = 2n+1 - 2
9. Sequences, Series, & Induction
Sequences
- Textbook Question564views
- Textbook Question
In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 1 + 2 + 22 + ... + 2n-1 = 2n - 1
549views - Textbook Question
In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 3 + 7 + 11 + ... + (4n - 1) = n(2n + 1)
477views - Textbook Question
In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 1 + 3 + 5 + ... + (2n - 1) = n2
467views - Textbook Question
In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 4 + 8 + 12 + ... + 4n = 2n(n + 1)
527views - Textbook Question
In Exercises 5–10, a statement Sn about the positive integers is given. Write statements Sk and Sk+1 simplifying statement Sk+1 completely. Sn: 2 is a factor of n2 - n + 2.
469views - Textbook Question
In Exercises 5–10, a statement Sn about the positive integers is given. Write statements Sk and Sk+1 simplifying statement Sk+1 completely. Sn: 4 + 8 + 12 + ... + 4n = 2n(n + 1)
472views - Textbook Question
In Exercises 1–4, a statement Sn about the positive integers is given. Write statements S1, S2 and S3 and show that each of these statements is true. Sn: 3 is a factor of n3 - n.
481views - Textbook Question
In Exercises 1–4, a statement Sn about the positive integers is given. Write statements S1, S2 and S3 and show that each of these statements is true. Sn: 3 + 4 + 5 + ... + (n + 2) = n(n + 5)/2
462views - Textbook Question
In Exercises 1–4, a statement Sn about the positive integers is given. Write statements S1, S2 and S3 and show that each of these statements is true. Sn: 1 + 3 + 5 + ... + (2n - 1) = n2
465views - Textbook Question
In Exercises 25–34, use mathematical induction to prove that each statement is true for every positive integer n. 6 is a factor of n(n + 1)(n + 2).
486views - Textbook Question
In Exercises 25–34, use mathematical induction to prove that each statement is true for every positive integer n. 2 is a factor of n2 - n.
475views - Textbook Question
In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 1/(1 · 2) + 1/(2 · 3) + 1/(3 · 4) + ... + 1/(n(n+1)) = n/(n + 1)
465views - Textbook Question
In Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 1 · 2 + 2 · 3 + 3 · 4 + ... + n(n + 1) = n(n + 1)(n + 2)/3
488views - Textbook Question
In Exercises 25–34, use mathematical induction to prove that each statement is true for every positive integer n. (ab)n = an bn
565views