Relations and functions

Board Exam weightage:max.5M

1 Mark Questions

1. A function f : R → R defined as f ( x ) = x − 4 x + 5 is:

2

(A) Injective but not surjective (B) surjective but not injective
(C) both injective and surjective (D) neither injective nor surjective
2. Let R+ denote the set of all non-negative real numbers. Then the function f: R+ → R+
defined as f(x) = x2 + 1 is:
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto
3. Let f : R+ → [– 5,  ) be defined as f(x) = 9x2 + 6x – 5, where R+ is the set of all non-
negative real numbers. Then, f is :
(A) one-one (B) onto (C) bijective (D) neither one-one nor onto
4. A function f : R+ → R (where R+ is the set of all non-negative real numbers) defined by
f(x) = 4x + 3 is :
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto
5. The relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1), (1, 1)} is
(A) symmetric and transitive, but not reflexive
(B) reflexive and symmetric, but not transitive
(C) symmetric, but neither reflexive nor transitive
(D) an equivalence relation
6. The function f : R → [– 1, 1] defined by f(x) = cos x is

(A) both one-one and onto (B) not one-one, but onto

(C) one-one, but not onto (D) neither one-one, nor onto

7. Let A={3,5}.then number of reflexive relations on A is

(A) 2 (B) 4 (C) 0 (D) 8

[Link] number of equivalence relations in the set {1,2,3} containing the elements (1,2) and (2,1) is
 (A) 2 (B) 1 (C) 0 (D) 3

9. A relation R is defined on Z as aRb if and only if a2-7ab+6b2=[Link] R is

(A) Reflexive and symmetric (B)Symmetric but not reflexive

(C) transitive but not reflexive (D) reflexive but not symmetric.

[Link] function f:R → R defined by f(x)=4+3cosx is

(A) Bijective (B)one-one but not onto

(C)onto but not one-one (D)neither one-one nor onto

[Link] f :[2, ) → R be the function defined by f(x)=x -4x+5, then range of f is

2

(A) [1,  ) (B) R (C) [3, ) (D) Not define

12. The number of functions defined from {1,2,3,4,5} → {a,b} which are one-one is

(A) 5 (B) 3 (C) 2 (D) 0

1
[Link] f;R → R is defined by f(x)= for all x  R, then, f is
x

(A) One-one (B) Onto (C) Bijective (D) not defined

n +1
 2 ,if n is odd
[Link] function f;N → N is defined by f (n) = 
 n ,if n is even
 2

(A) Bijective (B)one-one but not onto

(C)onto but not one-one (D)neither one-one nor onto

15. Relation R in the set A={1,2,3} is defined as R={(1,1),(1,2),(2,2),(3,3)}.Which of the

following ordered pairs in R shall be removed to make them equivalent relation to A?

(A) (1,1) (B) (1,2) (C) (2,2) (D) (3,3)

16. Let the relation in the set A= {x  Z : 0  x  12}given by

R = {(a, b) :| a − b | is a multiple of 4} .Then [1], the equivalence class containing 1,is

(A) {1,5,9} (B) {0,1,2,5} (C)  (D) A

[Link] of reflexive relations are possible in a set A whose n(A)=3 is

 (A) 28 (B) 54 (C) 64 (D) 32

18. In a relation each element of set A is related to itself, then the relation is

(A) Reflexive (B) Symmetric (C) Transitive (D) Identity

19. If R = {( x, y) : x + 2 y = 8} is relation in N, then range of R is

(A) {1,2,3} (B) {2,4,6} (C)  (D) N

[Link] R={(a, a3): a is a prime number less than 5} be a relation, then the range of R.

(A) {2,3} (B) {8,27} (C)  (D) N

[Link] a relation R on the set {1,2,3} be defined by R={(1,2)}, then R is

(A) Reflexive (B) Symmetric (C) Transitive (D) Identity

[Link] A={1,2,3…n} and B={a,b}. then the number of surjections from A into B is

(A) n p2 (B) 2n -2 (C) 2n -1 (D) 2n

