← All topics
Quiz: Proof Techniques: questions with answers
9 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. What are the two parts of a proof by mathematical induction?
- Q2. For which values did 2^n n^2 fail in the demo (n = 1..10)?
- Q3. Proving "if n² is even then n is even" by showing "if n is odd then n² is odd" is a proof by:
- Q4. A loop invariant is:
- Q5. To prove √2 is irrational by contradiction, what do you assume first?
- Q6. In Euclid's proof that there are infinitely many primes, which number is built?
- Q7. When is strong induction more convenient than ordinary induction?
- Q8. What does this print? (code)
- Q9. What does the termination step of a loop-invariant proof show?