1.

PA = f (cA , PB ) and PB = g(cB , PA ) dPA = fcA dcA + fPB dPB

dPB = gPA dPA + gcB dcB
In
� matrix form, � � � � �
1 −fPB dPA fcA dcA
=
−gPA 1 dPB gcB dcB
� � � �� �
dPA 1 1 f PB fcA dcA
=
dPB 1 − f P B g PA g P A 1 gcB dcB
� � � �
dPA 1 fcA dcA + fPB gcB dcB
=
dPB 1 − fPB gPA gPA fcA dcA + gcB dcB
∂PA 1
= ∗ f PB g c B
∂cB 1 − f PB g PA
The sign is undetermined since we do not know what the magnitude of
fPB gPA even though fPB > 0, gcB > 0, gPA > 0.

2. max x0.5 y 0.5 s.t 2x + y = k L = x0.5 y 05 − λ(2x + y − k)

∂L
= 0.5x−0.5 y 0.5 − 2λ = 0
∂x
∂L
= 0.5x0.5 y −0.5 − λ = 0
∂y
∂L
= 2x + y − k = 0
∂λ
y
From the first and second conditions, = 2. So, we have the following two
x
equations:
2x − y = 0
2x + y = k
In matrix �form:
� � � � �
2 −1 x 0
=
2 1 y k
� � � �� �
x 1 1 1 0
=
y 2 + 2 −2 2 k
� � � � � �
x 1 k k/4
= =
y 4 2k k/2
∂x 1
=
∂k 4
∂y 1
=
∂k 2

p q ¬p ∨ q p q p⇒q
T T T T T T
3. T F F T F F
F T T F T T
F F T F F T

1
4.

X = {Alice, Bert, Chris} Y = {algebra, calculus}

X×Y = {(Alice, algebra), (Alice, calculus), (Bert, algebra), (Bert, calculus), (Chris, algebra), (Chris, calculus
R = {(Alice, algebra), (Bert, algebra), (Bert, calculus), (Chris, algebra)}
R−1 = {(algebra, Alice), (algebra, Bert), (calculus, Bert), (algebra, Chris)}

5. X = {−1, 0, 1} For <:      

−1 0 1 1
  0   0 0 1  
D = {−1, 0} R = {0, 1) 



1 � 0 0 0 �
−1 0 1
For �:      
−1 1 1 1
  0   0 1 1  
D = {−1, 0, 1}R = {−1, 0, 1} 



1 � 0 0 1 �
−1 0 1
For = :      
−1 1 0 0
  0   0 1 0  
D = {−1, 0, 1}R = {−1, 0, 1}



1 � 0 0 1 �
−1 0 1

6. Velleman Pg. 72 1. a) Everyone who is majoring in math has a friend

who needs help with his homework.
M (x) = “x is major in math”
N (x, y) = “y needs help with homework and x and y are friend”
In symbol,
∀x∃y(M (x) ∧ N (x, y))
¬∀x∃y(M (x) ∧ N (x, y))
∃x¬∃y(M (x) ∧ N (x, y))
∃x∀y¬(M (x) ∧ N (x, y))
∃x∀y(¬M (x) ∨ ¬N (x, y))
∃x∀y(M (x) → ¬N (x, y))
There is someone with a math major all of whose friends do not need help
with their homework.
b) Everyone has a roommate who dislikes everyone.
R(x, y) = “x and y are roommate”
L(y) = “y dislikes everyone”
In symbol,
∀x∃y(R(x, y) ∧ L(y))
¬∀x∃y(R(x, y) ∧ L(y))
∃x¬∃y(R(x, y) ∧ L(y))
∃x∀y¬(R(x, y) ∧ L(y))