[Link] n(A)=5 and n(B)=6 then number of one-one functions from A to B is

(A) 0 (B)120 (C)720 (D)30

25. Assertion(A): Let Z be the set of integers. A function f : Z → Z defined as f(x)=3x-5

is a x  Z bijective
Reason(R): A function is a bijective if it is both surjective and injective
26. Assertion(A): The relation R= {(x,y):(x+ y) is a prime number and x ,y  N} is not a
reflexive relation.
Reason(R): The number ‘2n’is a composite for all natural numbers n.
27. Assertion(A): Let A = {x  R : −1  x  1} . If f : A→A be defined as f(x)=x2, then f is

not an onto function.

Reason(R): If y = −1 A ,then x =  −1  A .

28. Assertion(A): A function f : N → N given by f(x)=x3+2, x  N is one -one but onto.

Reason(R): Since y  N (Codomain), there does not exist x = ( y − 2 ) in

1/3

N (Domain) such that f(x)= x3+2=y

2marks questions
1. Prove that the greatest integer function f : , given by f(x) = [x], is neither one-one nor onto.
2. A function f : A → B defined as f(x) = 2x is both one-one and onto. If A = {1, 2, 3, 4},

then find the set B.

3. Check if the relation R on the set A = { 1, 2, 3, 4, 5, 6 } defined as R = { (x, y) : y is

divisible by x } is (i) symmetric (ii) transitive

4. If f : R → R be given by f(x) = (3 – x3)1/3, find fof (x)

x−2
5. Let f: A→B be defined by f ( x) = ,where A= R-{3}, and B= R-{1}. Discuss the
x−3
bijectivity of the function.
6. Write the smallest reflexive relation on the set A= {a, b, c}
7. If the mappings f and g are given by f= {(1,2),(3,5),(4,1)} and g= {(2,3),(5,1),(3,1)},find
fog.
8. Let the function f : R → R be defined by f(x)= cos x, x  R .Show that f is neither one-
one nor onto.

1
9. Let the function f : R → R be defined by f ( x) = , x  R .Then find the range
2 − cos x
of f.
10. Check the function f:[-1,1] → :[-1,1] defined as f=x|x| is bijective.

3marks questions
1.A relation R on set A = {1, 2, 3, 4, 5} is defined as R = {(x, y) : |x2 – y2| < 8}. Check
whether the relation R is reflexive, symmetric and transitive.

2x
[Link] that a function f : R → R defined by f ( x ) = is neither one-one nor onto.
1 + x2
 4 4x
3. Let f : R − −  → R be a function defined as f ( x) = . Show that f is a
 3 3x + 4
one-one function. Also, check whether f is an onto function or not.

5x − 3
4. Show that a function f : R → R defined as f ( x) = is both one-one and onto.
4
5. Show that the function f : R → R defined by f(x)=4x3-5, x  R is one- one and onto.
6. A function f is defined from R → R as f(x) = ax + b, such that f(1) = 1 and f(2) = 3. Find
function f(x). Hence, check whether function f(x) is one-one and onto or not.
7. Prove that the relation R on Z, defined by R {(x, y) : (x – y) is divisible by n} is an

equivalence relation.
8. Show that the relation R in the set A= [1,2,3,4,5,6} given by

R = {(a, b) :| a − b | is divisible by 2} is an equivalence relation.

9. Check whether the relation R in the set N of natural numbers given by R = {(a, b) : a is divisor of b}
is reflexive, symmetric or transitive. Also determine whether R is an equivalence relation.
10. A relation R is defined on a set of real numbers R as R = {(x, y) : x . y is an irrational number}.

Check whether R is reflexive, symmetric and transitive or not.

11. Let R be the relation defined on a set N such that R={(x ,y): xy is a square of a natural number, x ,
y x  N } Determined if the relation R is an equivalence relation.
12. A relation R on set A = {– 4, – 3, – 2, – 1, 0, 1, 2, 3, 4} be defined as R = {(x, y) : x + y is
an integer divisible by 2}. Show that R is an equivalence relation. Also, write the
equivalence class [2].

