Intermediate
Discrete Mathematics & Math
Q46 / 100
What is strong induction vs weak induction?
Correct! Well done.
Incorrect.
The correct answer is B) Weak induction: assume P(k), prove P(k+1). Strong induction: assume P(1)...P(k), prove P(k+1) — equivalent but sometimes easier
B
Correct Answer
Weak induction: assume P(k), prove P(k+1). Strong induction: assume P(1)...P(k), prove P(k+1) — equivalent but sometimes easier
Explanation
Both are equivalent in proving power. Strong induction: the inductive hypothesis assumes all cases up to k (not just k). Useful for recursion where f(n) depends on f(k) for multiple k<n (Fibonacci).
Progress
46/100