Professional Documents
Culture Documents
Discrete Mathematics Math 6A: Homework 2
Discrete Mathematics Math 6A: Homework 2
Discrete Mathematics Math 6A: Homework 2
Math 6A
Homework 2
1.4-16 A discrete mathematics class contains a mathematics major who is a
freshman, 21 mathematics majors who are sophomores, 15 computer
science majors who are sophomores, 2 mathematics majors who are juniors,
2 computer science majors who are juniors, and 1 computer science major
who is a senior. Express each of these statements in terms of quantifiers and
then determine its truth value.
We let P(s,c,m) be the statement that student s has class standing c and is
majoring in m. The variable s ranges over students in the class, the variable c
ranges over the four class standings, and the variable m ranges over all
possible majors.
a) The proposition is smP(s, junior,m). It is true from the given information.
b) The proposition is scP(s,c,computer science). This is false, since there are
some mathemathics majors.
c) The proposition is xcm(P(s,c,m) (c≠ junior) (m ≠mathematics)). This is
true, since there is a sophomore majoring in computer science.
d) The proposition is s(cP(s,c,computer science) mP(s, sophomore,m)).
This is false, since ther is a freshman mathematics major.
e) The proposition is mcsP(s,c,m). This is false. It cannot be that m is
mathematics, since there is no senior mathematics major, and it cannot be
that m is computer science, since there is no freshman computer science
major. Nor can m be any other major.
1.4-21 Use predicates, quantifiers, logical connectives, and mathematical
operartors to express the statement that every positive integer is the sum of
the squares of four integers.
xabcd ((x > 0) x = a2 + b2 + c2 + d2), where the universe of discourse
consists of all integers
1.4-30 Rewrite each of these statements so that negations appear only within
predicates (that is, so that no negation is outside a quantifier or an express
involving logical connectives)
a) ~yxP(x,y): yx~P(x,y)
b) ~xyP(x,y): xy~P(x,y)
c) ~y(Q(y) x~R(x,y)): y(~Q(y) xR(x,y))
d) ~y(xR(x,y) xS(x,y)): y(x~R(x,y) x~S(x,y))
e) ~y(xzT(x,y,z) xzU(x,y,z)): y(xz~T(x,y,z) xz~U(x,y,z))
1.4-33 Rewrite each of these statements so that negations appear only within
predicates (that is, so that no negation is outside a quantifier or an expresssion
involving logical connectives.)
a) ~xyP(x,y): xy~P(x,y)
b) ~yxP(x,y): yx~P(x,y)
c) ~yx(P(x,y) Q(x,y)): yx~(P(x,y) Q(x,y)) = yx(~P(x,y) ~Q(x,y))
d) ~(xy~P(x,y) xyQ(x,y)): xyP(x,y) (xy~Q(x,y))
e) ~x(yzP(x,y,z) zyP(x,y,z)):
x~(yzP(x,y,z) zyP(x,y,z))
= x(~yzP(x,y,z) ~zyP(x,y,z))
= x(yz~P(x,y,z) zy~P(x,y,z))
1.6-2 Use set guilder notation to give a description of each of these sets.
a) {0,3,6,9,12}: {3n | n = 0,1,2,3,4} or {x | x is a multiple of 3 0 x 12}
b) {-3, -2, -1, 0, 1, 2, 3}: {x | -3 x 3}, where we are assuming that the
universe of discourse is the set of integers.
c) {m, n, o, p}: {x | x is a letter of the word monopoly other than l or y}
1.6-7 Determine whether each of these statements is true of false.
a) 0 : false, since the empty set has no elements.
b) {0}: false: The set on the right has only one element, namely the number
0, not the empty set
c) {0} : false: the empty set has no proper subsets.
d) {0}: true: every element of the set on the left is an element of the set on
the right; and the set on the right contains an element, namely 0, that is not
the set on the left
e) {0} {0}: false: the set on the right has only one element, namely the
number 0, not the set containing the number 0
f) {0} {0}: false: for one set to be a proper subset of another, the two sets
cannot be equal
g) {} {}: true: every set is a subset of itself
1.6-12 Find two sets A and B such that A B and A B
Since the empty set is a subset of every set, we just need to take a set B that
contains as an element. Thus, we can let A = and B={} as the simplest
example
1.6-21 what is the Cartesian product AB C, where A is the set of all airlines
and B and C are both the set of all cities in the United States?
This is the set of triples (a,b,c), where a is an airline and b and c are cities. For
example, (TWA, Rochester Hills Michigan, Middletown New Jersey) is an
elements of this Cartesian product. A useful subbset of this set is the set of
triples (a, b, c) for which a flies between b and c. For example, (Northewest,
Detroit, New York) is in this subset, but the triple mentioned earliers is not.
1.7-4 Let A={a,b,c,d,e} and B={a,b,c,d,e,f,g,h}. Find
a) A B: {a,b,c,d,e,f,g,h}
b) A B: {a,b,c,d,e}
c) A – B:
d) B- A: {f,g,h}