Computer Science I / Proof Techniques
Practice question · Put in order

Order the steps of a direct proof that if n is even then n squared is even.

Hints
  1. A direct proof runs from the hypothesis to the conclusion, so it starts by assuming what it is given.
  2. The definition of even has to be unpacked before it can be used, and repacked before the conclusion can be stated.
Show the answer
  1. Assume the hypothesis: n is even
  2. Write n = 2k for some integer k, which is what being even means
  3. Square both sides to get n squared = 4k squared
  4. Rewrite 4k squared as 2 times (2k squared), an integer doubled
  5. Conclude that n squared is even, as required
Why

A direct proof assumes the hypothesis, converts definitions into usable algebra, manipulates, and converts back. The final rewriting step matters: 4k squared is not obviously even until it is displayed as 2 times an integer, which is exactly the definition being claimed.

Read the lesson: Proof Techniques →

Practise Proof Techniques

The app has 6 more questions on this lesson, and keeps your place in the course. Computer Science I is free to start.

More questions on Proof Techniques