XII Maths DPP (03) - Prev Chaps + Mathematical Reasoning
XII Maths DPP (03) - Prev Chaps + Mathematical Reasoning
XII Maths DPP (03) - Prev Chaps + Mathematical Reasoning
1. If p : Ram is tall
q : Ram is intelligent
then the symbolic statement ~p q means
;fn p : jke yEck gSA
q : jke cqf}eku gSA
rks dFku ~p q dk vFkZ gSµ
(A*) Ram is not tall or he is intelligent (B) Ram is tall or he is intelligent
(C) Ram is not tall and he is intelligent (D) Ram is not tall then he is intelligent
(A*) jke yEck ugh gS vkSj og cqf}eku gSA (B) jke yEck gS ;k og cqf}eku gSA
(C) jke yEck ugh gS vkSj og cqf}eku gSA (D) jke yEck ugh gS rc og cqf}eku gSA
Sol. ~p : Ram is not tall Use '' symbol for or
So ~p q means = Ram is not tall or he is intelligent
Hindi. ~p : jke yEck ugh gS '' dk iz;ksx ';k' ds fy;s djus ij
vr% ~p q dk vFkZ gS % jke yEck ugh gS ;k og cqf}eku gSA
2. Let f : R 0 , defined by f(x) = tan–1 (x2 + x + a), then the set of values of 'a' for which f is onto is
2
ekuk f : R 0 , esa ifjHkkf"kr f(x) = tan–1 (x2 + x + a) gks, rks 'a' ds ekuksa dk leqPp;] ftlds fy, f
2
vkPNknd gS] gSa&
1 1
(A) [0, ) (B) , (C*) (D) (0 , )
4 4
2 2
1 1 1 1
Sol. f(x) = tan–1 x a – Range is 0, x a – 0
2 4 2 2 4
for onto function vkPNknd Qyu gksus ds fy,
a = 1/4
Page # 1
3. Domain of the function f(x) = log sin 1 x 2 3x 2 is
3 5 3 5
(A) (–, –2) (–1, ) (B) ,
2 2
3 5 3 5
(C*) , 2 1, (D) none of these
2 2
Qyu f(x) = log sin 1 x 2 3x 2 dk izkUr gS&
3 5 3 5
(A) (–, –2) (–1, ) (B) ,
2 2
3 5 3 5
(C*) , 2 1, (D) buesa ls dksbZ ugha
2 2
Sol. defined for sin–1 x 2 3x 2 0 x 2 3x 2 0 true for all x.
also – 1 x 2 3 x 2 1 Here x2 + 3x + 2 0 or x2 + 3x + 1 0
–3 – 5 –3 5 – 3 – 5 –3 5
(x + 1) (x + 2) 0 or x Ans. ,– 2 – 1,
2 2 2 2
tan 1 x
5. The domain of the function f(x) = sin 1 log3 x is
x 2 5x 6
tan 1 x
Qyu f(x) = sin 1 log3 x dk izkUr gSa&
x 2 5x 6
(A) [1, 3] (B) [1, 3) (C) [1, 2) (2, 3] (D*) [1, 2)
Sol. sin–1 (log3x) 0 0 log3x 1 1x3 ......(i)
for tan–1x, x R .....(ii) tan–1x ds fy, x R .....(ii)
For x 2 5x 6 ds fy, , x2 – 5x + 6 > 0
(x – 2) (x – 3) > 0
(–, 2) (3, ) ......(iii)
(i) (ii) (iii)
Df = [1, 2)
sec 1 x
6. The domain of function f(x) = , where [ . ] is greatest integer function.
x [ x]
sec 1 x
Qyu f(x) = , dk izkUr gS] tgk¡ [ . ] egÙke iw.kk±d Qyu gS&
x [ x]
(A*) R – {(–1, 1) (n, n )} (B) R – (–1, 1)
(C) R+ – (0, 1) (D) R – (n, n )
Page # 2
Sol. For sec–1x be defined x 1 and x –1 ...(i)
x – [x] > 0 x > [x] [x] < x
x R – {x } ....(ii)
from (i) and (ii) Df = R – {(–1, 1) (n, n )}
Hindi. sec–1x ifjHkkf"kr gksus ds fy, x 1 vkSj x –1 ...(i)
x – [x] > 0 x > [x] [x] < x
x R – {x } ...(ii)
(i) vkSj (ii) ls Df = R – {(–1, 1) (n, n )}
1
7. Let f(x) = sin23x – cos22x and g(x) = 1 + tan–1 x , then the number of values of x in interval [–
2
10,20] satisfying the equation f(x) = sgn(g(x)), is
(A) 6 (B) 10 (C*) 15 (D) 20
1
;fn f(x) = sin23x – cos22x vkSj g(x) = 1 + tan–1 x , rc lehdj.k f(x) =sgn(g(x)) ds gyksa dh la[;k gksxh tks
2
[–10,20] ds vUrjky esa gks &
(A) 6 (B) 10 (C*) 15 (D) 20
Sol. sgn(g(x)) = 1 so
sin23x – cos22x = 1 x = 2n +
2
8. Consider the statement p; 'New Delhi is a city'. Which of the following is not negation of p?
dFku p; 'ubZ fnYyh ,d 'kgj gS' dk udkjkRed fuEu esa ls dkSulk gSA
(A) New Delhi is not a city (B) It is false that New Delhi is a city
(C) It is not the case the New Delhi is a city (D*) None of these
(A) ubZ fnYyh ,d 'kgj ugh gS (B) ;g vlR; gS fd ubZ fnYyh ,d 'kgj gS
(C) ,slk ugh gS fd ubZ fnYyh ,d 'kgj gS (D*) buesa ls dksbZ ugh
Sol. All the statements in (a), (b) and (c) are equivalent and each is the negation of p
Hindi. lHkh dFku ¼fodYiksa (a), (b) ,oa (c) esa) rqY; gS rFkk izR;sd p dk udkjkRed gSA
1 1
9. The range of the function f(x) = sin–1 x 2 + cos–1 x 2 , where [ . ] is greatest integer function.
2 2
1 1
Qyu f(x) = sin–1 x 2 + cos–1 x 2 , ¼tgk¡ [ . ] egÙke iw.kk±d Qyu gS½ dk ifjlj gS&
2 2
1
(A) , (B) 0, (C*) {} (D) 0,
2 2 2
2 1 2 1 2 1
Sol. x 2 = x – 2 1 = 1 + x – 2
1 2 1
for domainizkUr ds fy, x 2 – = 0, – 1 x 2 = 1, 0
2
f(x) = sin (1) + cos (0)
–1 –1
or ;k f(x) = sin (0) + cos–1 (–1)
–1
Page # 3
11. Range of the function f(x) = sin 1 | sin x | cos 1 | cos x | is
(A*) {0}
(B) 0, / 2
(C) 0, (D) None of these
1 1
Qyu f(x) = sin | sin x | cos | cos x | dk ifjlj gS&
(A*) {0}
(B) 0, / 2
(C) 0, (D) buesa ls dksbZ ugha
Sol. sin |sin x| cos |cos x|
–1 –1
1
– x2 + x 1
4
1 1
sin–1 sin–1 (x2 + x) sin–1 1 – sin–1 sin–1 (x2 + x)
4 4 2
0 < sin–1 (x2 + x) (for n (sin–1 (x2 + x)) to be defined)
2
– < n (sin–1 (x2 + x)) n
2
Range of f(x) = , n
2
1
Hindi. x R ds fy, f}?kkr O;atd x2 + x ,
4
sin (x + x) ifjHkkf"kr gksus ds fy,
–1 2
1
– x2 + x 1
4
1 1
sin–1 sin–1 (x2 + x) sin–1 1 – sin–1 sin–1 (x2 + x)
4 4 2
0 < sin–1 (x2 + x) (for n (sin–1 (x2 + x)) ifjHkkf"kr gksus ds fy,)
2
– < n (sin–1 (x2 + x)) n
2
f(x) dk ifjlj = , n
2
a2 a3
13. If sin1 a – ... cos1(1 b b2 ...) / 2 , then the value of 'a' and 'b' may be
3 9
1
(A) a = –3 & b = 1 (B*) a = 1 & b = –1/3 (C) a = 6 & b (D) None of these
2
a2 a3
;fn sin1 a – ... cos1(1 b b2 ...) / 2 gks] rks 'a' vkSj 'b' ds eku gks ldrs gSa&
3 9
1
(A) a = –3 & b = 1 (B*) a = 1 & b = –1/3 (C) a = 6 rFkk b (D) buesa ls dksbZ ugha
2
Page # 4
a 1
Sol. sin–1 + cos–1 1– b 2
1 a
3
3a 1
Only (B) satisfy.
3 a 1– b
3 11
14. The v alue of sin – 1 + cos
–1
+ cot
–1
3 is
73 146
5 17 7
(A*) (B) (C) (D) None of these
12 12 12
3 11
sin – 1 + cos
–1
+ cot
–1
3 dk eku gS &
73 146
5 17 7
(A*) (B) (C) (D) bues a ls dks b Z ugha
12 12 12
3 11
Sol. sec – 1 + cos
–1
+ cot
–1
3
73 146
3 5
= tan – 1 + tan – 1 +
8 11 6
3 5
73
tan – 1 8 11 + /6 = tan – 1 + /6
1– 15 73
88
5
= /4 + = Ans.
6 12
2 1 2 5
15. If = tan – 1 – tan – 1 and = tan - 1 (3) – sin – 1 , then cot ( – )
2 – 1 2 5
(A) is equal to 1 (B) is equal to 0 (C) 0 (D*) is non existent
2 1 2 5
;fn = tan – 1 – tan – 1 ,oa = tan - 1 (3) – sin – 1 , rks ] cot ( – ) =
2 – 1 2 5
(A) 1 (B) 0 (C) 0 (D*) fo|eku ugha gS A
Sol. = and rFkk =
4 4
n 2
16. If cos – 1 > 3 , then the minimum and maximum values, of integer n are
2
respectiv ely
(A) – 6 and – 3 (B*) – 6 and – 4 (C) 3 and 6 (D) 4 and 6
n 2
;fn cos – 1 > gks , rks iw . kk± d 'n' dk U;w u re vkS j vf/kdre eku Øe'k% gS &
2 3
(A) – 6 vkS j – 3 (B*) – 6 vkS j – 4 (C) 3 vkS j 6 (D) 4 vkS j 6
y
2 /3
Sol.
x
– 1 – 1/2
n 2
cos – 1
2 3
Page # 5
n 1
–1 –
2 2
– 2< n < – – 6.28 < n < – 3.14
n = – 4, – 5, – 6
3
17. The number of solutions of the equation 2sin – 1 x2 x 1 + cos – 1
x2 x =
2
is
(A) 0 (B) Inf inite (C*) 2 (D) 4
3
lehdj.k 2sin – 1 x2 x 1 + cos – 1
x2 x =
2
ds gyksa dh la[;k gS&
(A) 0 (B) vuUr (C*) 2 (D) 4
Sol. Hold only x2 – x 1 = 1, x2 – x = 0 x2 – x = 0 x = 0, x = 1
18. Number of triplets (x, y, z) satisf ying sin – 1 x + cos – 1 y + sin – 1 z = 2, is
sin – 1 x + cos – 1 y + sin – 1 z = 2 dks la r q " V djus okys f=k;q X eks a (x, y, z) dh la [ ;k gS &
(A) 0 (B) 2 (C*) 1 (D) infinite vuUr
Sol. sin x + cos y + sin z = 2
–1 –1 –1
Possible when
sin–1x = x = sin =1
2 2
cos–1y = y = cos = – 1
sin–1(z) = z = sin =1
2 2
only one triplet (1, – 1, 1)
20. The set of values of a for which x2 + ax + sin–1 (x2 – 4x + 5) + cos–1 (x2 – 4x + 5) = 0
has at least one solution is
(A) ( – , – 2 ] [ 2 , ] (B) ( – , – 2 ) ( 2 , )
(C) R (D*) none of these
a ds ekuks a dk leq P p;] ftuds fy, lehdj.k x2 + ax + sin–1 (x2 – 4x + 5) + cos–1 (x2 – 4x + 5) = 0
dk de ls de ,d gy fo|eku gS ] gS a &
(A) ( – , – 2 ] [ 2 , ] (B) ( – , – 2 ) ( 2 , )
(C) R (D*) bues a ls dks b Z ugha
Sol. x2 + ax + sin–1 (x2 – 4x + 5) + cos–1 (x2 –4x + 5) = 0 ..........(1)
for equation (1) to be defined.
– 1 x2 – 4x + 5 1 x2 – 4x + 5 > 0 x R
x2 – 4x + 4 0
(x – 2)2 0
x=2
equation (1) will be defined if x = 2, we get.
4 + 2a + =0
2
2a = – 4 a = –2
2 4
Page # 6
DPP No. # 08 (JEE–ADVANCED)
Total Marks : 43 Max. Time : 39 min.
Single choice Objective (no negative marking) Q.1,2,3,4,5 (3 marks, 3 min.) [15, 15]
Multiple choice objective (no negative marking) Q.6,7 (5 marks, 4 min.) [10, 8]
Subjective choice (no negative marking) Q.8,9 (5 marks, 4 min.) [10, 8]
Match the Following (no negative marking) Q.10 (8 marks, 8 min.) [8, 8]
50
–1 2n
1. The sum tan
n1
4 2
n – n 1
equals tan–1K, where K equal
Sn = tan–1n(n + 1)
S50 = tan–1(2550)
2. Solve for x, if [cos–1x] = [sin–1x] (where [.] represents greatest integral part function).
x ds fy, gy dhft, : [cos–1x] = [sin–1x] (tgk¡ [.] egÙke iw.kk±d Qyu dks O;Dr djrk gSA)
(A) [–1 , cos 1) (B*) (cos 1 , sin 1) (C) [ – 1, sin 1) (D) [sin1, 1]
3
Sol. /2 2
is x (cos1, sin1)
0 cos1 sin1 1
Page # 7
2x [x]
3. Domain of f(x) = sin – 1 , where [ . ] denotes the greatest integer f unction, is
[x]
2x [x]
f (x) = sin – 1 dk iz k Ur gS & ¼tgk¡ [ . ] egÙke iw . kk± d Qyu dks iz n f'kZ r djrk gS a ½
[x]
4
(A) (– , 1) – {0} (B) , 0 {1}
3
(C*) (– , 0) + (D) (–, ) – [0, 1)
2f
Sol. – 1 1 + x , 0 So vr% x (– , 0) +
2x
4. If 2 tan–1x + sin–1 is independent of 'x' then
1 x2
2x
;fn 2 tan–1x + sin–1 , x ls Lora = k gks ] rks &
1 x2
(A*) x (– , –1] [1, ) (B) x [–1, 1]
(C) x (– , 1] (D) x R
Sol. Standard result
1 1 1
5. Number of solutions of the equation tan –1 = tan –1 + tan –1 2
a 1 x a x 1
(A) one (B*) Two (C) Three (D) Zero
1 1 1
lehdj.k tan –1 –1
= tan x + tan 2
–1
ds gyks a dh la [ ;k gS a &
a 1 a x 1
(A) 1 (B*) 2 (C) 3 (D) 'kw U ;
1 1 1
Sol. tan–1 – tan–1 2 = tan–1
a 1 a x 1 x
a2 x 1 a 1 1 a2 1 x a 1 1
tan–1 2 = tan
–1
=
(a 1)(a x 1) 1 x (a 1)(a2 1 x) 1 x
Solving we set x = a, x = a2 – a + 1
Page # 8
fuEu esa ls dkSuls Qyuksa ds ;qXe loZle gS ?
1 x2
(A*) f(x) = cos (2 tan–1x), g(x) =
1 x2
2x
(B*) f(x) = , g(x) = sin (2 cot–1x)
1 x2
(C) f(x) = sin–1 (sinx), g(x) = cos–1 (cosx)
1
(D*) f(x) = e n (sgn cot x ) , g(x) = e n [1 { x }] ,
tgk¡ sgn(.), [.], {.} Øe'k% flXue] egÙke iw.kk±d] fHkUukRed)
1– x2
Sol. (A) f(x) = cos(2 tan–1x) ; g(x) =
1 x2
' f ' and 'g' have same domain and range
1– x2
and f(x) = g(x) =
1 x2
2x
(B) f(x) = , g(x) = sin (2 cot–1 x)
1 x2
1 x
g(x) = sin (2 cot-1x) = 2 sin cos (where = cot–1x) cot x ; sin , cos
1 x2 1 x2
2 x .1
= = f(x)
(1 x 2 )
'f ' & 'g' have same domain & range.
i.e. xR
–1
(D) f(x) = e n (sgn cot x )
sgn (cot–1 x) = 1 x R ( cot–1 x (0, ))
f(x) = 1
g(x) = e n [1 { x }] = en(1) = 1 xR
f(x) & g(x) are identical.
1– x2
Hindi. (A) f(x) = cos(2 tan–1x) ; g(x) =
1 x2
f' o g ds fy;s izkUr Hkh ,d leku rFkk ifjlj Hkh ,d leku gksxkA
1– x2
rFkk f(x) = g(x) =
1 x2
2x
(B) f(x) = , g(x) = sin (2 cot–1 x)
1 x2
1 x
g(x) = sin (2 cot-1x) = 2 sin cos (where = cot–1x) cot x ; sin , cos
2
1 x 1 x2
2 x .1
= = f(x)
(1 x 2 )
f vkSj g ds izkUr ,oa ifjlj leku gSA
vFkkZr. x R
–1
(D) f(x) = e n (sgn cot x )
sgn (cot x) = 1 x R
–1
( cot–1 x (0, ))
f(x) = 1
g(x) = e n [1 { x }] = en(1) = 1 xR
f(x) rFkk g(x), leku Qyu gSA
n
1
8. Let f(x) =
1 x
, g(x) = fofofofofofof(x) and h(x) = tan–1 (g(–x2 – x)), then find lim
n
h (r ) .
r 1
Page # 9
n
1
;fn f(x) =
1 x
, g(x) = fofofofofofof(x) vkSj h(x) = tan–1 (g(–x2 – x)) gks] rks lim
n
h (r ) Kkr dhft,A
r 1
Ans.
4
1 1 1 x x 1
Sol. fof(x) = = = =
1 f(x) 1 x x
1
1 x
1
1
f 1 1 x
fofof(x) = =x
f 1
1 x
1
g(x) = fofofofofofof(x) = fofofof(x)= f(x) =
1 x
1 1 x x
Now h(x) = tan–1 2
= tan–1 = tan–1 (x + 1) – tan–1 x
1 x x 1 x( x 1)
n
Now lim
n
tan
r 1
1
(r 1) tan 1(r )
= lim (tan-1 (2) – tan–1 1) + (tan–1 (3) – tan–1 2) +....... + tan–1 (n + 1) – tan–1 n
n
= lim (tan–1 (n + 1) – tan–1 1)= tan–1 () – tan–1 (1) = =
n 2 4 4
Min f ( t ) : 0 t x ; 0 x 1
9. If f(x) = 4x3 x2 2x + 1 and g(x) = then find the value of
3x ;1 x 2
1 3 5
g + g +g .
4 4 4
Min f (t ) : 0 t x ; 0 x 1 1 3
;fn f(x) = 4x3 x2 2x + 1 vkSj g(x) = gks] rks g + g +
3x ;1 x 2 4 4
5
g dk eku Kkr djksA
4
Ans. 5/2
1
Sol.
–1/3 1/2
Page # 10
feyku dhft,&
LrEHk - I LrEHk- II
(A) f : R , vkSj f(x) = cot–1 (2x–x2 –2), rc f(x) gS& (p) ,dSdh
4
(B) f: R R vkSj f(x) = eax sinbx tgk¡ a,b, R+, rc f(x) gS& (q) vUrZ{ksih
(C) f : R+ [2, ) vkSj f(x) = 2 + 3x2 , rc f(x) gS& (r) cgq,sdh
(D) f: X X vkSj f(f(x)) = x x X, rc f(x) gS& (s) vkPNknd
(t) izfrykseh;
Ans. (A) (q,r), (B) (r,s), (C) (p,q), (D) (p,s, t)
1
Sol. (A) f(x) = (2 – 2x)
1 (2x x 2 2)2
2( x 1)
=
1 (2x x 2 2)2
– +
1
For x < 1 ds fy, f(x) is negative _.kkRed gSA
for x > 1 ds fy, f(x) is positive /kukRed gSA
many one cgq,dSdh gSA
y = 2x – x2 – 2 x2 – 2x + 2 + y = 0
x R, D 0 4 – 4(2 + y) 0
1 – 2y 0 –1–y0 y–1
3
Range ifjlj ,
4
(B)
Page # 11
2. Let A be the set of all subsets of a non-empty set S. Show that the binary operation 'union' on A is left
distributive over the binary operation 'intersection' on A. Also show that 'intersection' is left distributive
over 'union'.
ekuk A, ,d vfjDr leqPp; S ds lHkh mileqPp;ksa dk leqPp; gSA iznf'kZr dhft, fd A ij f}vk/kkjh lafØ;k
'la?k', A ij f}vk/kkjh lafØ;k 'loZfu"B' ij cka;h caVu gksxhA ;g Hkh iznf'kZr dhft, fd 'loZfu"B', 'la?k' ij cka;h caVu
gksxhA
Sol. Let X, Y, Z A
By set theory, we have
X (Y Z) = (X Y) (X Z) which shows that 'union' is left distributive over 'intersection'.
X (Y Z) = (X Y) (X Z) which shows that 'intersection' is left distributive over 'union'.
Hindi. ekuk X, Y, Z A
leqPp; fl)kUr ls
X (Y Z) = (X Y) (X Z) tks iznf'kZr djrk gS fd 'la?k', 'loZfu"B' ij cka;h caVu gksxkA
X (Y Z) = (X Y) (X Z) tks iznf'kZr djrk gS fd 'loZfu"B', 'la?k' ij cka;h caVu gksxkA
4. Let * be a binary operation on Z .If a * b = (a2 + b3)2 where a, b Z then the value of 5 * 3 is
(A) 1256 (B*) 2704 (C) 64 (D) 34
ekuk *, Z ij ,d f}vk/kkjh lafØ;k gSA ;fn a * b = (a2 + b3)2 tgk¡ a, b Z rks 5 * 3 dk eku gS&
(A) 1256 (B*) 2704 (C) 64 (D) 34
Sol. We have gesa fn;k gS a * b = (a2 + b3)2 ; a, b Z
5 * 3 = ((5)2 + (C)2 = (25 + 27)2 = 2704
Page # 12
ekuk *, N ij ,d f}vk/kkjh lafØ;k gS tks fd a * b = 25ab ; a, b N }kjk ifjHkkf"kr gS] rks f}vk/kkjh lafØ;k * gS&
(A*) dsoy Øefofues; (B) dsoy lkgp;Z
(C) Øe fofues; rFkk lkgp;Z nksuksa (D) uk rks Øefofues; uk gh lkgp;Z
Sol. For a, b N, we have
a * b = 25ab
Commutativity. Let a , b N
a * b = 25ab = 25ba = b * a
a*b=b*a
* is commutative.
Associativity. Let a = 1, b = 2, c = 3
(a * b) * c = (1 * 2) * 3 = 25(A)(B) * 3 = 210 * 3 = =
Also a * (b * c) = 1 * (2 * 3) = 1 * 25(B)(C) = 1 * 230 = =
(a * b) * c a * (b * c) for a = 1, b = 2, c = 3
In general, (a * b) * c a * (b * c)
* is not associative.
Hindi. a, b N ds fy,
gesa fn;k gS a * b = 25ab
Øe fofues;rk
ekuk a , b N
a * b = 25ab = 25ba = b * a
a*b=b*a
* Øefofues; gSA
Hindi. 1(A) = 1 = 0 (7) + 1 1 * 1 = 1 A
1(B) = 2 = 0 (7) + 2 1 * 2 = 2 A
1(C) = 3 = 0 (7) + 3 1 * 3 = 3 A
_________________________________
5(5) = 25 = 3(7) + 4 5 * 5 = 4 A
5(6) = 30 = 4(7) + 2 5 * 6 = 2 A
'*' dh ifjHkk"kk ls,
gesa fn;k gS a * b = b * a a, b A
a * b a, b A
*, A ij ,d f}vk/kkjh lafØ;k gksxhA
lkgp;Zrk
ekuk a = 1, b = 2, c = 3
(a * b) * c = (1 * 2) * 3 = 25(A)(B) * 3 = 210 * 3 = =
rFkk a * (b * c) = 1 * (2 * 3) = 1 * 25(B)(C) = 1 * 230 = =
a = 1, b = 2, c = 3 ds fy,] (a * b) * c a * (b * c)
lkekU;r%, (a * b) * c a * (b * c)
* lkgp;Z ugha gSA
a b
8. If is a binary operation on R defined by a b = + for a, b R, then show that :
4 7
(2 5) 7 2 (5 7).
a b
;fn , R ij ,d f}vk/kkjh lafØ;k gS tks fd a b = + a, b R }kjk ifjHkkf"kr gS] rks iznf'kZr dhft,
4 7
fd (2 5) 7 2 (5 7).
73 23
Sol. (2 5) 7 = 2 (5 7) =
56 28
9. Consider the binary operation * on Q defined by a * b = a + 12b + ab for a, b Q. Show that * is not
commutative.
ekuk *, Q ij ,d f}vk/kkjh lafØ;k gS tks fd a * b = a + 12b + ab a, b Q }kjk ifjHkkf"kr gSA iznf'kZr dhft,
fd lafØ;k * Øefofues; ugha gSA
Sol. 1, 2 Q
Now 1 * 2 = 1 + 12(B) + 1(B) = 27 and 2 * 1 = 2 + 12(A) + 2(A) = 16
1*2 2*1 * is not commutative.
Page # 13
Hindi. 1, 2 Q
vc 1 * 2 = 1 + 12(B) + 1(B) = 27 rFkk 2 * 1 = 2 + 12(A) + 2(A) = 16
1*2 2*1 * Øefofues; ugha gSA
10. Let * be a binary operation on Z × Z defined by (a, b) * (c, d) = (a + c, b + d); (a, b), (c, d) Z × Z.
Find (1, 2) * (3, 5) and (4, 3) * (1, 0).
ekuk *, Z × Z ij ,d f}vk/kkjh lafØ;k gS tks fd (a, b) * (c, d) = (a + c, b + d); (a, b), (c, d) Z × Z }kjk
ifjHkkf"kr gSA (1, 2) * (3, 5) rFkk (4, 3) * (1, 0) Kkr dhft,A
Ans. (4, 7) , (5, 3)
Sol. (1, 2) * (3, 5) = (4, 7) and rFkk (4, 3) * (1, 0) = (5, 3)
11. Let A = N × N and '*' be a binary operation on A defined by (a, b) * (c, d) = (ad + bc, bd). Show that
(A, *) has no identity element.
ekuk A = N × N rFkk '*', A ij ,d f}vk/kkjh lafØ;k gS tks fd (a, b) * (c, d) = (ad + bc, bd) }kjk ifjHkkf"kr gSA
iznf'kZr dhft, fd (A, *) dk dksbZ rRled vo;o laHko ugha gSA
Sol. We have (a, b) * (c, d) = (ad + bc, bd) for (a, b) (c, d) A
Let (p, q) be the identity element of (A, *)
For (a, b) A, we have
(a, b) * (p, q) = (a, b) = (p, q) * (a, b)
(aq + bp, bq) = (a, b) = (pb + qa, qb)
aq + bp = and bq = b
Solving, we get p = 0, q = 1
Since 0 N, (0, 1) A
(A, *) has no identity element.
Remark . Since identity element does not exist in the above example, the concept of inverse of an
element is not defined in the set A.
Hindi. gesa fn;k gS fd (a, b) * (c, d) = (ad + bc, bd) (a, b) (c, d) A
ekuk (p, q), (A, *) dk rRled vo;o gSA
(a, b) A ds fy,, gesa fn;k gS
(a, b) * (p, q) = (a, b) = (p, q) * (a, b)
(aq + bp, bq) = (a, b) = (pb + qa, qb)
aq + bp = rFkk bq = b
gy djus ij p = 0, q = 1
pwafd 0 N, (0, 1) A
(A, *) dk dksbZ rRled vo;o ugha gSA
fVIi.kh . pwafd mijksDr mnkgj.k esa rRled vo;o dk vfLrRo ugha gS blfy, leqPp; A esa fdlh vo;o dk
izfrykse vo;o Hkh ifjHkkf"kr ugha gksxkA
12. Let * be a binary operation on Z defined by a * b = a + b – 15 for a, b Z. The identity element in (Z, *)
is
ekuk *, Z ij ,d f}vk/kkjh lafØ;k gS tks fd a * b = a + b – 15 a, b Z }kjk ifjHkkf"kr gS rks (Z, *) dk
rRled vo;o gS&
(A) 5 (B) 10 (C*) 15 (D) 0
Sol. Let e be the identity element.
For a Z, a * e = a = e * a
a + e – 15 = a = e + a – 15
e – 15 = 0 e = 15 Z
The identity element is 15.
Hindi. ekuk rRled vo;o e gS
a Z ds fy,, a*e=a=e*a
a + e – 15 = a = e + a – 15
e – 15 = 0 e = 15 Z
rRled vo;o 15 gksxkA
Page # 14
13. Let * be a binary operation on Z defined by a * b = a + b – 15 for a, b Z. The inverse of element 21 in
(Z, *) is
ekuk *, Z ij ,d f}vk/kkjh lafØ;k gS tks fd a * b = a + b – 15 a, b Z }kjk ifjHkkf"kr gS] rks (Z, *) esa 21 dk
izfrykse vo;o gksxk&
(A) 12 (B) –21 (C*) 9 (D) 1/21
Sol. Let a Z and b be its inverse a*b=e=b*a
a + b – 15 = 15 = b + a – 15 b = 30 – a Z The inverse of a Z is 30 – a
Hindi. ekuk a Z rFkk mldk izfrykse b gS a*b=e=b*a
a + b – 15 = 15 = b + a – 15 b = 30 – a Z
a Z dk izfrykse 30 – a gksxkA
14. Let A = {1, –1, i, –i}, where i = 1 . Draw the composition table corresponding to binary operation
'multiplication' on A.
ekuk A = {1, –1, i, –i}, tgk¡ i = 1 . A ij f}vk/kkjh lafØ;k 'xq.ku' ds laxr la;kstu lkj.kh cukb;sA
Sol. We have gesa fn;k gS
1×1=1 1 × (–1) = –1 1×i=i 1 × (–i) =–i
(–1) × 1 = –1 (–1) × (–1) = 1 (–1) × i = –i (–1) × (–i) = i
i×1=i i × (–1) = –i i × i = –1 i × (–i) = 1
(–1) × i = –i (–i) × (–1) = i (–i) × i = 1 (–i) × (–i) = –1
The required composition table is given below :
blfy, vHkh"B la;kstu lkj.kh fuEufyf[kr gksxh
1 1 i i
1 1 1 i i
1 1 1 i i
i i i 1 1
i i i 1 1
* a b c
a b c a
15. Does the composition table :
b c a b
c a b c
give a commutative binary operation on the set {a, b, c} ?
* a b c
a b c a
D;k la;kstu lkj.kh :
b c a b
c a b c
leqPp; {a, b, c} ij ,d Øefofuesa; f}vk/kkjh lafØ;k dks fu:fir djrh gS ?
Ans. Yes gk¡
Sol. a * a = b, a * b = c, a * c = a, b * a = c, b * b = a, b * c = b, c * a = a, c * b = b, c * c = c
Page # 15