A. show that the following statement forms are all logically equivalent. p → q ∨ r, p ∧ ∼q → 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.

(a) if n is prime, then n is odd or n is 2

(b) if n is prime and n is not odd, then n is 2

(c) if n is prime and n is not 2, then n is odd

Step-by-step explanation:

a) p → q ∨ r

b) p ∧ ∼q → r

c) p ∧ ∼r → q

Lets show that (a) implies (b) and (c). (a) says that if property p is true, then either q or r is true, thus, if p is true we have:

Now, lets prove that (b) implies (a)

(c) implies (a) can be proven with  similar argument, changing (b) for (c), q for r and r for q.

With this we prove that the 3 properties are equivalent.

For the rest of the exercise, we have

Translating this, we obtain (a), (b) and (c)

(a) if n is prime, then n is odd or n is 2

(b) if n is prime and n is not odd, then n is 2

(c) if n is prime and n is not 2, then n is odd

the answer is 0.3175 hope that you ^w^

also you might actually want to put this picture up if you want people to solve it luckily i remember this question

6 meters

step-by-step explanation: