Homework 1b

Trương Hoàng Danh-2310423-L05

Ngày 27 tháng 2 năm 2024

Section 2.1
Exercise 11
a) T

b) T

c) F

d) T

e) T

f) F

Exercise 12

1
Exercise 13

Exercise 26
Because A Ď C and B Ď D, all elements of A is in C and all elements of B is in D. Therefore, all the pair created
by A ˆ B is in the set C ˆ D

Exercise 27
a) A ˆ B “ tpa, yq, pa, zq, pb, yq, pb, zq, pc, yq, pc, zq, pd, yq, pd, zqu

b) B ˆ A “ tpy, aq, py, bq, py, cq, py, dq, pz, aq, pz, bq, pz, cq, pz, dq

Exercise 28
Let c is a course, p is a professor. The Cartesian product A ˆ B is the set of all possible pair pc, pq. The element of
this set can be used when we assign teaching work in the mathematics department.

Exercise 41
a) The square of all real number is not equal to -1. This is true.

b) There is an integer whose square is equal to 2. This is false.

c) The square of all integer is greater than zero. This is false since 02 “ 0

d) There exist a real number whose square is equal to itself. This is true when x “ 0 or x “ 1

Exercise 42
a) There exist a real number whose cube is equal to -1. This is true when x “ ´1

b) There is an integer that adding 1 to it makes it greater than itself. This is true (for every integer).

c) All integer, when subtracted 1, the resulting number remains an integer. This is true

d) The square of all integer is an an integer. This is true

2
Exercise 43
a) The truth set is tx P Z | x2 ă 3u “ t´1, 0, 1u

b) The truth set is tx P Z | x2 ą xu “ Zzt0, 1u

