Proof by Exhaustion and Disproof by Counterexamples

The video tutorial covers two mathematical proof techniques: proof by exhaustion and disproof by counterexample. It begins with an explanation of proof by exhaustion, demonstrating it with examples such as identifying prime numbers between 10 and 20 and proving the absence of even perfect squares between 800 and 900. The tutorial also discusses the use of computers in proof by exhaustion, citing the four color theorem as an example. The second part introduces disproof by counterexample, illustrating how a single counterexample can invalidate a conjecture. Examples include disproving conjectures about mathematical expressions.

What is the main idea behind proof by exhaustion?

• To use a computer to solve complex problems.

• To guess the solution and verify it.

• To disprove a statement by finding a counterexample.

• To prove a statement by checking all possible cases.

How many prime numbers are there between 10 and 20?

• Six

• Five

• Three

• Four

What is the significance of the four-color theorem in proof by exhaustion?

• It shows that maps cannot be colored with less than five colors.

• It proves that all maps are identical.

• It demonstrates the use of computers in proving theorems.

• It shows that any map can be colored with three colors.

What is the key difference between proof by exhaustion and disproof by counterexample?

• Disproof by counterexample requires checking all cases, while proof by exhaustion needs only one counterexample.

• Both methods require checking all possible cases.

• Proof by exhaustion is faster than disproof by counterexample.

• Proof by exhaustion requires checking all cases, while disproof by counterexample needs only one counterexample.

Which of the following is a counterexample to the conjecture that x^2 is always greater than or equal to x?

• x = 3

• x = 1

• x = 2

• x = 0.5

What is the result of 2n^2 + 11 when n = 11, and why is it significant?

• It is 121, which is prime, supporting the conjecture.

• It is 121, which is not prime, disproving the conjecture.

• It is 253, which is prime, supporting the conjecture.

• It is 253, which is not prime, disproving the conjecture.

What is the main advantage of disproof by counterexample?

• It can disprove a conjecture with just one counterexample.

• It requires checking all possible cases.

• It always requires the use of computers.

• It is more time-consuming than proof by exhaustion.