Proof by Exhaustion
Learn how to prove a statement by checking every possible case in a finite set.
Learn how to prove a statement by checking every possible case in a finite set.
See how proof by exhaustion divides a problem into a finite number of possible cases and verifies each one.
A proof by exhaustion is valid only when every possible case has been considered.
After completing this lesson you should be able to:
Check each possible value:
n = 1: n² + n = 1 + 1 = 2, which is even.
n = 2: n² + n = 4 + 2 = 6, which is even.
n = 3: n² + n = 9 + 3 = 12, which is even.
n = 4: n² + n = 16 + 4 = 20, which is even.
Every possible case is even, so the statement is true.
When is proof by exhaustion most suitable?
Ask Mathiation AI to explain any step or help you practise another question from this topic.