Mathorio
Answer key
Proof by Contradiction
Show your work for each problem.
- 1.You want to prove by contradiction that is irrational. What is the correct first line?
- a)Assume is irrational
- b)Assume is rational
- c)Assume
- d)Assume is irrational
Answer: Assume is rational
The statement is " is irrational", so its negation is " is rational". Assuming the statement itself would be circular.
- 2.What is the smallest number of people you need so that at least two of them are guaranteed to be born in the same month?
Answer: 13
With 12 people, all months can be different. With 13, assuming all months are different would need 13 months, but there are only 12. So the answer is .
- 3.Which statement is false for every truth value of , so that it is a contradiction?
- a)
- b)
- c)
- d)
Answer:
needs and its opposite to be true at the same time, which never happens, so it is F in every row. and are always true, and has the same value as .
- 4.Someone claims that is the largest even number. Follow the proof to show the claim is false.
Answer: 102
- Write . What is ? 50
- What is ? 102
- Write . What is ? 51
- 5.In the proof that is irrational, you square and multiply by . You get . What is ?
Answer: 2
Squaring gives , and multiplying by gives , so . This shows that is even.
- 6.Show with the pigeonhole idea that in a group of 13 people, some birth month is shared.
Answer: 2
- How many months (boxes) are there? 12
- At most how many people can all have different birth months? 12
- After one person is placed in each month, how many of the 13 people are left over? 1
- So the most crowded month has at least how many people? 2
- 7.What is the correct negation of "Every prime number is odd"?
- a)Every prime number is even
- b)Every odd number is prime
- c)No prime number is odd
- d)At least one prime number is not odd
Answer: At least one prime number is not odd
The negation of "every ... is odd" is "at least one ... is not odd". Here the negation is even true: is a prime number that is not odd.
- 8.You want to prove by contradiction. What do you assume?
- a)
- b)
- c)
- d)
Answer:
is false exactly when or , that is . Assuming only would leave the case open.
- 9.A box holds single gloves in 7 different colors. How many gloves must you take without looking to be sure that two have the same color?
Answer: 8
7 gloves can all have different colors. With 8, assuming all colors differ would need 8 colors, but there are only 7. So gloves guarantee a matching pair.
- 10.Use a calculator to show that lies strictly between and , so it equals neither of them.
Answer: 0
- What is ? 1.99996164
- What is ? 2.00024449
- How many of these two squares are exactly equal to 2? 0
- 11.Someone claims that is the smallest positive rational number. Halve it as in the proof. Which smaller positive rational number do you get? Write it as a fraction.
Answer: 1/2000
, which is positive, rational and smaller than . So the claim is false, and the same trick works for any candidate.
- 12.How many people guarantee that two of them have the same birthday (day and month), counting February 29 as a possible birthday?
Answer: 367
- How many possible birthdays are there, including February 29? 366
- What is the largest number of people who can all have different birthdays? 366
- How many people guarantee a shared birthday? 367
- 13.Run Euclid's proof with the list of primes : build and check that no prime on the list divides it.
Answer: 31
- What is ? 30
- What is ? 31
- What is the remainder when you divide by ? 1
- What is the remainder when you divide by ? 1
- 14.In Euclid's proof, compute for the first five primes.
Answer: 2311
, so . Dividing by 2, 3, 5, 7 or 11 always leaves remainder 1, so its prime factors are not on the list (here happens to be prime itself).
- 15.With the primes , Euclid's number is , which is not prime. What does this mean for the proof?
- a)The proof fails, because is not prime
- b)There are only six primes
- c) has prime factors that are not on the list, so the proof still works
- d) is the largest prime
Answer: has prime factors that are not on the list, so the proof still works
The proof never claims that is prime. It only needs a prime factor of that is missing from the list, and and are exactly such primes. The proof still works.
- 16.Follow the proof that is irrational. Assume in lowest terms and fill in the numbers.
Answer: 2
- Squaring gives . What is ? 2
- is even, so . Then . What is ? 4
- From you get . What is ? 2
- So and are both divisible by which number? 2
- 17.Prove that is irrational the same way. Assume in lowest terms and fill in the numbers. Use the fact that if a prime divides , it divides .
Answer: 3
- Squaring gives . What is ? 3
- divides , so . Then . What is ? 9
- From you get . What is ? 3
- So and are both divisible by which prime? 3
- 18.Run Euclid's proof with the primes and find the prime factors of .
Answer: 509
- What is ? 30030
- What is , the product plus 1? 30031
- What is the remainder when you divide by ? 1
- . What is ? 509