CS 390 Solutions to Unit 2 Exercises
p. 32 - 39
1.1 (a) {
i
is a natural number}
(e) Let use call this set S. S can be defined recursively as follows:
Basis Clause:
.
Inductive Clause: For any set
, if
, then
.
Extremal Clause: Nothing is in
unless it is obtained by a finite number of applications
of the Basis and Inductive Clauses.
can also be defined as
, where
is
the set of natural numbers.
1.4 (b)
=
=
by De Morgan
=
by distribution
=
since
.
(e)
by De Morgan
=
because
and
.
1.7 (a)
1.8 (f)
D1 = {x | x < 1 and x is a real number}.
D2 = {x | x < 1/2 and x is a real number}.
Hence
.
D3 = {x | x < 1/3 and x is a real number}.
Hence
. Hence
.
...
In general
for any natural number
that is greater than 0.
Hence
.
1.53 (a)
is the set of subsets of
. If neither A nor B is empty
and if they are not equal,
then there are sets among them which consist of a mixture of elements of
and elements
of
. On the other hand
is the set of subsets of
and
subsets of
. Hence there are no sets in
which contain elements of
as well as those of
unless those elements are in
.
Since a subset of
(
) is also a subset of
,
is
a subset of
.