Name___________________________________________________________.

Name___________________________________________________________
MTH 305 – Quiz 2.1 -
Proofs and Recursion
Section 2.1: Proof Techniques
True/False (Write the word True or False in the blanks.)
______FALSE___ 1. Proof by Exhaustion allows you to prove a conjecture is true for
all integers.
_______FALSE__ 2. A proof by contradiction of P → Q, begins by assuming that
P Λ Q are true.
____TRUE_____ 3. If Q′ → P is true, then P → Q is true.
_____TRUE____ 4. To prove A if and only if B, you need to prove A → B or B → A.
______FALSE____5. To prove that something is not true, a proof by contradiction is
helpful.
______TRUE____6. One counterexample is enough to disprove a conjecture.
_____TRUE_____7. A proof by contraposition uses the negation of the antecedent to
deduce the consequent.
____TRUE______8. The converse cannot be used to prove that a conjecture is true.