Anda di halaman 1dari 1

Discrete Mathematics - Assignment 3

Deadline: October 7th , 2016, 5PM


Maximum marks: 30
1. (3 marks) Prove that, the set of all possible passwords of any length is countable. Assume
that a password may contain any capital or small letters, digits and a finite number of special
characters.
2. (3 marks) Prove that there exists a bijective mapping between the sets: (0,1) and (0,1].
3. (3 marks) Prove by Mathematical Induction principle: Any finite set of n elements has 2n
subsets.
4. (3 marks) Prove using well ordering principle that the strong induction principle holds for
any statement on natural numbers.
5. (3 marks) Let the function f(n) on any natural number n is defined as follows: f(1) = 3, f(2)
= 1 and for all n 3, f(n) = (f(n 1))2 + f(n 2). Prove that all natural numbers generated
by this function are even.
6. (1+2 marks) Give a recursive definition of the set of all integers divisible by 5. Using
structural induction, prove that all the elements of your defined set are divisible by 5.
7. (3+1 marks) Let N be the set of natural numbers. For x N, rem(x, n) denotes the remainder
of a divided by n. Let R = {(a, b) | rem(a, 5) = rem(b, 5), and a, b N} be a relation. Prove
that R is an equivalence relation. What are the distinct equivalence classes in N.
8. (2+2 marks) Let R be a reflexive relation on a set A. Show that Rn is reflexive for all
positive integers n. Let R be a symmetric relation on a set A. Show that Rn is symmetric for
all positive integers n.
9. (2+1+1 marks) Prove that the set of all integers I alongwith the relationship '>=' is a poset. Is
it a totally ordered set? Is it a well-ordered set or a lattice?