c) The truth set is tx P Z | 2x ` 1 “ 0u “ H

Exercise 44
a) The truth set is tx P Z | x3 ą 1u “ t1, 2, 3, ...u

b) The truth set is tx P Z | x2 “ 2u “ H

c) The truth set is tx P Z | x ă x2 u “ Zzt0, 1u

Exercise 45
If a ‰ b, then ttau, ta, bu has two elements. Because ttau, ta, bu “ ttcu, that mean tau “ tcu and ta, bu “ tc, du. So
a = c and b = d.
If a “ b, then ttau, ta, bu has one element and so is the set ttcu, tc, du. It then follows that a “ c, and hence b “ d,
as well.

Exercise 46
a) if S P S, then by the defining condition for S we conclude that S R S , a contradiction

b) ) If S R S , then by the defining condition for S we conclude that it is not the case that S R S (otherwise S
would be an element of S ), again a contradiction.

Exercise 47
First add the empty set, then the set containing one element of the set S, then the set containing exactly two
elements of the set S and so on until the set itself is added.

Section 2.2
Exercise 15
a) @xpx P A Y Bq
” @xpx R A Y Bq
” @xp␣px P A _ x P Bqq
” @xp␣px P Aq ^ ␣px P Bqq
” @xpx R A ^ x R Bq
” @xpx P A ^ x P Bq
” @xpx P A X Bq
ñAYB ĎAXB
ñAYB = AXB

3
 AB AYB AYB A B AXB
11 1 0 0 0 0
b) 10 1 0 0 1 0 ñAYB = AXB
01 1 0 1 0 0
11 1 0 0 0 0

Exercise 16
a) @x P pA X Bq ñ x P A
ñ pA X Bq Ď A ñ pA X Bq “ A

b) @x P A ñ x P pA Y Bq
ñ A Ď pA Y Bq ñ A “ pA Y Bq

c) @x P pA ´ Bq ñ x P A
ñ pA ´ Bq Ď A ñ pA ´ Bq “ A

d) @x P A ^ @x P pB ´ Aq ñ x P pA X pB ´ Aqq
x P A ñ x P pA Y Bq
ñ pA X pB ´ Aqq Ď pA Y Bq ñ pA X pB ´ Aqq “ pA Y Bq

Exercise 17
a) @x P A Y B Y C ñ x R A ^ x R B ^ x R C
ñ x R pA X B X Cq ñ x P pA Y B Y Cq
ñ A Y B Y C Ď pA Y B Y Cq ñ A Y B Y C “ pA Y B Y Cq

ABC AXBXC AXBXC A B C AYBYC

111 1 0 0 0 0 0
110 0 1 0 0 1 1
101 0 1 0 1 0 1
b) 100 0 1 0 1 1 1
011 0 1 1 0 0 1
010 0 1 1 0 1 1
001 0 1 1 1 0 1
000 0 1 1 1 1 1

Exercise 19
a) @x P pA ´ Bq ñ x P A ^ x R B
ñ x P A ^ x P B ñ x P pA X Bq
ñ pA ´ Bq Ď pA X Bq ñ pA ´ Bq “ pA X Bq

b) @x P pA X Bq ñ x P A ^ x P B
ñ x P A ñ pA X Bq Ď A
ñ pA X Bq “ A

Exercise 20
a) @x P pA Y Bq ñ x P A _ x P B, A Ď B ñ pA Y Bq “ B

4
 b) @x P pA X Bq ñ x P A ^ x P B, A Ď B ñ pA Y Bq “ A

Exercise 21
@x P A Y pB Y Cq ” px P Aq _ px P pB Y Cqq ” px P Aq _ px P Bq _ px P Cq ” x P pA Y Bq _ x P C ” x P pA Y Bq Y C
ñ A Y pB Y Cq Ď pA Y Bq Y C ñ A Y pB Y Cq “ pA Y Bq Y C

Exercise 35
if there is one element belong to pA Y Bq ´ pA X Bq that means either x P A or x P B but we have x R pA X Bq.
That is the definition of A ‘ B

Exercise 36
pA ´ Bq Y pB ´ Aq “ pA Y Bq ´ pA X Bq ñ pA ´ Bq Y pB ´ Aq “ A ‘ B

Section 2.3
Exercise 25
If f pxq ą f pyq, x ă y, then gpxq “ 1{f pxq ă gpyq “ 1{f pyq. Which means gpxq is increasing whenever f pxq is
decreasing.
If gpxq ă gpyq, x ă y, then f pxq “ 1{gpxq ă f pyq “ 1{gpyq. Which means f pxq is decreasing whenever gpxq is
increasing.

Exercise 26
a) We are told that f px1q ă f px2q whenever x1 ă x2 . We need to show that f px1q ‰ f px2q whenever x1 ‰ x2..
This is true form the given condition.

b) Define f(x) in part f pxq “ x3 when x ă 0 and f pxq “ 0 when x ě 0

Exercise 27
a) We are told that f px1q ą f px2q whenever x1 ă x2 . We need to show that f px1q ‰ f px2q whenever x1 ‰ x2..
This is true form the given condition.

b) Define f(x) in part f pxq “ ´x3 when x ă 0 and f pxq “ 0 when x ě 0

Exercise 33
a) If gpxq, f pxq are one-to-one, then gpx1q ‰ gpx2q, which leads to f pgpx1qq ‰ f pgpx2qq.
b) If gpxq, f pxq are onto, then Dx P ADy P Bpgpxq “ y, Dy P bDz P Cpf pyq “ z. Putting these together, we have
z “ f pyq “ f pgpxqq, as desired.

Exercise 34
Yes gpxq is one-to-one. Suppose gpxq is one-to-one, which means gpx1q ‰ gpx2q whenever x1 ‰ x2, leading to
f pgpx1qq ‰ f pgpx2qq

5
Exercise 35
To establish the setting here, let us suppose that g : A Ñ B and f : B Ñ C. Then f ˝ g : A Ñ C. We are told that
f and f ˝ g are onto. Thus all of C gets "hit" by the images of elements of B; in fact, each element in C gets hit by
an element from A under the composition f o g. But this does not seem to tell us anything about the elements of B
getting hit by the images of elements of A. Indeed, there is no reason that they must. For a simple counterexample,
suppose that A “ tau, B “ tb1, b2u, andC “ tcu. Let gpaq “ b1 , and let f pb1q “ c and f pb2q “ c. Then clearly f
and f ˝ g are onto, but g is not, since b2 is not in its range.

Exercise 36
1. f ˝ g “ px ` 2q2 ` 1 “ x2 ` 4x ` 5

2. g ˝ f “ x2 ` 1 ` 2 “ x2 ` 3

