Mathematics 220 Solutions to Homework 4

3.2. Let n ∈ N. Prove that if |n − 1| + |n + 1| ≤ 1, then |n2 − 1| ≤ 4.

Solution:
Result. Let n ∈ N. If |n − 1| + |n + 1| ≤ 1, then |n2 − 1| ≤ 4.
Proof. Suppose that n ∈ N. Then n ≥ 1, so that |n + 1| > 1. Since |n − 1| is
always nonnegative for n ∈ N, it follows that |n − 1| + |n + 1| > 1 as well. The
hypothesis of the result is false for all n ∈ N, and therefore the result is true.
This was an example of a vacuous proof.

3.8. Prove that if x is an odd integer, then 9x + 5 is even.

Solution:
Result. If x is an odd integer, then 9x + 5 is even.
Proof. Suppose that x ∈ Z is odd. Then there exists k ∈ Z so that x = 2k + 1.
Then 9(2k + 1) + 5 = 18k + 14 = 2(9k + 7). As 9k + 7 is an integer, we have shown
that 9x + 5 is even.

n2 + n − 6 2n3 + 3n2 + n
3.14. Let S = {1, 5, 9}. Prove that if n ∈ S and is odd, then is
2 6
even.

Solution:
n2 + n − 6 2n3 + 3n2 + n
Result. Let S = {1, 5, 9}. If n ∈ S and is odd, then is
2 6
even.
n2 + n − 6
Proof. For n = 1, 5, and 9, the quantity evaluates to −2, 12, and 42,
2
respectively, all of which are even. As the hypothesis is false for all n ∈ S, the
result is true.

3.18. Let x ∈ Z. Prove that 5x − 11 is even if and only if x is odd.

Solution:
Result. Let x ∈ Z. Then 5x − 11 is even if and only if x is odd.
Proof. We prove the “if” direction first, using its contrapositive. If x is even, then
there exists k ∈ Z so that x = 2k. Then

5x − 11 = 5(2k) − 11 = 10k − 12 + 1 = 2(5k − 6) + 1

As 5k − 6 is an integer, 5x − 11 is odd.
Mathematics 220 Solutions to Homework 4

Next we prove the “only if” direction, using a direct proof. Suppose that x is odd.
Then there exists k ∈ Z such that x = 2k + 1. Then

5x − 11 = 5(2k + 1) − 11 = 10k − 6 = 2(5k − 3)

As 5k − 3 is an integer, 5x − 11 is even.

3.22. Let S = {2, 3, 4} and let n ∈ S. Use a proof by contrapositive to prove that if
n2 (n − 1)2 /4 is even, then n2 (n + 1)2 /4 is even.

n2 (n − 1)2
Solution: Result. Let S = {2, 3, 4}, and let n ∈ S. If is even, then
4
n2 (n + 1)2
is even.
4
n2 (n + 1)2 n2 (n − 1)2
The contrapositive of the statement is: If is odd, then is odd.
4 4
Proof. We argue using the contrapositive. For n = 3 and 4, the quantity
n2 (n + 1)2
evaluates to 36 and 100, respectively. These are both even numbers,
4
and so the contrapositive holds vacuously.
n2 (n + 1)2
For the remaining case, n = 2, the quantity evaluates to 9, which is
4
n2 (n − 1)2
odd; and so, to verify the contrapositive, we must check the parity of
4
n2 (n − 1)2
for n = 2. The quantity evaluates to 1 in this case, which is also odd.
4
This verifies the result.

3.26.

Solution: Case 1: n is odd. In this case, n = 2k + 1 for some k ∈ Z. Then

n2 − 3n + 9 = (2k + 1)2 − 3(2k + 1) + 9

= 4k 2 − 2k + 7
= 2(2k 2 − k + 3) + 1.

Since 2k 2 − k + 3 is an integer, n2 − 3n + 9 is odd.

Case 2: n is even. In this case n = 2k for some k ∈ Z. Then

n2 − 3n + 9 = 4k 2 − 6k + 9
= 2(2k 2 − 3k + 4) + 1

is odd since 2k 2 − 3k + 4 is an integer.

Page 2
 Mathematics 220 Solutions to Homework 4

Question. Prove the implication: if m, n ∈ Z are odd then m2 + 3n2 is even. What is the converse
of the implication? Is the converse true or false? Justify your answer.

Solution: Since m, n are odd, m = 2a + 1, n = 2b + 1 for some a, b ∈ Z. Then

m2 + 3n2 = (4a2 + 4a + 1) + (12b2 + 12b + 3) = 2(2a2 + 2a + 6b2 + 6b + 2) is even
as 2a2 + 2a + 6b2 + 6b + 2 is an integer.
Converse: If m2 + 3n2 is even then m, n are odd. This is not true. Take m = n = 0.
Then m2 + 3n2 = 0 is even, but m, n are also even.

