Topic 1: MATH1081 Problem Solutions
Topic 1: MATH1081 Problem Solutions
Callum Brannon
Term 3 2021
Topic 1
1. Are any of the sets A = {1, 1, 2, 3}, B = {3, 1, 2, 2}, C = {1, 2, 1, 2, 4, 2, 3} equal?
Solution. Yes, sets A and B are equal since they have the same elements, namely, 1,2, and 3.
2. Show that
A = {x ∈ R| cos(x) = 1}
is a subset of
B = {x ∈ R| sin(x) = 0}.
Is the A a proper subset of B? Give reasons.
x = 2kπ where k ∈ Z,
and therefore
sin(x) = sin(2kπ) = sin(0) = 0.
Which shows that x ∈ A =⇒ x ∈ B and thus A ⊆ B. Now consider x = π and since
sin(π) = 0,
then x ∈ B. However cos(π) = −1 and so x ∈ / A, which means that there exists at least one element in B
that is not in A and therefore A is a proper subset of B or A ⊂ B.
a) ∅, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}
b) (a, 1), (a, 2), (b, 1), (b, 2), (c, 1), (c, 2)
1
4. Given the sets X = {24k + 7|k ∈ Z}, Y = {4n + 3|n ∈ Z}, Z = {6m + 1|m ∈ Z}, prove that X ⊆ Y
and X ⊆ Z but Y 6⊆ Z.
Solution. Let x ∈ X
11. In a class of 40 people studying music: 2 play violin, piano and recorder, 7 play at least violin and
piano, 6 play at least piano and recorder, 5 play at least recorder and violin, 17 play at least violin,
19 play at least piano, and 14 play at least recorder. How many play none of these instruments?
Solution. Drawing a venn diagram and putting in the information we see that 34 people play at least one
of these instruments in total. So there are 6 people who play none of these instruments.
12. Prove the following statements if they are true and give a counter-example if they are false.
Hence, in both cases we have shown that A ⊆ B and the statement in true.
b) Solution. Consider the sets A = {1, 2}, B = {1, 2, 3}, and C = {1}. So,
whilst,
A ∪ (B ∩ C) = {1, 2} ∪ {1} = {1, 2}.
Hence the statement is not true for all sets A, B, and C.
2
13. Let A and B be general sets. Determine the containment relation (⊆, ⊇, =, none) that hold between
a) ⊇
b) =
14. Let A and B be general sets. Determine the containment relation (⊆, ⊇, =, text that holds between
15. Show that A − B = A ∩ B c and hence simplify the following using the laws of set algebra.
a) A ∩ (A − B)
b) (A − B) ∪ (A ∩ B)
c) (A ∪ B) ∪ (C ∩ A) ∪ (A ∩ B)c .
On the other hand, let x ∈ A ∩ B c . Which means that x is in A but not in B which is the definition of the
difference of two sets and thus x ∈ A − B which means that A ∩ B c ⊆ A − B.
a)
A ∩ (A − B) = A ∩ (A ∩ B c )
= (A ∩ A) ∩ B c
= A ∩ Bc
= A − B.
b)
(A − B) ∪ (A ∩ B) = (A ∩ B c ) ∪ (A ∩ B)
= A ∩ (B c ∪ B)
=A∩U
= A.
3
c)
(A ∪ B) ∪ (C ∩ A) ∪ (A ∩ B)c = (A ∪ B) ∪ (C ∩ A) ∪ (Ac ∪ B c )
= (A ∪ Ac ∪ B ∪ B c ) ∪ (C ∩ A)
= (U ∪ U) ∪ (C ∩ A)
= U ∪ (C ∩ A)
= U.
(A − B c ) ∪ (B ∩ (A ∩ B)c ).
Solution.
(A − B c ) ∪ (B ∩ (A ∩ B)c ) = (A − B c ) ∪ (B ∩ (Ac ∪ B c ))
= (A − B c ) ∪ ((B ∩ Ac ) ∪ ∅)
= (A − B c ) ∪ (B ∩ Ac )
= (A ∩ B) ∪ (B ∩ Ac )
= B ∩ (A ∪ Ac ).
=B∩U
= B.
17. Simplify
[A ∩ (A ∩ B c )] ∪ [(A ∩ B) ∪ (B ∩ Ac )]
and hence simplify
[A ∪ (A ∪ B c )] ∩ [(A ∪ B) ∩ (B ∪ Ac )].
Solution.
[A ∩ (A ∩ B c )] ∪ [(A ∩ B) ∪ (B ∩ Ac )] = [(A ∩ A) ∩ B c )] ∪ [B ∩ (A ∪ Ac )]
= (A ∩ B c ) ∪ (B ∩ U)
= B ∪ (A ∩ B c )
= (B ∪ A) ∩ (B ∪ B c )
= A ∪ B.
[A ∪ (A ∪ B c )] ∩ [(A ∪ B) ∩ (B ∪ Ac )] = A ∩ B.
4
19. Use the laws of set algebra to prove that for all sets R, P , and Q
(R − P ) − Q = R − (P ∪ Q).
(R − P ) − Q = (R ∩ P c ) − Q
= (R ∩ P c ) ∩ Qc
= R ∩ (P c ∩ Qc )
= R ∩ (P ∪ Q)c
= R − (P ∪ Q).
21. Prove if true or give a counter example if false (for all sets A, B, and C:
A × (B ∪ C) = (A × B) ∪ (A × C).
Solution. First, let (x, y) be an ordered pair and (x, y) ∈ LHS. This means that x ∈ A and y ∈ B ∪ C. If
y ∈ B then (x, y) ∈ A × B and thus (x, y) ∈ RHS. A similar argument can be made if y ∈ C and hence we
have shown that A × (B ∪ C) ⊆ (A × B) ∪ (A × C).
On the other hand, let (x, y) ∈ RHS. Now, either (x, y) is an element of A × B or A × C. If (x, y) ∈ A × B
then this means that x ∈ A and y ∈ B. Thus, (x, y) ∈ A × B and hence (x, y) ∈ A × (B ∪ C). Making a
similar argument if (x, y) ∈ A × C and we have shown that (A × B) ∪ (A × C) ⊆ A × (B ∪ C). Therefore,
we have shown that LHS = RHS.
22. Let
Ak = {n ∈ N|k ≤ n ≤ k 2 + 5}
for k = 1, 2, 3, . . . . Find
4
S
a) Ak ;
k=1
90
T
b) Ak ;
k=10
∞
T
c) Ak
k=1
a) Begin with
4
[
Ak = A1 ∪ A2 ∪ A3 ∪ A4 .
k=1
Now, notice,
A1 = {n ∈ N|1 ≤ n ≤ 6} = {1, 2, 3, 4, 5, 6}
and
A2 = {n ∈ N|2 ≤ n ≤ 9} = {1, 2, 3, 4, 5, 6, 7, 8, 9}.
We can recognise that the union of Ak from k = 1 to 4 will include the natural numbers from 1 to
42 + 5 = 21. And so,
[4
Ak = {i ∈ N|1 ≤ i ≤ 21}.
k=1
5
b) First notice that the sequences {k}, and {k 2 +5} are increasing for all k = 1, 2, 3, . . . . So the intersection
must of Ak must include the smallest element of A90 and the largest element of A10 . From this we an
deduce that
\90
Ak = {i ∈ N|90 ≤ i ≤ 105}.
k=10
c) Consider A1 and A7 .
A1 = {1, 2, 3, 4, 5, 6}
and
A7 = {7, . . . , 54}.
Clearly there is no common element and thus
∞
\
Ak = ∅.
k=1
25. Evaluate
a) bπc,
b) dπe,
c) b−πc,
d) d−πe.
a) 3
b) 4
c) −4
d) −3
6
26. Prove that if n is an integer, then
1 2
n− n − n
3 3
equals either 0 or 1.
Case 1, q = 0.
3m − bmc − b2mc = 3m − m − 2m = 0.
Case 2, q = 31 .
1 2
3m + 1 − m + − 2m + = 3m − m − 2m = 0.
3 3
Case 3, q = 23 .
2 4
3m + 2 − m + − 2m + ,
3 3
which is the same as,
1
3m + 2 − m − (2m + 1) + = 2m + 2 − (2m + 1) = 1.
3
Thus if n is an integer, then n − 31 n − 32 n only equals 0 or 1.
27. Determine which of the following functions are one-to-one, which are onto, and which are bijections.
a) f : Z → Z, f (x) = 2x.
b) f : Q → Q, f (x) = 2x + 3.
c) f : R → Z, f (x) = dxe .
d) f : R → R, f (x) = x − bxc .
7
28. a) Let S be the set {n ∈ N|0 ≤ n ≤ 11} and define f : S → S by letting f (n) be the remainder
when 5n + 2 is divided by 12. Is f one-to-one? Is f onto?
b) Repeat part (a) with 5n + 2 replaced by 4n + 2.
a) Bijection
b) Neither
29. Define f : R → R by
f (x) = x2 − 4x + 6.
g(x) = x3 − x + 1
and h : R → R defined by
h(x) = x3 + x + 1.
a) g(x) ∈ R.
b) Yes as Range(g) = R.
c) First, we find the stationary points of g. Differentiating we see that
g 0 (x) = 3x2 − 1.
3x2 − 1 = 0
1
x2 =
3
1
x = ±√ .
3
Since g(x) is a cubic we know these must be turning points. Therefore, the function is not one-to-one.
8
Now solving for h.
a) h(x) ∈ R.
b) Yes as Range(h) = R.
c) First, we find the stationary points of h. Differentiating we see that
h0 (x) = 3x2 + 1.
3x2 + 1 = 0
−1
x2 =
.
3
So there is no x ∈ R such that h(x) = 0. Hence, there are no turning points and since h(x) is continuous
then h is one-to-one.
31. Let Z+ be the set of all positive integers and f : Z+ × Z+ → Z+ be the function defined by
f (m, n) = mn for all (m, n) ∈ Z+ × Z+ . Determine whether f is one-to-one or onto.
Solution. Given any y ∈ Z+ and setting x = (1, y) ∈ Z+ Which mean that f (x) = y and thus f is onto.
To prove f is not one-to-one, consider 4 = 2 · 2 = 4 · 1.
a) g ◦ f : R → R is given by
p √
(g ◦ f )(x) = g(f (x)) = g(2x − 3) = (2x − 3)2 + 2 = 4x2 − 12x + 11.
b) g ◦ f : Z → Z is given by
x−1 x−1
(g ◦ f ) = g(f (x)) = g( )=2· + 1 = x − 1 + 1 = x.
2 2
where x ∈ X and z ∈ Z. We wish to prove for all z ∈ Z there exists and x ∈ X such that g(f (x)) = z.
Now, since f is onto then for all y ∈ Y there exists and x ∈ X such that f (x) = y. Which means that
for all y there exist an x ∈ X such that g(f (x)) = g(y). Likewise, since g is onto then for all z ∈ Z there
exists a y ∈ Y such that g(y) = z. Thus, we have shown that for all z ∈ Z there exists an x ∈ X such that
(g ◦ f )(x) = g(f (x)) = z. Hence, the function g ◦ f is onto.
9
b) Suppose that f and g are one-to-one functions. That is to say for all x1 , x2 ∈ X then
f (x1 ) = f (x2 ) ⇐⇒ x1 = x2
g(y1 ) = g(y2 ) ⇐⇒ y1 = y2 .
Suppose that
g(f (x1 )) = g(f (x2 ))
and let f (x1 ) = y1 and f (x2 ) = y2 for some y1 , y2 ∈ Y. Then we have that
g(y1 ) = g(y2 ).
Since g is one-to-one then this implies that y1 = y2 or equivalently f (x1 ) = f (x2 ). But f is one-to-one so
this implies that x1 = x2 . We have proved that if g(f (x1 )) = g(f (x2 )) then x1 = x2 and thus this proves
that g ◦ f is one-to-one if f and g are both one-to-one.
(f ◦ g)(n) = f (g(n)).
Thus,
(f ◦ g)(n) 6= n,
and so f ◦ g 6= ι is not the identity function.
10
35. For each of the following bijections find the inverse and the domain and range of the inverse.
a) f : R → R, f (x) = 5x + 3.
b) g : Z → N, (
2|x| − 1 if x < 0
g(x) =
2x if x ≥ 0
y = 2|x| − 1
y+1
|x| =
2
−y − 1
x= . (Since x < 0 and so |x| = −x)
2
Notice that for x to be an integer then y + 1 = 2k for some integer k. So we take y = 2k − 1 and thus we
only take odd natural numbers y.
Case 2, x ≥ 0. In this case we have that
y = 2x
y
x=
2
Notice that for x to be an integer then y = 2k for some integer k. So we take y = 2k and thus we only
take even natural numbers y.
So the inverse of g is the function g −1 : N → Z defined by
(
−x−1
if x is odd
g −1 = x 2
2
if x is even
11
36. Suppose that f : R → R is defined by f (x) = 2x2 − 1. Find
a) If A = {x| − 2 ≤ x ≤ 3} then
f (A) = {2x2 − 1| − 2 ≤ x ≤ 3}
= {y ∈ R|0 ≤ y ≤ 17}.
f (m, n) = m2 − n2 .
a) Start by supposing f is onto. Then for all a ∈ Z then there exists m, n ∈ Z such that f (m, n) =
m2 − n2 = a. Also suppose that a < −n2 . We can rearrange to obtain
m2 = n2 + a
b) Begin by writing
By taking notes of the factors of 8, namely, 1,2,4,8. Splitting into cases and solving simultaneously we
obtain set of possible ordered pairs of (m, n) to be
12
38. Suppose that f is a function from X to Y and A, B are subsets of X, and suppose that S, T are
subsets of Y.
b) We first prove that that LHS ⊆ RHS. First, let x ∈ LHS. This means that either x ∈ f −1 (S) or
x ∈ f −1 (T ). Suppose that x ∈ f −1 (S) and so x ∈ X such that f (x) ∈ S. It follows that f (x) ∈ S ∪ T which
implies that x ∈ f −1 (S ∪ T ). A similar argument can be made for x ∈ f −1 (T ) and so we have shown that
x ∈ LHS =⇒ x ∈ RHS which proves LHS ⊆ RHS.
a)
N
X N
X N
X +1 N
X −1
3 3 3
(k + 1) − (k − 1) = k − k3.
k=1 k=1 k=2 k=0
Thus we get
N
X N
X
3
(k + 1) − (k − 1)3 = (N + 1)3 + N 3 − 1.
k=1 k=1
N
X N
X N
X
3 3
(k + 1) − (k − 1) = 6k 2 + 2.
k=1 k=1 k=1
13
Now splitting this sum up and taking a factor of 6 we get that
N
X N
X N
X
6k 2 + 2 = 6 k2 + 2,
k=1 k=1 k=1
And so
N
X 1 N
k 2 = [(N + 1)3 + N 3 − 2N − 1] = (N + 1)(2N + 1).
k=1
6 6
and,
N +2 N
X 1 X 1 1 1
= + + .
k=3
k k=3
k N +1 N +2
Combining these two facts we see that
N N +2 N " N #
X 1 X 1 X 1 1 X 1 1 1
− = +1+ − + + .
k=1
k k=3
k k=3
k 2 k=3
k N + 1 N + 2
14
Which simplifies to
3 1 1
− − ,
2 N +1 N +2
and thus we can conclude that for N ≥ 1
N
X 2 3 1 1
= − − .
k=1
k(k + 2) 2 N +1 N +2
15
Topic 2
a) 19 is divided by 7,
b) -111 is divided by 11,
c) 1001 is divided by 13.
a) 2, 5 (19 = 2 · 7 + 5)
b) -11, 10 (−111 = −11 · 11 + 10)
c) 77, 0 (1001 = 77 · 13 + 0)
17, 37
177 = 32 · 13;
143 = 11 · 13;
3468 = 22 · 3 · 172 ;
75600 = 24 · 33 · 52 · 7.
a) 22 · 35 · 53 and 25 · 33 · 52 ,
b) 22 · 3 · 53 and 32 · 7,
c) 0 and 3.
a) 22 · 33 · 52 , 25 · 35 · 53 .
b) 3, 22 · 32 · 53 · 7
c) 3, undefined.
16
6. Evaluate 13 mod 3, 155 mod 19, (-97) mod 11.
1, 3, 2.
b) We know that bd = kab for some k ∈ Z by definition. So if b 6= 0, we can divide through by b and
obtain d = ka ⇐⇒ a|d.
e) We know by definition that m = n1 k and a − b = n2 m for some n1 , n2 ∈ Z. Now, first take the case if
m = 0. Then we get that a = b and k = 0, so clearly k|(a − b) ⇐⇒ 0|0. Now assume m 6= 0. Multiplying
our two equations yields
m(a − b) = n1 n2 km ⇐⇒ (a − b) = n1 n2 k. (Since m 6= 0)
So since n1 , n2 ∈ Z, then n1 n2 ∈ Z and so the result is proved.
f) We know that a = m1 d and b = m2 d for some m1 , m2 ∈ Z. Now since d is the greatest common divisor
for a and b then it must contain all factors common to both a and b. It then follow that m1 and m2 must
be coprime. If this needed justification, all one would say is that say m1 and m2 were not coprime and
had a common factor of c ∈ Z then c would divide a and b. But all factors common to both a and b must
be contained in d and this is a contradiction. Now rearranging our equations we have that
a b
= m1 and = m2 .
d d
But m1 and m2 are coprime and it follows that gcd( ad , db ) = 1.
17
g) We know by definition that a − b = km for some k ∈ Z. Rearranging we get
a = km + b
18