For each integer n with n ≥ 2, let P (n) be the formulaa. Write P (2). Is P (2) true?b. Wr...

For each integer n with n ≥ 2, let P (n) be the formula

a. Write P (2). Is P (2) true?

---

b. Write P(k).

---

c. Write P(k + 1).

---

d. In a proof by mathematical induction that the formula holds for all integers n ≥ 2, what must be shown in the inductive step?