Proof by contradiction Quiz
Studying this course? Keep your progress in one place.
Pick an answer for each. Quizzes never use energy.
5 questions, one answer each
Each answer is checked as you go, with why.
See all 5 questions
1. To prove by contradiction that is irrational, which assumption do you make?
- A. is irrational.
- B. is an integer.
- C. in lowest terms.
- D. is prime.
2. If is divisible by 5, which can you conclude?
- A. is divisible by 5.
- B. .
- C. .
- D. is even.
3. In Euclid's proof with primes , . What does this show?
- A. 31 is divisible by 2.
- B. There are only three primes.
- C. 31 is composite.
- D. The list is incomplete, since 31 is a prime not in the list.
4. Which is a valid contradiction in a proof about a fraction ?
- A. and are integers.
- B. and are both even, though assumed to have no common factor.
- C. .
- D. .
5. Which is the negation of 'there is an integer solution to with '?
- A. There is a rational solution.
- B. There are no integer solutions with .
- C. There are exactly two integer solutions.
- D. and are both zero.