Back to Discrete Mathematics: An Open Introduction

Chapter Summary

A synthesis arguing that recognizing a statement's logical form is itself the first step of writing its proof.

Discrete Mathematics: An Open Introduction, Chapter Summary

Status
FlagsLoading your progress…

8 exercises

Exercise 1 (Chapter Review)

Complete a truth table for the statement ¬P→(Q∧R)\neg P \imp (Q \wedge R).

2.5

Exercise 3 (Chapter Review)

Are the statements P→(Q∨R)P \imp (Q \vee R) and (P→Q)∨(P→R)(P \imp Q) \vee (P \imp R) logically equivalent? Explain your answer.

2.5

Exercise 4 (Chapter Review)

Is the following a valid deduction rule? Explain.

2.5

Exercise 5 (Chapter Review)

Write the negation, converse and contrapositive for each of the statements below.

  1. If the power goes off, then the food will spoil.

  2. If the door is closed, then the light is off.

  3. ∀x(x<1→x2<1)\forall x (x \lt 1 \imp x^2 \lt 1).
  4. For all natural numbers nn, if nn is prime, then nn is solitary.

  5. For all functions ff, if ff is differentiable, then ff is continuous.

  6. For all integers aa and bb, if a⋅ba\cdot b is even, then aa and bb are even.

  7. For every integer xx and every integ…

2.5

Exercise 6 (Chapter Review)

Consider the statement: for all integers nn, if nn is even and n≤7n \le 7 then nn is negative or n∈{0,2,4,6}n \in \{0,2,4,6\}.

  1. Is the statement true? Explain why.

  2. Write the negation of the statement. Is it true? Explain.

  3. State the contrapositive of the statement. Is it true? Explain.

  4. State the converse of the statement. Is it true? Explain.

2.5

Exercise 7 (Chapter Review)

Consider the statement: ∀x(∀y(x+y=y)→∀z(x⋅z=0))\forall x (\forall y (x + y = y) \imp \forall z (x\cdot z = 0)).

  1. Explain what the statement says in words. Is this statement true? Be sure to state what you are taking the universe of discourse to be.

  2. Write the converse of the statement, both in words and in symbols. Is the converse true?

  3. Write the contrapositive of the statement, both in words and in symbols. Is the contrapositive true?

  4. Write the negation of the statement, both in words…

2.5

Exercise 8 (Chapter Review)

Simplify the following.

  1. ¬(¬(P∧¬Q)→¬(¬R∨¬(P→R)))\neg (\neg (P \wedge \neg Q) \imp \neg(\neg R \vee \neg(P \imp R))).
  2. ¬∃x¬∀y¬∃z(z=x+y→∃w(x−y=w))\neg \exists x \neg \forall y \neg \exists z (z = x + y \imp \exists w (x - y = w)).
2.5

Exercise 10 (Chapter Review)

Suppose you break your piggy bank and scoop up a handful of 22 coins (pennies, nickels, dimes and quarters).

  1. Prove that you must have at least 6 coins of a single denomination.

  2. Suppose you have an odd number of pennies. Prove that you must have an odd number of at least one of the other types of coins.

  3. How many coins would you need to scoop up to be sure that you either had 4 coins that were all the…

2.5

Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.