Chapter 2: Problem 24
24\. Let \(n\) be an integer. Prove that \(n\) is even if and only if \(31 n+12\) is even.
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 2: Problem 24
24\. Let \(n\) be an integer. Prove that \(n\) is even if and only if \(31 n+12\) is even.
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
10\. Establish the validity of the following arguments. a) \([(p \wedge \neg q) \wedge r] \rightarrow[(p \wedge r) \vee q]\) b) \([p \wedge(p \rightarrow q) \wedge(\neg q \vee r)] \rightarrow r\) c) \(p \rightarrow q\) \(r \rightarrow \neg q\) \(r\) \(\therefore \neg p\) e) \(p \rightarrow(q \rightarrow r)\) f) \(\begin{aligned} & p \wedge q \\ & p \rightarrow(r \wedge q) \\ & r \rightarrow(s \vee t) \\ & \neg s \\ \therefore & t \end{aligned}\) g) \(\quad p \rightarrow(q \rightarrow r)\)
13\. Suppose that \(p(x, y)\) is an open statement where the universe for each of \(x, y\) consists of only three integers: \(2,3,5\). Then the quantified statement \existsy \(p(2, y)\) is logically equivalent to \(p(2,2) \vee p(2,3) \vee p(2,5)\). The quantified statement \(\exists x \forall y p(x, y)\) is logically equivalent to \([p(2,2) \wedge p(2,3) \wedge\) \(p(2,5)] \vee[p(3,2) \wedge p(3,3) \wedge p(3,5)] \vee[p(5,2) \wedge p(5,3)\) \(\wedge p(5,5)]\). Use conjunctions and/or disjunctions to express the following statements without quantifiers. a) \(\forall x p(x, 3)\) b) \(\exists x \exists y p(x, y)\) c) \(\forall y \exists x p(x, y)\)
12\. Write the following argument in symbolic form. Then either establish the validity of the argument or provide a counterexample to show that it is invalid. If it is cool this Friday, then Craig will wear his suede jacket if the pockets are mended. The forecast for Friday calls for cool weather, but the pockets have not been mended. Therefore Craig won't be wearing his suede jacket this Friday.
15\. For cach of the following pairs of statements determine whether the proposed negation is correct. If correct, determine which is true: the original statement or the proposed negation. If the proposed negation is wrong, write a correct version of the negation and then determine whether the original statement or your corrected version of the negation is true. a) Statement: For all real numbers \(x, y\), if \(x^{2}>y^{2}\), then \(x>y\) Proposed negation: There exist real numbers \(x, y\) such that \(x^{2}>y^{2}\) but \(x \leq y\) b) Statement: There exist real numbers \(x, y\) such that \(x\) and \(y\) are rational but \(x+y\) is irrational. Proposed negation: For all real numbers \(x, y\), if \(x+y\) is rational, then each of \(x, y\) is rational. c) Statement: For all real numbers \(x\), if \(x\) is not 0 , then \(x\) has a multiplicative inverse. Proposed negation: There exists a nonzero real number that does not have a multiplicative inverse. d) Statement: There exist odd integers whose product is odd. Proposed negation: The product of any two odd integers is odd. 16\. Write the negation of each of the following statements as an English sentence-without symbolic notation. (Here the universe consists of all the students at the university where Professor Lenhart teaches.) a) Every student in Professor Lenhart's C++ class is majoring in computer science or mathematics. b) At least one student in Professor Lenhart's C++ class is a history major.
17\. For any statements \(p, q\), prove that a) \(\neg(p \downarrow q) \Leftrightarrow(\neg p \uparrow \neg q)\) b) \(\neg(p \uparrow q) \Leftrightarrow(\neg p \downarrow \neg q)\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.