Professional Documents
Culture Documents
MC0063 August 2010 Question and Answers
MC0063 August 2010 Question and Answers
(A-B)={3}
(B-C)={2}
(A-B) (B-C)={(3,2)}
ii.
(B-A)={4}
(C-B)={5}
(B-A) {(4,5)}
iii.
(A B)={2}
A={2,3}
A ( A B ) ={2,3}
n(n + 1)( 2n + 1)
6
Solution:
I.
1.2.3
6
=1
(induction hypothesis)
If n = k+1
12 + 2 2 + 3 2 + ..... + k 2 + ( k +1) 2
LHS
k ( k +1)( 2k +1)
+ (k +1) 2
6
k (k +1)( 2k +1) + 6(k +1) 2
6
( k +1)( k ( 2k +1) + 6( k +1))
6
(k + 1)( 2k 2 + k + 6k + 6))
6
2
( k +1)( 2k 7 k + 6))
6
( k + 1)( 2k 2 + 4k + 3k + 6))
6
( k + 1)( 2k ( k + 2) + 3( k + 2))
6
( k +1)( 2k + 3)( k + 2))
6
(k +1)(( k +1 +1)( 2(k +1) +1)
6
( k +1)(( k + 2)( 2k + 3)
6
RHS = LHS
Hence Proved
Q. 3. Prove that the number of partitions of n in which no integer occurs more
than twice as a part is equal to the number of partitions of n into parts not
divisible by 3.
Solution:
The generating function corresponding to no integer occurs more than twice is
(1 + x + x 2 )(1 + x 2 + x 4 )(1 + x 3 + x 6 )... --------------(1)
The generating function corresponding to no part is divisible by 3 is
(1 x ) 1 (1 x 2 ) 1 (1 x 4 ) 1 .... ------------------(2)
1 x 3 = (1 x ) (1 + x + x 2 )
Q.4. Prove that if S contains more than two elements, then there exist f,
g A(S), such that
f g g f
Solution:
Since S contains more than two elements, take the distinct elements a,b,c S.
Define f:SS by f(a)=f(b)=c,f(c)=a and f(x)=x for all xS\{a,b,c}.Define g: SS
by g(a)=b,g(b)=a, and g(x)=x for all x S\{a,b}. Then f,g are bijections and hence
f.gA(S).Now (gof)(a)=g(f(a))=g(b)=a and (fog)(a)=f(g(a))=f(b)=c . Therefore
(gof)(a)=a c =(fog)(a). This shows that gof fog.
a b(mod m )
Solution:
Suppose a b(mod
and
a b(mod n ) if
m ) and a b(mod n ) .
and only if
of a ' s in x is a multiple of 3}
Solution:
Let t = {a,b} and N={S,A,B}
S is a stating symbol.
a b(mod lcm
( m,n ))
a b(mod lcm
( m,n ))
250
2
=125
|A2|=
250
3
=83
|A3|=
250
5
=50
|A4|=
250
7
=35
| A1 A2 |=
250
=41
2 3
| A1 A3 |=
250
=25
2 5
| A1 A4 |=
250
2 7
| A2 A3 |=
250
=16
5 3
| A2 A4 |=
250
=11
7 3
| A3 A4 |=
250
=417
5 7
| A1 A2 A3|=
=17
250
=8
2 3 5
| A1 A2 A4 | =5
| A1 A3 A4 | =3
| A2 A3 A4 | =2
| A1 A2 A3 A4 | =1
Therefore
| A1 A2 A3 A4 |=125+83+50+35-41-25-17-16-11-7+8+5+3+2-1=193
a n = 2a n 1 an 2 , n 2 ,
given a0 = 3, a1 = 2
2a0x+2a1x ++2an-1x +.
x f(x)=
a0x ++an-2x +.
2
Therefore f(x)-2xf(x)+ x f(x)= a0+(a1 -2a0 )x+(a2 -2a1 +a0 )x ++(an -2an-1 +an-2)x
+=3-8x(since a0=3 , a1 =-2 and an -2an-1 +an-2 =0 for n2)
1
2
(1 x)
(3 8x)
(3 - 8x)
( x y ) ( y z ) ( z x) = ( x y ) ( y z ) ( z x)
( x z) = x
and z x = z,and so
( x y) ( y z) x = ( x y) ( y z) z
a b
is the complement of a b
(a b) ( a b ) =[( a b) a ] [( a b) b ]
=[( a a ) b] [ a (b b )]
= (1 b) (a 1)
=1 1
=1
Also
(a b) ( a b ) =[( a b) a ] [( a b) b ]
=[( a a ) b] [ a (b b )]
= ( 0 b ) ( a 0)
=0 0
=0
a b
is the complement of a b
(a b) ( a b ) = [( a (b a )] [b (a b ]
= [( a a ) b] [a (b b )]
= (1 b) (a 1)
=1 1
=1
Also
(a b) ( a b ) =[( a b) a ] [( a b) b ]
=[( a a ) b] [ a (b b )]
= ( 0 b ) ( a 0)
=0 0
=0
Given a string of symbols on the tape, a Turing machine starts at the initial state.
At any state it reads the symbol under the head, either erases it or replaces it with a
symbol(possibly the same symbol). It then moves the head to left or right or does
not move it and goes to the next state which may be the same as the current state.
One of its states is the halt state and when the Turing machine goes into the halt
state, it stops its operation.
Input(X)
a
b
a
Move((q,X))
(q1, , R )
(q2,a,R)
(q3,b,R)
(q3,a,R)
(h, , s )
A transition diagram of this Turing machine is given below. It is assumed that the
tape has at the left end and the head is initially at the left end of the tape
G = 0
0
1
0
0
1
0
1
1
0
1
1
1 0 0 1 1 0
G=[I | A],where I = 0 1and
3 0 A= 0 1 1
0 0 1 1 0 1
3
(i) E(110)=[110]
0
0
1
0
0
1
0
1
1
0
E(010)=[010]
0
0
1
0
0
1
0
1
1
0
1 =[110101]
1
and
1 =[010011]
1
(ii)
(iii)
0 1 1 0 0
1 0 0 1 0
1 1 0 0 1
H[110110] = 1
0 1 1 0 0
1 0[110110]
010
1 1 0 0 1
T =
0
1 .
1
We can observe that this matrix is identical with the second column of H.
Therefore we change the second component in r (from 1 to 0) to get the
code word c=100110. The first three components of this code word gives
the original message w=100.
H[111101] = 1
0 1 1 0 0
1 0[111101]
010
1 1 0 0 1
T =
1
0 .
1
We can observe that this matrix is identical with the third column of H.
Therefore we change the third component in r (from 1 to 0) to get the
code word c=110101. The first three components of this code word gives
the original message w=110