5marks questions:.
1. Check whether the relation S in the set of real numbers R defined by

R = {(a, b) : where a − b + 2 is an irrational number } is reflexive, symmetric or

transitive.
2. A relation R is defined on N  N (where N is the set of natural numbers) as :
(a, b) R (c, d)  a – c = b – d . Show that R is an equivalence relation.
3. Let R be the relation defined in the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and
b are either odd or even}. Show that R is an equivalence relation. Hence, find the
elements of equivalence class [1].
4. Check whether the relation S in the set of all real numbers (ℝ) defined by
S = {(a, b) : a  b3} is reflexive, symmetric or transitive.
5. If N denotes the set of all natural numbers and R is the relation on N  N defined by
(a, b) R (c, d), if ad(b + c) = bc(a + d). Show that R is an equivalence relation.

6. A function f:[-4,4] → [0,4] is given by f(x)= 16 − x 2 .Show that f is an onto function

but not a one-one function. Further, find all possible values of a for which f(a)= 7

4marks questions:
Case Study:1
A classroom teacher is keen to assess the learning of her students the concept of “ relations” taught to
them. She writes the following five relations each defined on the set A={1,2,3}:

R1 = {(2,3),(3,2)}
R2 = {(1,2),(1,3),(3,2)}

R3 = {(1,2),(1,1),(2,1)}

R4 = {(1,2),(1,1),(2,2),(3,3)}

R5 = {(1,2),(1,1),(2,2),(3,3),(2,1),(2,3),(3, 2)}
The students are asked to answer the following questions about the relations:
(i) Identify the relation which is reflexive, transitive but not symmetric.
(ii) Identify the relation which is reflexive and symmetric but not transitive.
(iii) Identify the relation which are symmetric but neither reflexive nor transitive
(iv) What pairs we added to the relation to make R2 it an equivalence relation
Case Study:2
Students of school taken to a railway museum to learn about railways heritage and its history. An
exhibit in the museum depicted many rail lines on the track near to the railway station. Let L be the set
of all rail lines on the railway track and R be the relation on L defined by

R = {(l1 , l2 ) : l1 is parallel to l2 }
On the basis of the above information, answer the following questions:
(i) Find whether the relation R is symmetric or not
(ii) Find the whether the relation R is transitive or not
(iii) If one of the rail lines on the railway track is represented by the equation y = 3 x + 2 , then find
the set of railway lines in R related to it.
(iv) Let S be the relation defined by R = {(l1 , l2 ) : l1 is perpedicular to l2 } check whether the
relation S is symmetric and transitive
Case Study:3
An organisation conducted by bike race under two different categories- Boys and girls. There were 28
participants in all among all of them, finally three from category 1 and two from the category 2 selected
for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B={b1, b2, b3} and G= {g1, g2}, where B represents the set of Boys selected and G the set of girls
selected from the final race.
Based on the above information concern the following questions:
(i) How many relations are possible from B to G?
(ii) Among all possible relations from B to G, how many functions can be formed from B to G?
(iii) Let R : B → B be defined by R={(x,y):x and y are students of the same sex}
Check R is an equivalence relation.

(iv) A function f : B → G be defined by f = {(b1 , g1 ),(b2 , g 2 ),(b3 , g1 )} . Check if f is

bijective. Justify your answer.
Case Study:4
Let A be the set of 30 students of class XII in a school. Let f : A → N,N is set of natural numbers such
that function f(x)= Roll number of student x.
On the basis of the given information answer the following:
(i) Is f is bijective function?
(ii) Give rejects to support your answer to (i)
(iii) Let R be a relation defined by the teacher to plan the seating arrangement of the students in
pairs, where
R= {(x ,y): x ,y are Roll Numbers of students such that y=3x}
List the elements of R is the relation on reflexive symmetry and transitive ?Justify
your answer.
(iv) let R be a relation defined by
R={(x ,y): x ,y are Roll Numbers of students such that y=x3}
List the elements of R. Is R is a function? Justify your answer