Mathematical Structures for Computer Science 7th Edition solutions

Mathematical Structures for Computer Science 7
Which of the following sentences are statements? a. The moon is made of green cheese. b. He is certainly a tall man. c. Two is a prime number. d. The game will be over by 4:00. e. Next year interest rates will rise. f. Next year interest rates will fall. g. x2 4 = 0

Mathematical Structures for Computer Science 7
Rewrite each of the following statements in the form If A, then B. a. Candidate Lu winning the election will be a sufficient condition for property taxes to increase. b. The user clicks Pause only if the game level changes. c. The components are scarce, therefore the price increases. d. Healthy hair

Mathematical Structures for Computer Science 7
Write the negation of each of the following statements a. Some child fears all clowns. b. Some children fear only clowns. c. No clown fears any child

Mathematical Structures for Computer Science 7
Give the truth value of each of the following wffs in the interpretation where the domain consists of people, M(x, y) is x is the mother of y, F(x) is x is female, M(x) is x is male. a. (4x)(E y)(M( y, x)) d. (E x)(E y)(M(x, y) ` M( y)) b. (E x)(4y)(M(x, y)) e. (E x)(4y)(M(x, y) S F( y)) c. (4x)(4y)(

Mathematical Structures for Computer Science 7
Which of the following candidates are binary or unary operations on the given sets? For those that are not, where do they fail? a. x# = x2 ; S = b. e x 1 if x is odd x if x is even + 1 2 3 1 1 2 3 2 2 3 4 3 3 4 5 S = {1, 2, 3} c. x + y = that fraction, x or y, with the smaller denominator; S = set

Mathematical Structures for Computer Science 7
In Exercises 112, solve the recurrence relation subject to the basis step.

Mathematical Structures for Computer Science 7
Join Author and Writes over Name giving Results16

Mathematical Structures for Computer Science 7
In Exercises 326, use mathematical induction to prove that the statements are true for every positive integer n. [Hint: In the algebra part of the proof, if the final expression you want has factors and you can pull those factors out early, do that instead of multiplying everything out and getting so

Mathematical Structures for Computer Science 7
Decide whether each of the following wffs is valid or invalid. Justify your answer. a. (E x)A(x) 4 ((4x)[A(x)]) b. (4x)P(x) ~ (E x)Q(x) S (4x)[P(x) ~ Q(x)]

Mathematical Structures for Computer Science 7
a. Draw the Hasse diagram for the partial ordering x divides y on the set {2, 3, 5, 7, 21, 42, 105, 210}. Name any least elements, minimal elements, greatest elements, and maximal elements. Name a totally ordered subset with four elements. b. Draw the Hasse diagram for the partial ordering x divi

Mathematical Structures for Computer Science 7
Give the truth value of each of the following wffs in the interpretation where the domain consists of the states of the United States, Q(x, y) is x is north of y, P(x) is x starts with the letter M, and a is Massachusetts. a. (4x)P(x) b. (4x)(4y)(4z)[Q(x, y) ` Q( y, z) S Q(x, z)] c. (E y)(E x)Q( y, x

Mathematical Structures for Computer Science 7
A certain protected species normally doubles its population each month. The initial population is 20, but by the beginning of the next month, 1 specimen has died of an infection. In successive months, the infection kills 2, then 4, then 8, and so forth. a. Write a recurrence relation for the size of

Mathematical Structures for Computer Science 7
Decide which of the given items satisfy the relation. a. \(\rho\) a binary relation on \(S \times C\) where S = {states in the United States}, C = {cities in the United States}, \(x \rho y \leftrightarrow y\) is the capital of x; (Indiana, Indianapolis), (Illinois, Chicago), (Kansas, Kansas City)

Mathematical Structures for Computer Science 7
Which of the following sentences are equivalent to the statement All circles are round. a. If its round, its a circle. b. Roundness is a necessary property of circles. c. Something that isnt round cant be a circle. d. Some round things are circles.

Mathematical Structures for Computer Science 7
Step 1 of 5 The wff stands for well-formed formulae. In well-formed formulae, the sentences are represented using logic symbols. We need to represent the given common English sentences as formulae. Step 2 of 5 a. Consider the statement B whenever A The statement says that the statement B will be tru

Mathematical Structures for Computer Science 7
Identify each of the following relations on S as one-to-one, one-to-many, many-to-one, or many-to-many. a. S = N xry 4 x = y + 1 b. S = set of all women inVicksburg xry 4 x is the daughter of y c. S = `(51, 2, 36) ArB 4 0A0 = 0B0 d. S = R xry 4 x = 5

Mathematical Structures for Computer Science 7
For each of the following binary relations r on Z, decide which of the given ordered pairs belong to r. a. xry 4 x 0 y; (2, 6), (3, 5), (8, 4), (4, 8) b. xry 4 x and y are are relatively prime; (5, 8), (9, 16), (6, 8), (8, 21) c. xry 4 gcd(x, y) = 7; (28, 14), (7, 7), (10, 5), (21, 14) d. xry 4 x2 +

Mathematical Structures for Computer Science 7
For Exercises 112, write the first five values in the sequence.

Mathematical Structures for Computer Science 7
What is the truth value of each of the following wffs in the interpretation where the domain consists of the real numbers? a. (4x)(E y)(x = y2 ) c. (E x)(4y)(x = y2 ) b. (4x)(4y)(x = y2 ) d. (E x)(E y)(x = y2 )

Mathematical Structures for Computer Science 7
Suppose a Prolog database exists that gives information about the parts in an automobile engine. Predicates of big, small, and partof are included. a. Write a query to find all small items that are part of other items. b. Write a query to find all big items that have small subitems. c. Formulate a re