Académique Documents
Professionnel Documents
Culture Documents
1. (b) For n = 1,
72n + (23n − 3)(3n − 1) = 72 + (20) (30) = 49 + 1
= 50 which is divisible by 25.
∴ Result is true when n = 1
Now, let the result be true for n = k, we have
72k + (23k − 3)(3k − 1) is divisible by 25.
For n = k + 1 expression becomes
72(k + 1) + (23(k + 1) − 3)(3(k + 1) − 1) = 72k + 2 + 23k . 3k = 72k . 72 + 23k − 3 . 3k − 1 . 8 . 3
= 72k . 49 + 24 . 23k − 3 . 3k − 1
= (50 − 1)72k + (25 −1)23k − 3 3k − 1
= 50 . 72k + 25 . 23k − 3 . 3k − 1 − 72k − 23k − 3 . 3k − 1
= 50 . 72k + 25.23k − 3 . 3k − 1 − (72k + 23k − 3 3k − 1)
First and Second term is multiple of 25 and last term is divisible by 25 from inductive
hypothesis. Therefore, expression is divisible by 25.
Hence the result is true for n = k + 1. ∴ It is true for all n.
1. (c) Let the total number of professors be 100.
Let A be set of professors playing tennis
B be set of professors playing bridge
C be set of professors jogging
From given data, ∴ | A | = 60 | B | = 50 | C | = 70
| A ∩ B | = 20 | A ∩ C | = 30 | B ∩ C | = 40
| A ∪ B ∪ C | = 100 i.e., 100% are playing all games.
∴ by the principle of inclusion and exclusion, we have
|A∪BUC| =|A|+|B|+|C|−|A∩B|−|A∩C|-|B∩C|+|A∩B∩C|
100 = 60 + 50 + 70 − 20 − 30 − 40 + | A ∩ B ∩ C |
∴ | A ∩ B ∩ C | = 10
∴ The percentage of professors playing tennis, bridge and jogging are 10%.
If someone is claming that 20% of the professors jog and play bridge and tennis
I do not believe this claim.
(2) Vidyalankar : S.E. − DS
1. (d) p ∨ ¬ ( p ∧ q)
⇒ p ∨ (p∨q )
⇒ (p ∨ p ) ∨ q
⇒ T∨ q
⇒ T
1 2 3 4 5
1 1 1 1 1 1
2 0 1 0 1 0
3 0 0 1 0 0
4 0 0 0 1 0
5 0 0 0 0 1
R can be expressed as the collection of ordered pairs.
R = {(a, b) | a R b} iff b is multiple of a.
R = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (2, 2), (2, 4), (3, 3), (4, 4), (5, 5)}
and digraph of R is
1 3
1 2 3 4 5
In−degrees 1 2 2 3 2
Out−degrees 5 2 1 1 1 5 4
2. (d) (i)Groupoid :
Let ‘G’ be a non empty set and ‘∗’ be a binary operation then the algebraic system (G,
∗) is called groupoid.
OR
Let ‘G’ be a non empty set, then the system (G, ∗) is said to be groupoid if it follows
closure axiom.
e.g. (N, +) (N, .) (I, +)
(I, −), (I, .) are the groupoids.
Closure axiom : ∀ a, b ∈ G ⇒ a ∗ b ∈ G
(4) Vidyalankar : S.E. − DS
(iii)Monoid :
An algebraic system (G, ∗) is said to be a monoid if it satisfies
i) closure axiom
ii) associativity
iii) existence of an identity element.
Identity element : ∀ a ∈ G ∃ an element ‘e’ such that a ∗ e = a = e ∗ a then e is
called identity element w.r.t. operation ‘*’
eg. 4∈N
4+e =4=e+4
⇒ e = 0 (identity element) but 0 is not an element of set of natural number hence
(N, +) is not the monoid.
and (I, +) is a monoid
(I, . ) is a monoid.
Commutativity : ∀ a, b ∈ G ⇒ a*b=b*a
(I, +) , (R, +), (C, +), (R − {0}, ⋅) and (R+, ⋅) are Abelian groups.
3. (a) R ⊆ A × A
R = { (a, b) ∈ A × A | a and b both belong to same Ai }
(i) (x, x) ∈ R for x ∈ Ai ; since both element in this pair are same, therefore they are in
the same block. So therefore ‘R’ is reflexive.
(ii) Let (x, y) ∈ R
⇒ x and y ∈ Ai for any i
⇒ (y, x) ∈ Ai ∴ R is symmetric
(iii)Let (x, y) ∈ R, (y, z) ∈ R
⇒ x, y belongs to some one Ai & y, z belongs to some one Aj
⇒ y ∈ Ai and Aj both.
∵ Ai ∩ Aj = φ if i ≠ j
∴ Ai = Aj
⇒ x, z belong to same Ai
⇒ (x, z) ∈ R
∴ R is transitive
∴ R is an equivalence relation.
Let R be an equivalence relation on a set A and let us denote by [a], the equivalence
class determined by the element a, then (i) a ∈ [a] (ii) a ∈ [b] ⇔ [a] = [b],
Prelim Question Paper Solutions (5)
(iii)The equivalence classes determined by two elements are either disjoint or identical.
i.e. either [a] ∩ [b] = φ or [a] = [b].
x y
R (domain) R (codomain)
Consider an arbitrary element y in R (codomain)
Let y = f (x)
y = 2x − 3
or y + 3 = 2x
y+3
or x =
2
⇒ ∀ y ∈ R (codomain) ∃ pre image x ∈ R (domain)
⇒ Range of f = codomain
⇒ f is surjective
∵ f is injective and surjective both
∴ f is bijective.
∴ f−1 exists.
y = f (x) ⇒ x = f−1 (y)
Prelim Question Paper Solutions (7)
y = 2x − 3
y+3
x = = f −1(y)
2
∴ The rule for f−1 is
x+3
f−1(x) =
2
∀ a∈Z
+
4. (b) (i) Reflexive : ∵ a|a
∴ a R a ∀ a ∈ Z+
⇒ | is reflexive.
(ii) Antisymmetric : Let a R b and b R a
⇒ a|b&b|a
⇒ a = b ∀ a, b ∈ Z+
⇒ | is antisymmetric.
(iii)Transitive : Let a R b and b R c
⇒ a|b & b|c
⇒ a|c
⇒ aRc
⇒ | is transitive.
∴ | is partial order relation on Z+.
∴ (Z+, | ) is a poset.
4. (c) (i) 30
15
6 10
2 3 5
Nonlinearly Ordered
1
60
(ii) 12 30
6
10
4 15
3 5
2
1
Nonlinearly Ordered
(8) Vidyalankar : S.E. − DS
4. (d) 1
a, b, c ∈ L
a ∨ (b ∧ c) = a ∨ 0
b d
=a
(a ∨ b) ∧ (a ∨ c) = b ∧ d = a
⇒ a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c)
a c a ∧ (b ∨ c) = a ∧ 1 = a
(a ∧ b) ∨ (a ∧ c) = a ∨ 0 = a
⇒ a ∧ (b ∨ c) = (0 ∧ b) ∨ (a ∧ c)
0 ⇒ Lattice is distributive lattice
LHS = a ∧ (a′ ∨ b)
= (a ∧ a′) ∨ (a ∧ b) ∵ L is distributive
= 1 ∨ (a ∧ b) ∵ L is bounded
= a∧b
= RHS
The graphs G1 and G2 are not isomorphic because under any isomorphism the vertex V3
of degree 4 must correspond to vertex U6 of degree 4 and the vertex V7 of degree 3 must
correspond to vertex U7 of degree 3, but V3 & V7 are non−adjacent whereas U6 & U7 are
adjacent.
5. (b) (i) Yes, every complete graph on odd number of vertices ≥ 3 is both Eulerian as well as
Hamiltonian.
1 2
5 4 3
This graph is neither Eulerian nor Hamiltonian.
Prelim Question Paper Solutions (9)
5. (d)
Consider the mapping
f : (c, +) → (R+, .) defined by
f(a + ib) = 2a . 3b, a + ib ∈ C
(i) Let a + ib, c + id ∈ C
f(a + ib) = f(c + id) ⇒ 2a . 3b = 2c . 3d
⇒ a = c and b = d
⇒ a + ib = c + id
∴ f is injective.
⇒ a+e−1 = a
⇒ e−1 = 0
⇒ e = 1.
∴ 1 is identity in I w.r.t. ⊕ .
(iv) Inverse :
For a ∈ I ∃ α ∈ I such that
a ⊕ α = 1 (identity element)
a+α−1=1
α=2−a ∈I
∴ all the elements of I are invertible w.r.t. ⊕ .
(v) Commutativity :
a ⊕ b = a + b −1
= b+a−1
= b⊕a
∴ ⊕ is commutativity.
∴ (I, ⊕) is an abelian group.
2. Consider (I, )
(i) Closure prop. :
Let a, b, ∈ I
a + b ∈I & ab ∈ I ( ∵ ordinary multiplication & addition are binary operations in
I)
a + b − ab ∈ I
⇒ ab∈I
∴ Closure prop. is satisfied.
(ii) Associativity :
Let a, b, c ∈ I
a (b c) = a (b + c − bc) by def.
= a + (b + c − bc) − a(b + c − bc) by def.
= a + b + c − abc − ab − ac + abc
= (a + b − ab) + c − c(a + b − ab)
= (a b) + c − c (a b) by def.
= (a b) c by def.
∴ is associative.
∴ (I, ) is semi group.
3. Distributive Law :
a (b ⊕ c) = a (b + c − 1) by def.
= a + (b + c −1) − a (b + c −1) by def.
= 2a + b + c − ab − ac − 1 (1)
∴ (a b) ⊕ (a c) = (a + b − ab) ⊕ (a + c − ac) by def.
= 2a + b + c − ab − ac − 1 by def. (2)
From (1) and (2), we get,
a (b ⊕ c) = (a b) ⊕ (a c)
4. Commutativity
a b = a + b − ab
= b + a − ba
= ba
∴ is commutative.
Prelim Question Paper Solutions (13)
5. Identity w.r.t. .
∀ a ∈ I ∃ e such that
ae = a
a + e − ae = a
e − ae = 0
e (1 − a) = 0
e = 0.
⇒ 0 is identity w.r.t. .
∴ (I, ⊕, ) is commutative ring with identity.
7. (b) We have B3 = {000, 001, 010, 011, 100, 101, 110, 111}
Let e (000) = 000 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [0 0 0 ] 0 1 1
1 1 1
= [000]
⇒ x1 = x2 = x3 = 0
e (001) = 001 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [0 0 1 ] 0 1 1
1 1 1
= [111]
⇒ x1 = x2 = x3 = 1
e (010) = 010 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [0 1 0 ] 0 1 1
1 1 1
= [011]
⇒ x1 = 0, x2 = 1, x3 = 1
e (011) = 011 x1 x2 x3
(14) Vidyalankar : S.E. − DS
1 0 0
[x1 x2 x3 ] = [0 1 1 ] 0 1 1
1 1 1
= [100]
⇒ x1 = 1, x2 = 0, x3 = 0
e (100) = 100 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [1 0 0 ] 0 1 1
1 1 1
= [100]
⇒ x1 = 1, x2 = 0, x3 = 0
e (101) = 101 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [1 0 1 ] 0 1 1
1 1 1
= [011]
⇒ x1 = 0, x2 = 1, x3 = 1
e (110) = 110 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [1 1 0 ] 0 1 1
1 1 1
= [1 1 1]
⇒ x1 = x2 = x3 = 1
e (111) = 111 x1 x2 x3
1 0 0
[x1 x2 x3 ] = [1 1 1 ] 0 1 1
1 1 1
= [000]
⇒ x1 = x2 = x3 = 0
Hence e : B3 → B6 is defined as
e (000) = 000000
e (001) = 001111
e (010) = 010011
e (011) = 011100
e (100) = 100100
e (101) = 101011
e (110) = 110111
e (111) = 111000
7. (c) x2 = 4x + 5 ⇒ x2 − 4x −5 = 0
x2 − 5x + x − 5 = 0
x (x − 5) + 1(x − 5) = 0 (x + 1) (x − 5) = 0
x = −1 & x = 5
an = u ( −1) + v ( 5 )
n n
∴
Prelim Question Paper Solutions (15)
Put n = 1
∴ a1 = − u + 5v ⇒ −u + 5v = 2 …(1)
Put n = 2
∴ a2 = u + 25v ⇒ u + 25v = 6 …(2)
30 v = 8
∴ v = 4/15
∴ −u + 4/3 = 2
4 2
∴ u = −2=−
3 3
2 n 4
− ( −1) + ( 5 )
n
an =
3
15