An introduction to proofs
Turning a quantified claim about numbers, sets or functions into a complete written argument, with the rules of inference that justify each step.
7 exercises
Exercise 1
Consider the statement “for all integers and , if is even, then and are even”
Write the contrapositive of the statement.
Write the converse of the statement.
Write the negation of the statement.
Is the original statement true or false? Prove your answer.
Is the contrapositive of the original statement true or false? Prove your answer.
Is the converse of the original statement true or false? Pro…
Exercise 4
Suppose that you would like to prove the following implication:
For all numbers , if is prime then is solitary.
Write out the beginning and end of the argument if you were to prove the statement,
Directly
By contrapositive
By contradiction
You do not need to provide details for the proofs (since you do not know what solitary means). However, make sure that you provide the first few and last few lin…
Exercise 5
For each of the statements below, say what method of proof you should use to prove them. Then say how the proof starts and how it ends. Pretend bonus points for filling in the middle.
There are no integers and such that is a prime greater than 5 and .
For all integers , if is a multiple of 3, then can be written as the sum of consecutive integers.
For all integers and , if is odd, th…
Exercise 7
Prove that is irrational.
Exercise 9
Prove the statement: For all integers , if is odd, then is odd. Clearly state the style of proof you are using.
Exercise 11
Prove that is irrational.
Exercise 12
Let's say you are presented with a conditional statement that you want to prove by contradiction. This exercise has you structure a model for contradiction of conditional statements like we saw in the model.
- What is your assumption?
- What is your conclusion?
Adapted from Discrete Math for Shockers © 2021 John Hammond. Licensed under CC BY-SA 4.0. Source: Discrete Math for Shockers. Imported at revision 2538beb.