1
Vijeta 2025
Maths Practice Sheet
Relations and Functions
1. Which one of the following function f : R R is 7. Let f :RR be a function defined by
injective? x7
(1) f (x) = |x|, x R (2) f (x) = –x, x R f ( x) , then
x 8
(3) f (x) = –x2, x R (4) f (x) = c, x R (1) f is One-One Onto
(2) f is One-One Into
1 x
2. If f ( x) , then f –1(x) = ? (3) f is Many-One Onto
1 x
(4) f is Many-One Into
1 x 1 x
(1) (2)
1 x 1 x
8. Functions f {(1, a), (2, b), (5, c),(6, e)} and
1
(3) (4) x g {(b, 10), (c, 12), (a, 7), (e, 4)} then gof (5) is
1 x2
equal to
3. Let B = {a, b, c, d} & R = {(a, c), (c, a), (a, a), (b, (1) 12 (2) 7
d), (d, b)} be a relation on B, then R is (3) 4 (4) 10
(1) Symmetric (2) Transitive
(3) Reflexive (4) Equivalence 9. If both f ( x) and g ( x) are onto, then gof(x)
(1) is always onto (2) may be onto
4. Let A = {1, 2, 3} & B = {5, 7, 9} if a relation R is (3) is never onto (4) Into
defined from A to B
R = {(a, b) : a > b, a A & b B}, then R is 10. If the set A contains 5 elements and the set B –8
(1) Universal (2) Null relation contains 6 elements, then the number of one-one and
(3) Identity relation (4) None of these onto mappings from A to B is
(1) 720 (2) 120
ax b (3) 0 (4) None of these
5. Let f ( x) . Then fof ( x) x provided that
cx d
(1) d a (2) d 0 11. Prove that the function f : N N , defined by
(3) a b c d 1 (4) a b 1 f ( x) x2 x 1 is one-one but not onto.
6. Set A {1, 2, 3} which of the following functions on
A is invertible ? 12. Let N be the set of all natural numbers and R be the
(1) f {(1, 1), (2, 1), (3, 1)} relation in N N defined by
(2) f {(1, 2), (2, 3), (3, 1)} (a, b) R (c, d ) if ad = bc. Show that R is an
(3) f {(1, 2), (2, 3), (3, 2)} equivalence relation.
(4) f {(1, 1), (2, 2), (3, 1)}
2
13. Let f : W W be defined as 4 4
15. Consider f : R R given by
n 1, if n is odd 3 3
f ( n) , Then show that f is a
n 1, if n iseven 4x 3
f ( x) . Show that f is bijective. Hence
bijlective function. 3x 4
find f –1.
14. Let A {x Z : 0 x 15). Show that
R (a, b) : a, b A, a b is a multiple of 7} is an
equivalence relation. Find the set of all elements
related to 1. Also write the equivalent class [2].
3
Hints and Solutions
1. (2) 9. (1)
A function is injective if f ( x1 ) f ( x2 ) x1 x2 f ( x) and g ( x) are Onto
where x1 , x2 R gof ( x) is always Onto
2. (1) 10. (3)
Let y f ( x) and write x in terms of y to get the As n( A) n(B) . Therefore , the number of one-
inverse of f. one and onto mappings from A to B is 0.
3. (1) 11. The given function is f : N N , defined as
If (a, b) R (b, a) R f ( x) x 2 x 1
f is one-one
4. (2)
Let x1 , x2 be any two elements of N,
No element of set A is greater than element of set
B. f ( x1 ) f ( x2 )
x12 x1 1 x22 x2 1
5. (1) ( x12 x22 ) ( x1 x2 ) 0
af ( x) b
f ( f ( x)) ( x1 x2 )( x1 x2 ) ( x1 x2 ) 0
cf ( x) d
( x1 x2 )( x1 x2 1) 0
ax b
a b ( x1 + x2 0 as x1, x2 N)
f ( f ( x)) cx d x1 x2 0
ax b
c d
cx d x1 x2
a 2 x ab bcx bd Thus, f ( x1 ) f ( x2 ) x1 x2 for all x1 , x2 N
f ( f ( x)) x
acx bc d 2 dcx So, f is one-one
2 2 2
a x ab bcx bd acx bcx d x dcx 2
f is onto
For a d , the above equation is true For 1 N , co-domain, we have f ( x) 1
x2 x 1 1
6. (2) x( x 1) 0
A function is invertible if it is both one-one and x 0 or x 1 but 0, 1 N
onto. 1 N , co-domain, has no per-image in N, domain
Therefore, f is not onto.
7. (2)
f is one-one as f ( x1 ) f ( x2 ) x1 x2 but not
12. For any (a, b) N N; ab ba
onto as for 1 R(Co domain) there does not exist
(a, b)R (a, b). Thus R is reflexive
any element x R (Domain) such that f ( x) 1.
Let (a, b) R (c, d ) for any a, b, c, d N
ad bc
8. (1)
cb da (c, d ) R (a, b)
gof (5) g[ f (5)] g[c] 12
R is symmetric
4
Let (a, b) R(c, d ) and R (a, b); a, b A, a b is a multiple of 7
(c, d ) R (e, f ) for a, b, c, d , e, f N Reflexivity : For any a A, we have
Then ad = bc and cf = de a a 0 0 7 , which is a multiple of 7.
adcf bcde or af = be (a, b) R (e, f ) (a, a) R
R is transitive Thus, (a, a) R for all a A.
So, R is an equivalence Relation Therefore, R is reflexive.
Symmetry : Let (a, b) R,
13. We have f : W W defined by a b is a multiple of 7.
n 1, if n is odd a b 7k for some positive integer k.
f ( n)
n 1, if n is even b a a b 7k for some positive
f is one-one: Let n1 , n2 W integer k.
If both n1 and n2 are odd, then b a is a multiple of 7.
f (n1 ) f (n2 ) n1 1 n2 1 n1 n2 (b, a) R
If both n1 and n2 are even, then Thus, (a, b) R (b, a) R for all a, b A
f (n1 ) f (n2 ) n1 1 n2 1 n1 n2 Therefore, R is symmetric.
If n1 is odd and n2 is even, then Transitivity: Let (a, b) R and (b, c) R
f (n1 ) n1 1 is even and f (n2 ) n2 1 is odd a b is a multiple of 7 and b c is a
n1 n2 f (n1 ) f (n2 ) multiple of 7.
[ f (n1 ) n1 1 is even and f (n2 ) n2 1 is odd] a b 7k and b c 7k 1 for some positive
If n1 is even and n2 is odd, then integer k and K.
a b 7k and b c 7k for some
f (n1 ) n1 1 is odd and f (n2 ) n2 1 is even positive integer k and K1.
n1 n2 f (n1 ) f (n2 ) a c (a b) (b c) 1 7k 7k 2
[ f (n1 ) n1 1 is odd and f (n2 ) n2 1 is even] 7(k k 1 ) for some positive integer k and K1.
Thus, f is one-one a c is a multiple of 7.
f is onto : Let n be an arbitrary element of W. a c is multiple of 7.
If n is odd whole number, then there exists an even
(a, c) R
whole number (n 1) W such that
Thus, (a, b) R and (b, c) R (a, c) R for all
f (n 1) (n 1) 1 n , by definition
a, b, c A
f (n) n 1, if n is even. Therefore, R is transitive
If n is even whole numbers, then there exists on Hence, the relation R, being reflexive, symmetric
odd whole numbers n + 1 N such that f (x + 1) = and transitive, is an equivalence relation.
n+1–1=n Let x be an element of A such that ( x, 1) R .
Thus, f is onto. Then, x 1 is a multiple of 7.
Hence, f, being one-one and onto is a bijective x 1 0, 7, 14 x 1 0, 7, 14 x 1,8,15
function.
Hence, the set of all elements related to 1 is {1, 8, 15}.
Let y be an element of A such that ( y,2) R.
14. Given
Then, y 2 is multiple of 7
A {x Z : 0 x 15)
Hence, the set of all elements related to 2 is {2, 9}
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}
and equivalence class [2] = {2, 9}
5
15. f is one-one 4 3 4y
When y , then x is a real number.
4 3 3y 4
Let x1 , x2 be any two elements of R , then
3 4
Every element y R , co-domain of f, has a
f ( x1 ) f ( x2 ) 3
4 x1 3 4 x2 3 4
per-image x R , domain of f.
3x1 4 3x2 4 3
(4x1 3)(3x2 4) (4 x2 3)(3x1 4) 4
Thus, the range of f R co-domain of f.
12x1 x2 16x1 9x2 12 12x1 x2 16x2 9x1 12 3
16 x1 9 x2 16 x2 9 x1 Therefore, f is onto.
16 x1 9 x1 16 x2 9 x2 4 4
Also, using (1) , f 1 : R R is
7 x1 7 x2 3 3
x1 x2 3 4x
given by f 1 ( x)
Thus, f ( x1 ) f ( x2 ) x1 x2 for all 3x 4
4
x1 , x2 R
3
So, f is one-one
f is onto
4
Let y be an arbitrary element of R , then
3
y f ( x)
4x 3
y 3xy 4 y 4 x 3
3x 4
3xy 4x 3 4 y x(3y 4) 3 4 y
3 4y
x ...(1)
3y 4
PW Web/App - https://smart.link/7wwosivoicgd4
Library- https://smart.link/sdfez8ejd80if
