Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Proof by Contradiction

    Definition

    A proof by contradiction establishes the truth of a given proposition by the supposition that it is false and the subsequent drawing of a conclusion that is contradictory to something that is proven to be true. That is, the supposition that P is false followed necessarily by the conclusion Q from not-P, where Q is false, which implies that P is true. For example, the second of Euclid's theorems starts with the assumption that there is a finite number of primes. Cusik gives some other nice examples.

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.