Chapter 1 Relation and Functions
Chapter 1 Relation and Functions
A relation R in a Set A is called ..........., if each element of A is related to every element of A Let
A mapping
Let
"
#1,
$,
%,
&'.
function
is
defined
from
to
Q7 Q8 Q9
*f f + R R and ) + R R defined by f,-."$- / % and ),-. " / 0, then find the value of - for 1hich f,),-.."$2 . 3ind the (otal number of e4uivalence relations defined in the set S " #a, b, c '
3ind 1hether the relation R in the set #1, $, %' )iven by R " #,1, 1., ,$, $., ,%, %., ,1, $., ,$, %.' is refle-ive,symmetric or transitive. Sho1 that the function f + 5 6 5 7 , )iven by f ,x. " $x, is one8one but not onto. 3ind gof and fog, if f + R 6 R 7 and g + R 6 7R are )iven by f ,x. " cos x and g ,x. " %x$.
3ind the number of all one8one functions from set A " #1, $, %' to itself. Let A " #1, $, %'. (hen find the number of e4uivalence relations containin) ,1, $. .
State 1ith reason 1hether follo1in) functions have inverse f + #1, $, %, &' 6#19' 1ith f " #,1, 19., ,$, 19., ,%, 19., ,&, 19.' & Marks Questions
1here, S is the ran)e of f is invertible. 3ind the inverse of Sho1 that the Relation R in the set e4uivalence relation.
Q3
)iven by
is
Q4
*f . *s
consider the function one8 one and onto: ;ustify your ans1er.
defined by
Q5
Let
g (x) = x3 + 5.Find fog-1(x) Q6 Check the in<ectivity and sur<ectivity of the follo1in)+ ,i. ,ii.. Q7 )iven by
=etermine 1hether the follo1in) relations are refle-ive, symmetric, and transitive if relation R,in the set 5 of 5atural numbers is defined as .
Q8
on the set
defined by .
Let the ? be the binary operation on 5 be defined by @.C.3 of a and b. *s ? commutative: *s ? associative: =oes there e-ist identity for this operation on 5: Let and be function defined
Q10
by and e4ual: ;ustify your ans1er. Q11 Let ,i. ,ii. Q12 and be functions from
. (hen, are
and
*f be a function defined by f ,-. " &-%A0. (hen sho1 that f is bi<ection. Sho1 that f + BA1, 1C 6D7R, )iven by f ,x. " x/(x+2) 7is one8one. 3ind the inverse of the function f + BA1, 1C 6 E Ran)e f. Let N be t e set of !"" n!tu#!" nu$be#s. % be t e #e"!tion on N & N defined by (!,b) % (c,d) iff !d = bc ' ow t !t % is e(uiv!"ence. Let ! " #1, $, %, &, 2, F, 0, G, H'. Let R1 be a relation in ! )iven by R1 " #,x, y. + x A y is divisible by %' and R$ be another relation on ! )iven by R$ " #,x, y.+ #x, y' 7#1, &, 0'' or #x, y' #$, 2, G' or #x, y' 7#%, F, H''. Sho1 that R1 " R$.
F Marks Questions Q1 Let 5 be the set of all natural numbers. R be the relation on 5 ! 5 defined by ,a,b. R ,c,d. iff ad " bc Sho1 that R is /(ui)a* nc
, *ation
Q2
Q3
Q4
3ind 1hether the function is one8one or onto Q5 *f of Q6 : as , Sho1 that for all . >hat is the inverse
Sho1 that 9 is the identity for this operation and each element of the set is invertible 1ith bein) the inverse of .
9
2= +3 2
Q1