Question

Which of the following is NOT true about mathematical induction?

A.The first possible case is always n = 1.

B.Mathematical induction depends on a recursive process.

C.It can be used to prove that 1 + 2 + 3+...+n =
n(n+2)
2

D. Since Sn is valid for n = 1, it is valid for n = 2. Since it is valid for n = 2, it is valid for n = 3, and so on, indefinitely.​

Answer 1

Answer:

A. the first possible case is always n = 1

Step-by-step explanation:

Mathematical induction is a technique used to provide proof for a statement such that the statement holds for all natural numbers which are the non-negative integers

Therefore, given that the natural numbers are 0, 1, 2..., we have that mathematical induction can start from n = 0

Therefore, the statement which is not true is that the first possible case is always n = 1