4.2.

Solution: a|b implies b = ax for some x ∈ Z and a 6= 0. b|a implies a = by for

some y ∈ Z and b 6= 0. So a = by = axy. Since a 6= 0, we have 1 = xy. Then, since
x, y are integers, x = y = 1 or x = y = −1. Therefore, a = b or a = −b.

4.10.

Solution: Assume 2|(n4 −3). Then n4 −3 = 2k for some integer k. Then n4 = 2k+3
is odd. By Theorem 3.12, then n2 is odd, and then by Theorem 3.12 again n is odd.
So n = 2a + 1 for some integer a. Then n2 + 3 = 4k 2 + 4k + 1 + 3 = 4(k 2 + k + 1).
This implies 4|(n2 + 3) as k 2 + k + 1 is an integer.
Assume 4|(n2 + 3). So n2 + 3 = 4b for some integer b. So n2 = 4b − 3. Then
n4 − 3 = (4b − 3)2 − 3 = 16b2 − 24b + 6 = 2(8b2 − 12b + 3) is even as 8b2 − 12b + 3
is an integer. So 2|(n4 − 3).

4.18.

Solution: a ≡ b (mod n) implies n|(a − b). So a − b = nk for some integer k. Then

a = b + nk. m|n implies n = mp for some integer p. Thus, a = b + nk = b + mpk.
Then a − b = m(pk). Then m|(a − b). Therefore, a ≡ b (mod m).

4.22.

Solution: (a) n ≡ 0 (mod 7) implies n = 7k for some integer k, so n2 = 7(7k 2 ).

Then n2 ≡ 0 (mod 7) as 7k 2 is an integer.
(d) n2 ≡ 3 (mod 7) implies n = 3+7k for some integer k. Then n2 = 9+42k+49k 2 =
2 + 7(1 + 6k + 7k 2 ). So n2 ≡ 2 (mod 7).
(e) n2 − (7 − n)2 = 7(2n − 7). So n2 ≡ (7 − n)2 (mod 7).

Page 3
 Mathematics 220 Solutions to Homework 4

4.42.

Solution: First, assume A ∩ B = A. ∀x ∈ A, x ∈ A ∩ B so x ∈ B. Then A ⊆ B.

Next, assume A ⊆ B. ∀x ∈ A, x ∈ B because A ⊆ B. So x ∈ A ∩ B. Therefore
A ⊆ A∩B. On the other hand, ∀x ∈ A∩B, x ∈ A. So A∩B ⊆ A. Thus A∩B = A.

4.48.

Solution: First assume n ∈ A ∩ B. n ∈ A implies n = 2k for some integer k.

n ∈
/ B implies 4 6 | n. Then 4 6 | 2k. This implies k is odd (If k were even, then
k = 2l for some integer l. Thus, 2k = 4l which is divisible by 4).
Nest, assume n = 2k, k is odd. So 2|n, n ∈ A. k is odd implies k = 2l + 1 for some
integer l. Hence, n = 4l + 2 which is not divisible by 4. So n 6∈ B. So n ∈ A − B.

4.56.

Solution: ∀x ∈ (A − B) ∪ (A − C), x ∈ A − B or x ∈ A − C. If x ∈ A − B, then

x ∈ A and x 6∈ B. Since B ∩ C ⊆ B, x 6∈ B ∩ C. Therefore, x ∈ A − (B ∩ C).
If x ∈ A − C, then x ∈ A and x 6∈ C. Since B ∩ C ⊆ C, x 6∈ B ∩ C. Therefore,
x ∈ A − (B ∩ C). Thus, (A − B) ∪ (A − C) ⊆ A − (B ∩ C).
∀x ∈ A − (B ∩ C), x ∈ A, x 6∈ B ∩ C. If x ∈ B then x 6∈ C. So x ∈ A − C, hence
x ∈ (A − B) ∪ (A − C). If x 6∈ B, then x ∈ A − B. Therefore x ∈ (A − B) ∪ (A − C).
Thus, A − (B ∩ C) ⊆ (A − B) ∪ (A − C).

Question. Let A, B be two sets. Prove: If A ∩ B = ∅, then A = (A ∪ B) − B.

Solution: ∀x ∈ A, x ∈ A ∪ B. Since A ∩ B = ∅, x 6∈ B. So x ∈ (A ∪ B) − B. We
conclude: A ⊆ (A ∪ B) − B. On the other hand, ∀x ∈ (A ∪ B) − B, x ∈ A ∪ B
and x 6∈ B implies x ∈ A. Then (A ∪ B) − B ⊆ A. Thus, we have shown:
A = (A ∪ B) − B.

Page 4