Math 355 (HW 1)

Section 1.2: # 1, 3, 5ab, 12

1. (a) Assume (towards a contradiction) that there exist integers p and q satisfying
 2
p
= 3.
q
We also assume that p and q have no common prime factor. Then this implies p2 = 3q 2 .
From this, we can see that p2 is a multiple of 3 and hence p must also be a multiple of 3. This
allows us to write p = 3r, where r is an integer. By substituting 3r for p, we get (3r)2 = 3q 2 ,
which can be simplified to 3r2 = q 2 . This implies q 2 is a multiple of 3 and hence q is also a
multiple of 3. Thus, p and q have a common factor (i.e. 3), which is a contradiction. Thus,
there is no rational number whose square is 3.
√
A similar argument will work for 6 as well. (At the stage that p2 = 6q 2 , we see that p2
is a multiple of both 2 and 3, so p is a multiple of both 2 and 3, and hence p is a multiple
of 6.)
(b) In this case, the fact that p2 is a multiple of 4 does not imply p is also a multiple of 4.
(It could be that p is a multiple of 2.)

3.
(a) False. (Recall the example of An = (0, n1 ) from class.)
(b) True. (Let m be the number of elements in A1 . Then each subsequent set as at least
1 and at most m elements. Since the sets are nested, this means the intersection has
at least 1 element in it, and at most m elements, and so it must also be finite and
nonempty.)
(c) False. Consider the sets A = {1, 2, 3} , B = {3, 6, 7} and C = {5} . Then A ∩ (B ∪ C) =
{3} while (A ∩ B) ∪ C = 3, 5.
(d) True.
A
B C

(e) True.
A
B C

5. (a) Suppose x ∈ (A ∩ B)c . Then x ∈ / A ∩ B, so we know that x ∈/ A or x ∈

/ B. If x ∈
/ A,
c c c
then x ∈ A and hence x ∈ A ∪ B . Similarly, if x ∈ / B, then x ∈ B and hence x ∈ A ∪ B c .
c c

Thus, in either case, x ∈ Ac ∪ B c .

1
 (b) Suppose x ∈ Ac ∪ B c . Then x ∈ Ac or x ∈ B c . If x ∈ Ac , then x ∈
/ A, so x ∈
/ A ∩ B.
c c
Thus, x ∈ (A ∩ B) . Similarly, if x ∈ B , then x ∈ / A ∩ B and hence x ∈ (A ∩ B)c .
/ B, so x ∈
Therefore, in either case x ∈ (A ∩ B)c , so Ac ∪ B c ⊆ (A ∩ B)c .

12. (a) Base case: The statement holds for n = 1, since y1 = 6 > −6.
Ind. step: Now suppose yk > −6 for all k ≤ n for some fixed n. Then
2yn − 6
yn+1 =
3
2(−6) − 6
> (by the ind. hyp.)
3
−18
=
3
= −6.
Thus, yn > −6 for all n ∈ N.
(b) Base case: The statement holds for n = 2, since y1 = 6 and
y2 = (2y1 − 6)/3 = (2(6) − 6)/3 = 2 < y1 .
Ind. step: Now suppose yk < yk−1 for all k ≤ n for some fixed n. Then
2yn − 6
yn+1 =
3
2yn−1 − 6
< (by the ind. hyp.)
3
= yn (by definition of yn ).
Thus, yn < yn−1 for all n ∈ N.