This preview shows page 1. Sign up to view the full content.
Sets and Logic
MHF3202
SeLoC
Prof. JLF King
31Dec2009
C1:
Essay, on your own paper, triplespaced. Please prove:
±
²
³
´
Thm
:
There are
∞
ly many prime numbers.
Start with.
. .
Proof:
FTSOContradiction, suppose
p
1
<
p
2
<
···
<
p
k
<
···
<
p
L

1
<
p
L
*
:
is a list of
all
prime numbers. I will now produce a
prime
q
which
diﬀers
from every member of (
*
), as
follows.
(
Continue your proof from here.
)
Short answer.
For
(C2)
and
(C3)
, show no work;
please ﬁllin each blank on the problemsheet.
C2:
Please write
DNE
in a blank if
the described object does
not exist or if the indicated operation cannot be performed.
z
Prof. King believes that writing in com
plete, coherent sentences is crucial in communicating
Mathematics, improves posture, and whitens teeth.
±
²
³
´
Circle one:
True!
Yes!
wH’at S a?sEnTENcE
a
Repeating decimal 0
.
1
14 equals
n
d
, where posints
n
⊥
d
are
n
=
..............
and
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 01/26/2012 for the course MHF 3202 taught by Professor Larson during the Fall '09 term at University of Florida.
 Fall '09
 LARSON

Click to edit the document details