Test Relations Functions Binary Operations
Test Relations Functions Binary Operations
2
1
( ) 1, ( )
1
f x x g x
x
then, find (5) gof .
Q02. Let * be a binary operation defined by x * = + 5 7 y x y . Find the value of 2 * 4.
Q03. Show that the relation R on R defined as
{ }
= s R ( , ) : a b a b is reflexive and transitive but not
symmetric.
OR Show that the relation R on the set R of real numbers defined as
{ }
= s
2
R ( , ) : a b a b is neither
reflexive nor symmetric nor transitive.
Q04. Let Z be the set of all integers and R be the relation on Z defined as
{ }
= e R ( , ) : , Z and ( ) is divisible by 5 a b a b a b . Prove that R is an equivalence relation.
Q05. Is the binary operation defined on set N, given by a
*
+
=
2
a b
b for all e , N a b , commutative? Is it
associative?
Q06. Consider the binary operation * on the set {1, 2, 3, 4, 5} defined by a
*
= HCF of and b a b . Write the
operation table of the operation *. Is * commutative? Justify.
Also, compute: (a) (2*3)*5 (b) (2*3)*(4*5).
Q07. Consider
+
: R [ 5, ) f given by = +
2
( ) 9 6 5 f x x x . Show that f is invertible and is equal to
+
=
1
6 1
( )
3
y
f y .
Q08. Let = A R {2} and = B R {1} , if : A B f is a mapping defined by
1
( )
2
x
f x
x
, show that f is
bijective.
Q09. Let = S { , , } a b c , find the total number of binary operations on S.
Q10. What is the range of
| 1|
( )
1
x
f x
x
.
Answers of Relations & Functions
TEST 01
Q01.
1
25
Q02. 38 Q05. Commutative but not associative
Q06.
Q09. =
2
3 9
3 3 Q10. { 1, 1} .
Relations & Functions
* 1 2 3 4 5
1 1 1 1 1 1
2 1 2 1 2 1
3 1 1 3 1 1
4 1 2 1 4 1
5 1 1 1 1 5
*
is commutative because every row of the
binary table is same as the corresponding
column.
(a) 1 (b) 1.