2
∃x∀y(¬R(x, y) ∨ ¬L(y))
∃x∀y(R(x, y) → ¬L(y))
There is someone all of whose roommate likes at lease someone.
c) A ∪ B ⊆ C\D
∀x(x ∈ (A ∪ B) → x ∈ (C\D))
¬∀x(x ∈ (A ∪ B) → x ∈ (C\D))
∃x¬(x ∈ (A ∪ B) → x ∈ (C\D))
∃x¬(x ∈ / (A ∪ B) ∨ x ∈ (C\D))
∃x(x ∈ (A ∪ B) ∧ x ∈ / (C\D))
(A ∪ B) ⊆ (C\D)
d) ∃x∀y[y > x → ∃z(z 2 + 5z = y)]
¬∃x∀y[y > x → ∃z(z 2 + 5z = y)]
∀x∃y¬[y � x ∨ ∃z(z 2 + 5z = y)]
∀x∃y[y > x ∧ ¬∃z(z 2 + 5z = y)]
∀x∃y[y > x ∧ ∃z(z 2 + 5z �= y)]
2. a) F (x) = “x is in freshman class”
R(x) = “x doesn’t have roommate”
∃x(F (x) ∧ R(x))
¬∃x(F (x) ∧ R(x))
∀x¬(F (x) ∧ R(x))
∀x(¬F (x) ∨ ¬R(x))
∀x(F (x) → ¬R(x))
Every freshman has roommate.
b) Everyone likes someone, but no one likes everyone.
L(x, y) = “x likes y”
∀x∃y(L(x, y) ∧ ¬∀x∀yL(x, y))
¬∀x∃y(L(x, y) ∧ ¬∀x∀yL(x, y))
∃x∀y(¬L(x, y) ∨ ∀x∀yL(x, y))
∃x∀y(L(x, y) → ∃x∃yL(x, y))
There is someone who likes everyone, therefore someone likes someone.
c) ∀a ∈ A∃b ∈ B(a ∈ C ←→ b ∈ C)
¬∀a ∈ A∃b ∈ B(a ∈ C ←→ b ∈ C)
∃a ∈/ A∀b ∈/ B(a ∈/ C ∧b∈ / C)
d) ∀y > 0∃x(ax2 + bx + c = y)
¬∀y > 0∃x(ax2 + bx + c = y)
∃y > 0∀x(ax2 + bx + c = y)
3.
a) False
b) True
c) True
d) True
4.
¬¬∀xP (x) = ¬∃x¬P (x)
¬∃xP (x) = ∀x¬P (x)
∀x¬P (x) = ∀x¬P (x)
5.

3
¬∃x ∈ AP (x) = ∀x¬ ∈ AP (x) = ∀x ∈ / AP (x) = ∀x ∈ A¬P (x)
Velleman Pg. 82
#10)
P (A ∩ B) = P (A) ∩ P (B)
⇒
Suppose x ∈ P (A ∩ B)
By definition, ∀y(y ∈ x → y ∈ A ∩ B)
∀y(y ∈ x → (y ∈ A ∧ y ∈ B))
∀y[y ∈ x → y ∈ A] ∧ ∀y[y ∈ x → y ∈ B]
x ∈ P (A) ∩ P (B)
⇐
Suppose x ∈ P (A) ∩ P (B)
By definition, ∀y(y ∈ x → y ∈ A) ∧ ∀y(y ∈ x → y ∈ B)
This means, ∀y(y ∈ x → y ∈ A ∧ y ∈ B)
∀y(y ∈ x → y ∈ A ∩ B)
x ∈ P (A ∩ B)
#11)
P (A ∪ B) �= P (A) ∪ P (B)
Suppose A = {1}; B = {3}; A ∪ B = {1, 3}
So, P (A ∪ B) = {∅, {1}, {3}, {1, 3}}
P (A) = {∅, {1}} and P (B) = {∅, {3}}
So, P (A) ∪ P (B) = {∅, {1}, {3}} = � P (AU B) = {∅, {1}, {3}, {1, 3}}
Velleman Pg. 170
#4) A = {1, 2, 3}, B = {1, 4}, C = {3, 4}, D = {5}
#4.1) A × (B ∩ C) = (A × B) ∩ (A × C)
A × (B ∩ C) = {1, 2, 3} × {4} = {(1, 4), (2, 4), (3, 4)}
(A×B)∩(A×C) = {(1, 1), (1, 4), (2, 1), (2, 4), (3, 1), (3, 4)}∩{(1, 3), (1, 4), (2, 3), (2, 4), (3, 3), (3, 4)}
= {(1, 4), (2, 4), (3, 4)}
#4.2) A × (B ∪ C) = (A × B) ∪ (A × C)
A×(B∪C) = {1, 2, 3}×{1, 3, 4} = {(1, 1), (1, 3), (1, 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 3), (3, 4)}
(A×B)∪(A×C) = {(1, 1), (1, 4), (2, 1), (2, 4), (3, 1), (3, 4)}∪{(1, 3), (1, 4), (2, 3), (2, 4), (3, 3), (3, 4)}
= {(1, 1), (1, 3), (1, 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 3), (3, 4)}
#4.3) (A × B) ∩ (C × D) = (A ∩ C) × (B ∩ D)
(A × B) ∩ (C × D) = {(1, 1), (1, 4), (2, 1), (2, 4), (3, 1), (3, 4)} ∩ {(3, 5), (4, 5)}
=∅
(A ∩ C) × (B ∩ D) = {3} × ∅ = ∅
#4.4) (A × B) ∪ (C × D) ⊆ (A ∪ C) × (B ∪ D)
(A × B) ∪ (C × D) = {(1, 1), (1, 4), (2, 1), (2, 4), (3, 1), (3, 4)} ∪ {(3, 5), (4, 5)}
= {(1, 1), (1, 4), (2, 1), (2, 4), (3, 1), (3, 4), (3, 5), (4, 5)}
(A ∪ C) × (B ∪ D) = {1, 2, 3, 4} × {1, 4, 5}
= {(1, 1), (1, 4), (1, 5), (2, 1), (2, 4), (2, 5), (3, 1), (3, 4), (3, 5), (4, 1), (4, 4), (4, 5)}
#4.5) A × ∅ × A = ∅
{1, 2, 3} × ∅ × {1, 2, 3} = ∅
7) A × B has mn elements.
Pg. 178
1. a) {(p, q) ∈ P × P | the person p is a parent of the person q}

