Name: NPM: Class:

Assignment 4: Proof Methods to Sets

Discrete Mathematics CSF1600100
Instructions:
1. This assignment is due Friday November 30 at 4:00 p.m. Please submit your work
at academic secretariat, Fasilkom UI. Do not forget to write your identity on the space
provided.
2. To save paper, you may print and reproduce this assignment on both sides.
3. Your answers should be handwritten. You may use: HB or 2B pencil, or pen with blue
or black ink.
4. Try to write your answer in English. You may ask teaching assistants to help translating
your answer from Bahasa Indonesia to English, but you should not ask them to give
the solution of any problem in this assignment.
5. Write your solutions on the space provided. If you need more space, you may use
additional A4 papers and attach them to your assignment.
6. Be neat and write legibly. You will be graded not only on the correctness of your
answers, but also on the clarity with which you express them.
7. This assignment consists of 8 problems. Problem 1 worth 20 points, 2, 5, 6, 7, 8 worth
10 points each while problem 3, 4 worth 15 points each.
8. You may contact your teaching assistant whenever you have diculty understanding
the problems.
9. Please retain yourself from copying answers from elsewhere without understanding the
steps. This assignment is an individual evaluation.
10. Important: late submission without reasonable explanation will not be graded.
page 1 of 6
PROOF METHODS
Problem 1 (5pts each) Check the truth value of the following statements and prove
your answer:
a. For every integer n, n + 1 is odd if and only if n
2
1 is odd.
b. Among the 25 students in Discrete Mathematics class, there will be at least 3 students
whose birthday in the same month.
c. For every integer n, if n is odd then n
2
1 is divisible by 4.
d. For every x R, if x > 0 then x +
1
x
_ 2.
page 2 of 6
Name: NPM: Class:
MATHEMATICAL INDUCTION
Problem 2 (10pts) Determine the smallest positive integer n that makes the inequality
2n + 3 < 2
n
is hold! Prove your answer.
Problem 3 (15pts) Prove that 3
2n
1 is divisible by 8 for every integer n _ 0.
Problem 4 (15pts) Suppose that a sequence a
n
is dened as
a
n
= 2a
n1
+ a
n2
; for n _ 2 where a
0
= 1 and a
1
= 3.
Prove that a
n
is always an odd number for every n _ 0.
page 3 of 6
FUNCTIONS
Problem 5 (5pts each) Suppose that A and B are two sets. A function f : A B is
injective (one to one) if and only if every element a dom(f) is mapped to a unique
element of B. A function f : A B is surjective (onto) if and only if every element b B,
there is a dom(f) that satises f (a) = b (dom(f) denotes the domain of function f).
Using the two denitions above, determine the truth value of following statements and
prove your answer!
a. If f; g : R R and both of them are injective, then f + g is injective also.
b. If f; g : R R and both of them are surjective, then f + g is surjective also.
Problem 6 (5pts each) The oor function :::| : R Z maps the real number x to
integer n where n _ x < n + 1. The ceiling function :::| : R Z maps the real number
x to integer n where n < x _ n + 1. Determine the truth value of these statements and
prove your answer!
a. For every x R, 2x| = 2x|.
page 4 of 6
Name: NPM: Class:
b. For every x R, 2x| = 2x|.
SETS
Problem 7 (2pts each) Given the universal set S = a; b; c; d; e, a set A = a; b; c, a
set b = b; c; d, and a set C = b; c; e. Determine:
a. A ' B ' C
b. (A B C)
C
, where X
C
denotes the complement of a set X with respect to uni-
versal set S.
c. (A B) C, where X Y denotes the dierence of X and Y .
d. A (B C)
e. (A B) C, where X Y is dened as a set (X ' Y ) (X Y ).
page 5 of 6
Problem 8 (2.5pts each) Given the universal set Z. For every non-negative integer k,
a set A
k
is dened as
A
k
= 2k; 2k + 2; 2k + 4; :::
Determine the following sets:
a.
2012
'
k=1
A
k
b.
2012

k=1
A
k
c.
1
'
k=1
A
k
d.
1

k=1
A
k
page 6 of 6