Intermediate
Discrete Mathematics & Math
Q76 / 100
Which proof technique would you use to show that every integer greater than 1 has a prime factor, by assuming a smallest counterexample exists?
Correct! Well done.
Incorrect.
The correct answer is B) Proof by minimal counterexample (a variant of proof by contradiction relying on the well-ordering principle)
B
Correct Answer
Proof by minimal counterexample (a variant of proof by contradiction relying on the well-ordering principle)
Explanation
Proof by minimal counterexample assumes the set of counterexamples is non-empty, invokes the well-ordering principle to pick the smallest one, and derives a contradiction by finding an even smaller counterexample. It is logically equivalent to strong induction.
Progress
76/100