Discrete Maths
a. Show that the following statement forms are all logically equivalent. p → q ∨ r , p ∧ ∼ 1 → r , and p ∧ ∼ r → q
b. Use the logical equivalences established in part (a) to rewrite the following sentence in two different ways. (Assume that n represents a fixed integer.) If n is prime, then n is odd or n is 2.