- Please Help Asap 1 (15.19 KiB) Viewed 55 times
please help asap
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
please help asap
please help asap
If we were writing an inductive proof, which of the following shows the basis step for proving: if n is a positive integer, then P(n) = 1 * 1! + 2 * 2! + ... + n*n! = (n + 1)! - 1 Assume that P(k + 1) is true for an arbitrary positive integer k, that is: P(K + 1) = 1 * 1! + 2 * 2! + ... + k* k! + (k + 1) * (k + 1)! = (k+ 1 + 1)! − 1 P(1) = 1*1!= 1 = (1+1)! - 1 = 2! - 1 = 1 Assume that P(1) is true Assume that P(k) is true for an arbitrary positive integer k, that is: P(K) = 1 * 1! + 2 * 2! + ... + k * k! = (k+ 1)! - 1
If we were writing an inductive proof, which of the following shows the basis step for proving: if n is a positive integer, then P(n) = 1 * 1! + 2 * 2! + ... + n*n! = (n + 1)! - 1 Assume that P(k + 1) is true for an arbitrary positive integer k, that is: P(K + 1) = 1 * 1! + 2 * 2! + ... + k* k! + (k + 1) * (k + 1)! = (k+ 1 + 1)! − 1 P(1) = 1*1!= 1 = (1+1)! - 1 = 2! - 1 = 1 Assume that P(1) is true Assume that P(k) is true for an arbitrary positive integer k, that is: P(K) = 1 * 1! + 2 * 2! + ... + k * k! = (k+ 1)! - 1