Chapter 1

Discrete Mathematics with Applications · 288 exercises

Problem 1

Rewrite each implication in inferential form. $$|(p \rightarrow q) \wedge(\sim q)| \rightarrow \sim p$$

4 step solution

Problem 1

Which of the following are propositions? The earth is flat.

3 step solution

Problem 2

Determine the truth value of each proposition, where the UD consists of the numbers \(\pm 1,\pm 2,\) and \(0 .\) $$(\exists x)\left(x^{3}+2 x^{2}=x+2\right)$$

4 step solution

Problem 2

Rewrite each implication in inferential form. $$|(p \rightarrow q) \wedge(q \rightarrow r)| \rightarrow(p \rightarrow r)$$

2 step solution

Problem 2

Which of the following are propositions? Toronto is the capital of Canada.

3 step solution

Problem 2

Give the truth value of \(p\) in each case. \(p \equiv q, q \equiv r,\) and \(r\) is true.

3 step solution

Problem 3

Determine if each implication is trivially true. If \(n\) is a prime number, then \(n^{2}+n\) is an even integer.

4 step solution

Problem 3

Determine if each implication is trivially true. If \(n\) is a prime number, then \(n^{2}+n\) is an even integer.

4 step solution

Problem 3

Verify that each inference rule is a tautology. $$p \rightarrow(p \vee q)$$

6 step solution

Problem 3

Verify each, where \(f\) denotes a contradiction. $$\sim(\sim p) \equiv p$$

4 step solution

Problem 4

Verify each, where \(f\) denotes a contradiction. (See Table \(1.14 . )\) $$ p \wedge p \equiv p $$

3 step solution

Problem 4

Determine if each implication is trivially true. If \(n \geq 41,\) then \(n^{3}-n\) is divisible by 3

6 step solution

Problem 4

Verify that each inference rule is a tautology. $$[(p \rightarrow q) \wedge(q \rightarrow r) | \rightarrow(p \rightarrow r)$$

3 step solution

Problem 4

Verify each, where \(f\) denotes a contradiction. $$p \wedge p \equiv p$$

4 step solution

Problem 5

Verify each, where \(f\) denotes a contradiction. (See Table \(1.14 . )\) $$ p \vee p=p $$

3 step solution

Problem 5

Prove each directly. The sum of any two even integers is even.

4 step solution

Problem 5

Test the validity of each argument. $$p \vee q$$ $$q \vee r$$ $$\sim r$$ $$\overline{\therefore p}$$

4 step solution

Problem 5

Determine the truth value of each proposition, where the UD consists of the numbers \(\pm 1,\pm 2,\) and \(0 .\) $$\sim(\forall x)\left(x^{3}=x\right)$$

3 step solution

Problem 5

Find the truth value of each compound statement. $$(5<8) \text { and }(2+3=4)$$

3 step solution

Problem 5

Test the validity of each argument. $$\begin{aligned} &\begin{array}{l} p \vee q \\ q \vee r \\ \sim r \\ \hline \end{array}\\\ &\therefore p \end{aligned}$$

3 step solution

Problem 5

Verify each, where \(f\) denotes a contradiction. $$p \vee p \equiv p$$

4 step solution

Problem 5

Prove each directly. The sum of any two even integers is even.

4 step solution

Problem 6

Prove each directly. The sum of any two odd integers is even.

5 step solution

Problem 6

Test the validity of each argument. $$p \leftrightarrow q$$ $$\sim p \vee r$$ $$\sim r$$ $$ \overline {\therefore \sim q}$$

5 step solution

Problem 6

Find the truth value of each compound statement. Paris is in France or \(2+3=4\)

3 step solution

Problem 6

Determine the truth value of each proposition, where the UD consists of the numbers \(\pm 1,\pm 2,\) and \(0 .\) $$(\forall x)\left[\sim\left(x^{5}=4 x\right)\right]$$

7 step solution

Problem 6

Test the validity of each argument. $$\begin{aligned} &p \leftrightarrow q\\\ &\begin{array}{l} \sim p \vee r \\ \sim r \\ \therefore \sim q \end{array} \end{aligned}$$

2 step solution

Problem 6

Verify each, where \(f\) denotes a contradiction. $$p \wedge q \equiv q \wedge p$$

4 step solution

Problem 6

Prove each directly. The sum of any two odd integers is even.

7 step solution

Problem 7

Verify each, where \(f\) denotes a contradiction. (See Table \(1.14 . )\) $$ p \vee q \equiv q \vee p $$

5 step solution

Problem 7

If Bill likes cats, he dislikes dogs. Bill likes dogs.

2 step solution

Problem 7

Prove each directly. The square of an even integer is even.

4 step solution

Problem 7

Find the truth value of each compound statement. If \(1=2,\) then \(3=3\).

3 step solution

Problem 7

Verify each, where \(f\) denotes a contradiction. $$p \vee q \equiv q \vee p$$

4 step solution

Problem 7

Prove each directly. The square of an even integer is even.

5 step solution

Problem 8

Verify each, where \(f\) denotes a contradiction. (See Table \(1.14 . )\) $$ \sim(p \vee q) \equiv \sim p \wedge \sim q $$

3 step solution

Problem 8

If Pat passes this course, she will graduate this year. Pat does not pass this course.

3 step solution

Problem 8

Prove each directly. The product of any two even integers is even.

4 step solution

Problem 8

Let \(P(x) : x^{2} > x, Q(x) : x^{2}=x,\) and the UD \(=\) set of integers. Determine the truth value of each proposition. $$(\exists x)|\sim P(x)|$$

6 step solution

Problem 8

Find the truth value of each compound statement. \(\triangle \mathrm{ABC}\) is equilateral if and only if it is equiangular.

5 step solution

Problem 8

Let \(\mathrm{P}(x): x^{2} > x, \mathrm{Q}(x): x^{2}=x,\) and the UD \(=\) set of integers. Determine the truth value of each proposition. $$(\exists x)[\sim \mathbf{P}(x)]$$

4 step solution

Problem 8

Verify each, where \(f\) denotes a contradiction. $$\sim(p \vee q) \equiv \sim p \wedge \sim q$$

4 step solution

Problem 8

Prove each directly. The product of any two even integers is even.

5 step solution

Problem 9

Verify each, where \(f\) denotes a contradiction. (See Table \(1.14 . )\) $$ \sim(p \rightarrow q)=p \wedge \neg q $$

5 step solution

Problem 9

Frank bought a personal computer or a video cassette recorder (VCR). If he bought a VCR, then he likes to watch movies at home. He does not like to watch movies at home.

5 step solution

Problem 9

Prove each directly. The square of an odd integer is odd.

5 step solution

Problem 9

Let \(P(x) : x^{2} > x, Q(x) : x^{2}=x,\) and the UD \(=\) set of integers. Determine the truth value of each proposition. $$(\exists x)|\mathrm{P}(x) \wedge \mathrm{Q}(x)|$$

6 step solution

Problem 9

Verify each, where \(f\) denotes a contradiction. $$\sim(p \rightarrow q) \equiv p \wedge \sim q$$

4 step solution

Problem 9

Prove each directly. The square of an odd integer is odd.

6 step solution

Problem 10

If Peter is married, he is happy. If he is happy, then he does not read the computer magazine. He does read the computer magazine.

4 step solution

Show/ page