Name: Sudeep Sharma

Roll Number: 510818304

Learning Centre: 2882

Subject : Discrete Mathematics

Assignment No.: MC0063 – 01

Date of Submission at the learning centre:

31/05/2008

Faculty Signature:
 MC0063-01

DISCRETE MATHEMATICS

Question.1- If f(x)=1\1+x find f(f(f(x)))

Ans- f(f (x)=f(1\1+x)
1\1+1\1+x
= 1+x\1+x+1
= 1+x\x+2
f(f( f(x)) )=f(1+x\x+2)
=1\1+(1+x)\(x+2)
=(x+2) \ (x+2+1+x)
=(x+2)\(2x+3)
hence f (f (f (x ) ) )=(x+2)\(2x+3)

Question.2- Prove by mathematical induction

1\2 .5 + 1\ 5 . 8 +1\ 8 . 11 +……….+ 1\(3n-1) (3n+2) =n\6n+4
Ans - Assuming the result to be true for n=m
1\ 2 . 5 +1\ 5 . 8 + 1\ 8 . 11 +………..+ 1\( 3m-1) (3m+2) =m\6m+4
Adding (m+1)th term ,viz, 1\(3m+2) (3m+5) to both sides.
We have,
1\ 2 . 5 + 1\ 5 . 8 +1\8 . 11 + ……….+1\( 3m+2) (3m+5)
=m\6m+4 +1\( 3m +2) (3m + 5)
=m(3m +5) +2\2(3m+2) (3m+5)
= 3m 2 +5m +2 \2 ( 3m+2) (3m+5)
= (m+1) (3m+2 )\ 2 (3m+2) ( 3m+5)
=m+1\6m+10
This is the value of n\6n+4 when m+1 is substituted for n
Therefore the proposition is true for all +ve integer values of n.

Question 3. Find the number of different letter arrangements can be

formed using the word “MISSISSIPPI” .
Ans: Total number of letters n=11
Number of M’s = 1
Number of I’s =4
Number of S’s =4
Number of P’s = 2
Therefore the required number of permutations is 11!\1! 4! 4! 2!
=34650

2
Question 4. Prove that a function f has an inverse if and only if f is one-one and on
to.
Ans. If a function f : A B is one-one and onto then the inverse of f
denoted by
f-1 : B-A is defined by f-1 = { ( y ,x) : (x , y) ∈ f}
Thus if f : A  B is both one-one and onto then f-1 : B  A is
obtained
by reversing the ordered pair of f.
Example- Let Q be the set of rational. If f : Q  Q defined by f ( x)
= 2x-3 for every x ∈ Q then if f-1 is exists
Let f(x1 ) = f (x2)
= 2x1-3 = 2x2-3
= x1 = x2
Let y ∈ Q . Then to find x Q : f( x ) =y
i.e 2x-3 = y Therefore x=(y+3)\2
Whenever y is rational , x=(y +3 )\2 is also rational.
Hence there exists (y+3) \2 ∈ Q such that f(y+3)\2=y
Hence f is onto . Therefore f_1 : Q  Q exists.

Question 5. Prove that a≡ b (mod m) and a≡b (mod n) if and only

if a≡b (mod lcm (m,n))
Ans. Suppose a≡b ( mod m) and a≡b ( mod n) . this means m| a-b and n |a-b
.
That is, (a-b) is a common multiple of m and n.
But l = lcm (m,n) is the least common multiple of m and n.
Therefore ( a-b) is a multiple of l. That is l | a-b .
This means a≡b ( mod lcm (m,n)).
Converse : Suppose a≡b ( mod lcm (m,n) ) and say l = lcm ( m,n).
This implies l | a-b and m | l, n | l. Therefore m |a-b and n | a-b.
Hence a≡b (mon m) and a≡b ( mod n).

Question 6. Construct a grammar for the language .

L = { aaaa, aabb, bbaa, bbbb}
Ans. Since L has a finite number of strings , we can list all strings in
the language .
Let VT= {a,b} be the set of terminals.
VN ={S}, non terminal (starting symbol)
Productions: S aaaa
Saabb
Sbbaa
Sbbbb
We simplify the [productions of follows.
Let VN = {S, A}
Ф : S  AA , A aa, A bb.
Therefore the Grammar G = ( VT ={ a,b}, VN ={S,A}, S, Ф )