/*! 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} Free solutions & answers for Discrete Mathematics: An Open Introduction Chapter 0 - (Page 1) [step by step] | 91Ó°ÊÓ

91Ó°ÊÓ

Problem 1

Consider the function \(f:\\{1,2,3,4\\} \rightarrow\\{1,2,3,4\\}\) given by $$f(n)=\left(\begin{array}{llll}1 & 2 & 3 & 4 \\\4 & 1 & 3 & 4\end{array}\right)$$ (a) Find \(f(1)\). (b) Find an element \(n\) in the domain such that \(f(n)=1\). (c) Find an element \(n\) of the domain such that \(f(n)=n\). (d) Find an element of the codomain that is not in the range.

Problem 1

For each sentence below, decide whether it is an atomic statement, a molecular statement, or not a statement at all. (a) Customers must wear shoes. (b) The customers wore shoes. (c) The customers wore shoes and they wore socks.

Problem 3

Suppose \(P\) and \(Q\) are the statements: \(P\) : Jack passed math. Q: Jill passed math. (a) Translate "Jack and Jill both passed math" into symbols. (b) Translate "If Jack passed math, then Jill did not" into symbols. (c) Translate \({ }^{\prime \prime} P \vee Q^{\prime \prime}\) into English. (d) Translate \({ }^{\prime \prime} \neg(P \wedge Q) \rightarrow Q^{\prime \prime}\) into English. (e) Suppose you know that if Jack passed math, then so did Jill. What can you conclude if you know that: i. Jill passed math? ii. Jill did not pass math?

Problem 3

The following functions all have domain \\{1,2,3,4,5\\} and codomain \(\\{1,2,3\\} .\) For each, determine whether it is (only) injective, (only) surjective, bijective, or neither injective nor surjective. (a) \(f=\left(\begin{array}{lllll}1 & 2 & 3 & 4 & 5 \\ 1 & 2 & 1 & 2 & 1\end{array}\right)\). (b) \(f=\left(\begin{array}{lllll}1 & 2 & 3 & 4 & 5 \\ 1 & 2 & 3 & 1 & 2\end{array}\right)\). (c) \(f(x)=\left\\{\begin{array}{ll}x & \text { if } x \leq 3 \\ x-3 & \text { if } x>3\end{array}\right.\)

Problem 4

The following functions all have domain \\{1,2,3,4\\} and codomain \(\\{1,2,3,4,5\\} .\) For each, determine whether it is (only) injective, (only) surjective, bijective, or neither injective nor surjective. (a) \(f=\left(\begin{array}{llll}1 & 2 & 3 & 4 \\ 1 & 2 & 5 & 4\end{array}\right)\). (b) \(f=\left(\begin{array}{llll}1 & 2 & 3 & 4 \\ 1 & 2 & 3 & 2\end{array}\right)\). (c) \(f(x)\) gives the number of letters in the English word for the number \(x .\) For example, \(f(1)=3\) since "one" contains three letters.

Problem 4

Find a set of largest possible size that is a subset of both \\{1,2,3,4,5\\} and \\{2,4,6,8,10\\} .

Problem 4

Determine whether each molecular statement below is true or false, or whether it is impossible to determine. Assume you do not know what my favorite number is (but you do know that 13 is prime). (a) If 13 is prime, then 13 is my favorite number. (b) If 13 is my favorite number, then 13 is prime. (c) If 13 is not prime, then 13 is my favorite number. (d) 13 is my favorite number or 13 is prime. (e) 13 is my favorite number and 13 is prime. (f) 7 is my favorite number and 13 is not prime. (g) 13 is my favorite number or 13 is not my favorite number.

Problem 5

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a square, and the other is a triangle. Each shape is drawn in a single color. Suppose you believe me when I tell you that if the square is blue, then the triangle is green. What do you therefore know about the truth value of the following statements? (a) The square and the triangle are both blue. (b) The square and the triangle are both green. (c) If the triangle is not green, then the square is not blue. (d) If the triangle is green, then the square is blue. (e) The square is not blue or the triangle is green.

Problem 5

Find a set of smallest possible size that has both \\{1,2,3,4,5\\} and \\{2,4,6,8,10\\} as subsets.

Problem 6

Write out all functions \(f:\\{1,2\\} \rightarrow\\{a, b, c\\}\) (in two-line notation). How many functions are there? How many are injective? How many are surjective? How many are bijective?

Access millions of textbook solutions in one place

  • Access over 3 million high quality textbook solutions
  • Access our popular flashcard, quiz, mock-exam and notes features
  • Access our smart AI features to upgrade your learning
Access millions of textbook solutions in one place

Recommended explanations on Math Textbooks