Question
'For all natural numbers N, if P(n) is a statement about n and P(k+1) is true if P(k) is true for an arbitrary natural number k, then P(n) is always true.' State true or false.
Answer: Option B
:
B
Was this answer helpful ?
:
B
For the proof by mathematical induction to work, the statement P(n) must be true for a specific instance of a natural number.
Hence, if P(m) is true, where m is a specific natural number and P(k+1) is true if P(k) is true for an arbitrary natural number k, then, P(n) is true ∀ n≥m
Without the base case P(m), we cannot say that P(n) is true. Hence, the statement is false.
Was this answer helpful ?
More Questions on This Topic :
Question 5.
For natural number n, (n!)2 > nn, if
....
Question 9.
For every positive integer n, 2n < n! when
....
Question 10.
For every natural number n
....
Submit Solution