Suppose you wish to prove that the following is true for all positive integers n by using mathematical induction:
1+3+5+...+(2 n-1)=n²
(a) Write P(1).
(b) Write P(72).
(c) Write P(73).
(d) Use P(72) to prove P(73).
(e) Write P(k).
(f) Write P(k + 1).
(g) Use mathematical induction to prove that P(n) is true for all positive integers n.

Question

Quizplus · Accepted Answer

The Answer of Suppose you wish to prove that the following is true for all positive integers n by using mathematical induction: 1+3+5+...+(2 n-1)=n² (a) Write P(1). (b) Write P(72). (c) Write P(73). (d) Use P(72) to prove P(73). (e) Write P(k). (f) Write P(k + 1). (g) Use mathematical induction to prove that P(n) is true for all positive integers n.

Suppose You Wish to Prove That the Following Is True