Exercise 37
1. f ` g “ x2 ` 1 ` x ` 2 “ x2 ` x ` 3

2. f g “ px2 ` 1qpx ` 2q “ x3 ` 2x2 ` x ` 2

Exercise 42
a) t´1, 1u

b) tx | ´1 ă x ă 0 _ 0 ă x ă 1u

c) tx | x ă ´2 _ x ą 2u

Exercise 60
a) The number of cells is the value of t128000 ˆ 10{p53 ˆ 8qu “ 3018
b) The number of cells is the value of t300000 ˆ 10{p53 ˆ 8qu “ 7075
c) The number of cells is the value of t1000000 ˆ 10{p53 ˆ 8qu “ 23584

Exercise 61
a) The number of blocks is r150000{1500s “ 100
b) The number of blocks is r384000{1500s “ 256
c) The number of blocks is r1544000{1500s “ 1030
d) The number of blocks is r45300000{1500s “ 30200

Exercise 73
a) This is true since txu is already an integer.

b) This is false since the left side can be an odd number and the right side can be an even number with the same
value of x.

6
 c) This is true. If x is an integer, then tx ` yu “ x ` tyu, therefore the value of the given equation is 0. We also
get the same conclusion when y is an integer. When x and y are not integer, let’s call a is the integer part of
x ` y, so a ă x ` y ă a ` 2 which leads to rx ` ys “ a ` 1 or rx ` ys “ a ` 2. Therefore the given expression
is either 1 or 0.

d) This is false. When x “ 0.5 and y “ 2, the equation becomes 1 “ 2 which is not correct.

e) This is false. When x “ 4, the equation becomes 2 “ 3 which is not true.

Exercise 77
a) • Domain: Z
• Codomain: R
• Domain of definition: Zzt0u
• The set of values for which f is undefined is: t0u
• This is not a total function.

b) • Domain: Z
• Codomain: Z
• Domain of definition: Z
• The set of values for which f is undefined is: H
• This is a total function.

c) • Domain: Z ˆ Z
• Codomain: Q
• Domain of definition: Z ˆ Zzt0u
• The set of values for which f is undefined is: Z ˆ t0u
• This is not a total function.

d) • Domain: Z
• Codomain: Z
• Domain of definition: Z
• The set of values for which f is undefined is: H
• This is a total function.

e) • Domain: Z ˆ Z
• Codomain: Z
• Domain of definition: tpm, nq P Z | m ą nu
• The set of values for which f is undefined is: tpm, nq P Z | m ď nu
• This is not a total function.

7
Section 2.4
Exercise 25
(a) Each digit, 1 and 0, appears once initially, then twice, thrice, and so forth, in increasing order.

(b) The sequence of increasing positive integer. the even number show two times.

(c) The sequence of 2n with n P N and are separated by the digit 0.

(d) The sequence of 3 ˚ 2n với n P N

Exercise 38
řn řn řn řn 3npn`1q
We have k 3 ´ pk ´ 1q3 “ 3k 2 ´ 3k ` 1 ñ 3 k“1 k 2 ´ 3 k“1 k ` 3 k“1 1 “ 3 k“1 k 2 ´ 2 ` n “ n3
řn
ñ k“1 “ 31 pn3 ` 3npn`1q
2 ´ nq “ npn`1qp2n`1q
6

Exercise 43
ś10
(a) i“0 i “ 0 ˚ 1 ˚ ... ˚ 10 “ 0
ś5
(b) i“5 i “ 5 ˚ 6 ˚ 7 ˚ 8 “ 1680

