Back to An introduction to proofs

Exercise 4

Avg difficulty 2.5

Suppose that you would like to prove the following implication:

For all numbers nn, if nn is prime then nn is solitary.

Write out the beginning and end of the argument if you were to prove the statement,

  1. Directly

  2. By contrapositive

  3. 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 lines of the proofs so that we can see that logical structure you would follow.

Hammond, Discrete Math for Shockers, §2.5 An introduction to proofs, Exercise 4

AI Tutor

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.