4
 D = {p ∈ P | p has a living child}
R = {p ∈ P | p has a living parent}
b) {(x, y) ∈ R2 |y > x2 }
D=�
R = �2
2.a) {(p, q) ∈ P × P | the person p is a brother of the person q}
D = {p ∈ P | p has a living sibling}
R = {p ∈ P | p has a living brother}
2
b) {(x, y) ∈ R2 |y 2 > 1 − 2 }
(x + 1)
D = (−∞, −1] ∪ [1, ∞)
R=�

7. s1 = {1, 2} and s2 = {3, 4} Upon passing s1 and s2 into the cartesian− product
function, we have a result variable called cp and assign an empty set to cp,
cp = {}. When the outer for_loop begins, we take the first element, 1, of s1 .
Then we enter the inner for_loop by taking the first element, 3, of s2 and add
the first element, 1, of s1 from the outer loop and the first element, 3, of s2
to cp. So, we have cp = {(1, 3)}. We then take the second element, 4, of s2
and add both the first element of s1 and second element, 4, of s2 to cp. So, we
have cp = {(1, 3), (1, 4)}. We return from the inner loop and take the second
element, 2, of s1 from the outer loop and enter the inner for_loop by taking
the first element, 3, of s2 and add both the second element of s1 and the first
element of s2 to cp. So, we have cp = {(1, 3), (1, 4), (2, 3)}. We then take the
second element, 4, of s2 and add both the second element of s1 and second
element of s2 to cp. So, we have cp = {(1, 3), (1, 4), (2, 3), (2, 4)}. We finally exit
the inner and outer loop and exit the cartesia− product by returning the result
cp = {(1, 3), (1, 4), (2, 3), (2, 4)}.

(n + 1)! n! n!
8. C(n+1, k) = C(n, k)+C(n, k−1) = +
k!(n + 1 − k)! k!(n − k)! (k − 1)!(n − k + 1)!
n!(n + 1) n! n!
= +
k!(n − k)!(n − k + 1) k!(n − k)! (k − 1)!(n − k)!(n − k + 1)
(n + 1) 1 1
= +
k!(n − k + 1) k! (k − 1)!(n − k + 1)
(n + 1) 1 1
= +
k(k − 1)!(n − k + 1) k(k − 1)! (k − 1)!(n − k + 1)
(n + 1) 1 1
= +
k(n − k + 1) k (n − k + 1)
(n + 1) (n − k + 1) + k
=
k(n − k + 1) k(n − k + 1)
(n + 1) (n + 1)
=
k(n − k + 1) k(n − k + 1)

5
 The intuitive interpretation of this relationship is C(n, k) + C(n, k − 1) ⊆
C(n + 1, k).