Exercise 44
śn
i“1 i “ n!

Section 2.5
Exercise 12
We just need to find a one-to-one function from A to B to prove that A ď B according to one of the definitions.
f pxq “ x is a function. For every a P A there is only one value f paq “ asuch that a P B. This is true if we
assumed that A Ă B.

Exercise 14
If A and B have the same cardinality, then we have a one-to-one correspondence f : A Ñ B. The function f meets
the requirement of the definition that A ď B, and f ´ 1 meets the requirement of the definition that B ď A.

Exercise 15
If B were countable, say with elements b1 , b2 , ..., then since A Ď B, we can list the elements of A using the
order in which they appear in this listing of B. Therefore A is countable, contradicting the hypothesis. Thus B is
uncountable.

Exercise 16
Let A and B be sets, A is countable and B Ă A, then we can list the elements of B using the order in which they
appear in this listing of A. Therefore B is countable

8
Exercise 30
The number of solutions is countable as long as the number of triples (a, b, c), with a, b, and c integers, is countable.

Exercise 37
The set of all computer programs in a particular language is a subset of the set of all strings over the alphabet.
And the set of all strings is countable so its subset is also countable, which is the set of all computer programs.

Exercise 40
Let T “ ts P S|s R f psqu. We will show that T is not in the range of f . If it were, then we would have f ptq “ T
for some t P S . Now suppose that t P T . Then becauset P f ptq, it follows from the definition of T that t R T ; this
is a contradiction. On the other hand, suppose that t R T . Then because t R f ptq, it follows from the definition of
T that t P T ; this is again a contradiction. This completes our proof by contradiction that f is not onto. On the
other hand, the function sending x to txu for each x P S is a one-to-one function from S to PpSq, so by Definition
2 |S||P pSq|. By the same definition, since |S| = |P(S)| (from what we have just proved and Definition 1), it follows
that |S| ă |P pSq|.

Section 8.2
Exercise 28
phq
a) The associated homogeneous recurrence relation is an “ 2an´1 . We easily solve it to obtain an “ α2n . Next
we need a particular solution to the given recurrence relation. By Theorem 6 we want to look for a function of
the form an “ p2 n2 `p1 n`p0 . (Note that s “ 1 here, and 1 is not a root of the characteristic polynomial.) We
plug this into our recurrence relation and obtain p2 n2 `p1 n`p0 “ 2pp2 pn´1q2 `p1 pn´1q`p0 q`2n2 . We rewrite
this by grouping terms with equal powers of n, obtaining p´p2 ´ 2qn2 ` p4p2 ´ p1 qn ` p´2p2 ` 2p1 ´ p0q “ 0. In
order for this equation to be true for all n, we must have p2 “ ´2, 4p2 “ p1 , and ´2p2 `2p1 ´p0 “ 0. This tells us
that p1 “ ´8 and p0 “ ´12. Therefore the particular solution we seek is appqn “ ´2n2 ´8n´12. So the general
solution is the sum of the homogeneous solution and this particular solution, namely an “ α2n ´2n2 ´8n´12.

b) When a1 “ 4 ñ α “ ´12, so the answer is an “ 13 ˆ 2n ´ 2n2 ´ 8n ´ 12.

Exercise 29
phq
a) The associated homogeneous recurrence relation is an “ 2an´1 . We easily solve it to obtain an “ α2n . Next
we need a particular solution to the given recurrence relation.By Theorem 6 we want to look for a function
of the form an “ c ˆ 3n . We plug this into our recurrence relation and obtain c ˆ 3n “ 2c ˆ 3n´1 ` 3n .We
divide through by3n´1 and simplify, to find easily that c = 3. Therefore the particular solution we seek is
an “ 3n`1 So the general solution is the sum of the homogeneous solution and this particular solution, namely
an “ α ˆ 2n ` 3n`1 .

b) When a1 “ 5 Ñ α “ ´2, so the answer is an “ ´2n`1 ` 3n`1 .