Proof Techniques Examples: 42 Problems with Answers
Worked examples of Proof Techniques to try before you open each solution, then practice problems with answers.
Worked Examples
Example 1
easyShow solution
Answer
First step
Full solution
- 2. 2. Proof by contradiction: assume the negation of the goal and derive a contradiction.
- 3. 3. Proof by contrapositive: prove instead of .
- 4. 4. Mathematical induction: prove a base case and an inductive step for statements indexed by .
- 5. Best technique for : direct proof. Factor: — three consecutive integers, so one is divisible by 3. Done.
Example 2
mediumExample 3
mediumExample 4
mediumExample 5
mediumExample 6
hardExample 7
hardExample 8
hardExample 9
challengePractice Problems
Try each one, then open the solution to compare your method.
Example 1
easyExample 2
mediumExample 3
easyExample 4
easyExample 5
easyExample 6
easyExample 7
easyExample 8
easyExample 9
easyExample 10
easyExample 11
mediumExample 12
mediumExample 13
mediumExample 14
mediumExample 15
mediumExample 16
mediumExample 17
mediumExample 18
mediumExample 19
mediumExample 20
challengeExample 21
challengeExample 22
challengeExample 23
easyExample 24
easyExample 25
easyExample 26
easyExample 27
mediumExample 28
mediumExample 29
mediumExample 30
mediumExample 31
hardExample 32
hardExample 33
hardWhat to focus on
Core idea: Proof techniques are the menu of standard strategies — direct, contradiction, contrapositive, induction, cases — and the skill is choosing the one that fits the statement you must establish.
Common stuck point: The procedure for proof techniques is the easy part; the trap is defaulting to one favorite technique for every problem. Asking "Have I matched the strategy to the claim's form before starting to write the proof?" first is what keeps a correct-looking calculation from being attached to the wrong concept.
Ask yourself: Have I matched the strategy to the claim's form before starting to write the proof?
Concept recap
Proof techniques are standard strategies for establishing mathematical claims under different structures.
Proof techniques are keys on a ring, and the claim is the lock. You don't try the same key in every lock; you look at the keyhole first: an if-then keyhole, a "there is no" keyhole, a "for every " keyhole. Unlike real locks, a claim sometimes opens with two different keys, and then the shorter proof wins.
Read the full lesson on Proof TechniquesRelated concepts
Background knowledge
These ideas may be useful before you work through the harder examples.