This preview shows pages 1–4. Sign up to view the full content.
*
This is a closed book, closed notes examination.
*
The numbers in parentheses after each question is the number of points allocated to that
question.
*
Write your answers on the examination paper in ink or
legible
pencil.
If your answer cannot be read or understood, or if your
answer is vague or confused, it will be marked wrong.
*
NAME (
Print
Legibly. All
Capitals
):
PLEDGE (
Write Out In Full And Sign
):
CS202  D
ISCRETE
M
ATHEMATICS
S
EMESTER
E
XAMINATION
2
F
ALL
2007
Time Limit  Seventy Five Minutes
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document Page 1
Department of Computer Science
CS 202
University of Virginia
Page score
1. Prove by
induction
that: (10 pts)
2. A real number
r
is rational if there are integers
p
and
q
with
q
≠
0 such that
r
=
p/q
. Prove
using a
direct proof
that if
r
and
s
are rational then
r
+
s
is rational. (10 pts)
3. Prove using a proof by
contradiction
that for any integer
n
, if 3
n
+ 2 is odd, then
n
is odd.
(10 pts)
r
i
i
0
=
n
∑
r
(
n
1
+
1
)
r
1
–
()
⁄
–
=
Page 2
Department of Computer Science
CS 202
University of Virginia
Page score
4. How many
total
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 10/10/2009 for the course CS 2102 taught by Professor Knight during the Spring '08 term at UVA.
 Spring '08
 KNIGHT

Click to edit the document details