13.

Given, f : N → N , defined by

{
n+1
, if n is odd
2
f (n)=
n
, if n is even
2

1+1 2
Here, f (1)= 2 =1 and f (2)= 2 =1

So, f is not one-one, i.e. f is many-one.

Now, consider a natural number m in codomain N .

n+1
Case I Let m=f (n)= 2 ⇒ 2 m=n+1

⇒ n=2 m−1, which is odd for each m ∈ N .

Thus, for each m ∈ N (codomain), there exists

2 m−1+1
n=2 m−1∈ N , such that f (2 m−1)= =m
2

Case II Let m=f (n)=n/2

⇒ n=2 m, which is even for each m ∈ N .

Thus, for each m ∈ N (codomain), there exists

2m
n=2 m∈ N , such that f (2 m)= =m.
2

Since, from both cases, we have pre-images. So, we can choose either of the case
to get the pre-image.

Therefore, f is onto.

Hence, f is many-one and onto function.

14.Similar as Example 9.
Ans. (i) Injection (ii) None of them (iii) Bijection

(iv) Bijection (v) None of them (vi) None of them

 15.Similar as Example 13.

16.Similar as Example 14.

17.Similar as Question 13.

18.We have a mapping f : A × B → B × A , defined as

f (a , b)=(b , a)

For one-one Let ( a 1 , b 1) and ( a 2 , b 2) ∈ A × B,

such that f ( a1 ,b 1 )=f ( a2 , b2 )

⇒ ( b1 , a1 )=( b2 , a2 )
⇒ b 1=b2 and a1=a 2
⇒ ( a1 , b1 )=( a2 , b2 )

So, f is one-one.

For onto Let ( b ' , a' ) ∈ B × A be any arbitrary element, then there exists ( a ' , b' ) ∈ A × B ,
such that

f ( a' ,b ' ) =( b ' , a' )

Since, ( b ' , a' ) was arbitrary, so f is onto.

Hence, f is bijective function.

ẋ
19.Given, f : R → R, defined by f (x)= 2
, ∀ x ∈ R Let x 1 , x 2 ∈ R such that
x +1
f ( x 1 ) =f ( x 2 )
x1 x2
⇒ ¿ 2 2
x +1 ¿ x 1 x 2−x 2 x 1+ x 1−x 2=0 ¿⇒ ¿ ¿ x1 x 2 ( x 2−x 1 )−1 ( x 2−x 1 )=0 ¿ ⇒ ¿ ¿ ( x 2−x 1 ) ( x 1 x 2−1 ) =0 ¿ ⇒ ¿ ¿ x
2 2
x +1
1 2
⇒ ¿ ¿

∴ f is not one-one, as if we take

1
x 1=3 and x2 = , then
3
3
f (3)= =f
10
1
3 ()
but 3 ≠
1
3
Now, let k ∈ R be any arbitrary element and let f (x)=k
x
⇒=k 2
x +1
2 2
⇒ k x +k =x ⇒ k x −x +k =0

[
⇒ ∵ f (x )= 2
x
x +1 ]
or (1−2 k)(1+ 2k )<0 , i.e. k >1/2 or k ←1/2
So, f is not onto.
Hence, f is neither one-one nor onto.

20.We have, y=f (x )=√ 4−x 2 ,0 ≤ x ≤ 2 , 0≤ y ≤ 2

For one-one Let x 1 , x 2 be any two elements of the interval 0 ≤ x ≤ 2, such that
f ( x 1 ) =f ( x 2 )

⇒ √ 4−x 2
1 ¿=√ 4−x 22 ⇒ 4−x 21=4−x 22
⇒ x 21 ¿=x 22 ⇒ x 1=± x 2 ⇒ x 1=x 2

[ x 1 ≠−x 2, since x 1 and x 2 are non-negative]

So, f (x) is one-one.

For onto Let k ∈[0 , 2] be any arbitrary element

and let f (x)=k ⇒ √ 4−x 2=k

On squaring both sides, we get 4−x 2=k 2

⇒ x 2=4−k 2 ⇒ x=± √ 4−k 2 ⇒ x=√ 4−k 2

¿ is non-negative, so we take positive]

Also, for 0 ≤ k ≤2, we have

0 ≤ √ 4−k 2 ≤2 ⇒ 0 ≤ x ≤ 2, which is true.

Thus, for each k ∈[0 , 2], there exists x=√ 4−k 2 ∈[0 , 2] such that f (x)=k . So, f (x) is
onto.

Hence, f is bijective function.

21. We have a function f : R → {x ∈ R :−1< x<1 }, defined as
 x
f (x)=

{
x
, if x ≥ 0
1+¿ x∨¿= 1+ x ¿
x
, if x< 0
1−x

For one-one Let x 1 , x 2 ∈ R. Then, the following cases arise

Case I When both are less than 0

Let x 1 , x 2 ∈ R such that x 1< 0 , x 2 <0 and f ( x 1 ) =f ( x 2 )
x1 x2
⇒ = ⇒ x 1−x1 x 2=x 2−x 1 x 2
1−x 1 1−x2

⇒ x 1=x 2

Case II When both are greater than or equal to 0

Let x 1 , x 2 ∈ R such that x 1 ≥ 0 , x 2 ≥ 0 and f ( x 1 ) =f ( x 2 )
x1 x2
⇒ = ⇒ x 1+ x 1 x 2=x 2 + x 1 x 2
1+ x1 1+ x 2
⇒ x1 =x2

Case III When one is non-negative and other is negative Let x 1 ≥ 0 and x 2< 0.
x1 x2
Now, if f ( x 1 ) =f ( x 2 ), then 1+ x = 1−x
1 2

⇒ x 1−x 1 x 2=x 2 + x 1 x 2

⇒ x 1−x 2=2 x 1 x 2, which is not possible as LHS ¿ 0

and RHS ≤ 0. Thus, x 1 ≠ x 2 ⇒ f ( x 1 ) ≠ f ( x 2 )

From cases I, II and III, we get f is one-one.

For onto Let y ∈(−1 ,1) be any arbitrary element. Then, the following cases arise

Case I When y ≥ 0, i.e. 0 ≤ y <1

 x
[ x
Consider, y=f (x )= 1+ x ∵ f (x )= 1+ x ≥ 0 ]
⇒ y + yx =x ⇒ y =x− yx

y
⇒ x= ≥0 , for 0 ≤ y <1
1− y

y
Thus, for each y ∈¿, there exists x= 1− y ∈ R such that f (x)= y .

Case II When y <0, i.e. −1< y <0

x
Consider, y=f (x )= 1−x

[∵ f (x )=
x
1−x
<0
]
⇒ y − yx=x ⇒ y= yx + x=x ( y +1)

y
⇒ x= < 0, for −1< y <0
y +1

y
Thus, for each y ∈(−1 ,0), there exist x= y +1 ∈ R such that f (x)= y .

From cases I and II, we get f is onto.

Exam Pattern Exercise

Part A - Objective Type Questions

Multiple Choice Type Questions

1 Let R be the relation in the set N given by R={(a , b): a=b−2 , b>6 }. Then, the
correct option is

[NCERT]
(a) (2 , 4)∈ R
(b) (3 , 8)∈ R
(c) (6 , 8)∈ R
(d) (8 , 7)∈ R
2 Let R be a relation from R to R the set of real numbers defined by
R={(x , y): x , y ∈ R and x− y + √ 3

is an irrational number }. Then, R is

(a) reflexive

(b) transitive

(c) symmetric

(d) an equivalence relation

3 The maximum number of equivalence relations on the set A={1 , 2, 3 } are

[NCERT Exemplar]
(a) 1
(b) 2
(c) 3
(d) 5

4 Let f : R → R be defined as f ( x)=x 4. Then, the correct option is

[NCERT]

(a) f is one-one onto

(b) f is many-one onto

(c) f is one-one but not onto

(d) f is neither one-one nor onto

5 Set A has 3 elements and the set B has 4 elements. Then the number of
injective mappings that can be defined from A to B is

[NCERT Exemplar]
(a) 144
(b) 12
(c) 24
(d) 64
6 Let A={3 , 5 }. Then, number of reflexive relations on A is

[CBSE 2023]
(a) 2
(b) 4
(c) 0
(d) 8

Fill in the Blanks

7 If atleast one of the relation R (i.e. reflexive, symmetric and transitive) does not
satisfy, then R is not

8 The range of [ x−3] is ........, where [ x] is greatest integer, which is less than equal
to x .

9 A function f : A → B is a bijection, if it is and

True and False

10 Every identity relation is an equivalence relation.

11 Relation R={(x , y): y−x is an integer }, where x , y ∈ Z , is not symmetric.

[
−π π
12 Function f (x)=sin ⁡x is many-one in the interval 2 , 2 ]
13 A function f : R → R be defined by f ( x)=x3 + 4 is a bijection.

Assertion-Reason Based Questions

Directions (Q. Nos. 14-15) In the questions given below are two statements
labelled as Assertion (A) and Reason (R). In the context of the two statements,
which one of the following is correct?

(a) Both A and R are correct; R is the correct explanation of A

(b) Both A and R are correct; R is not the correct explanation of A

(c) A is correct; R is incorrect

(d) R is correct; A is incorrect

14 Assertion (A) The relation R in the set A={1 , 2, 3 , 4 ,5 , 6 } defined as R={¿ is
divisible by x ) is not an equivalence relation.

Reason (R) The relation R will be an equivalence relation, if it is reflexive,

symmetric and transitive.

15 Assertion (A) The function f : R → R given by f ( x)=x3 is injective

Reason (R) The function f : X → Y is injective, if f (x)=f ( y)⇒ x= y for all x , y ∈ X .

Part-B Descriptive Questions

Very Short Answer Type Questions

16 If the relation R is defined on the set A={1 , 2, 3 , 4 ,5 } by R={(a , b):|a2−b 2|<8 }.
Then, find the relation R.

[NCERT Exemplar]

17 Let A={1 , 2, 3 }, B={4 ,5 , 6 , 7 } and let f ={(1 , 4),(2 , 5),(3 , 6)} be a function from A
to B. State whether f is one-one or not. [All India 2011]

18 A function f : A → B defined as f (x)=2 x is both one-one and onto. If

A={1 , 2, 3 , 4 } , then find the set B.

[CBSE 2023]

Short Answer Type Questions

19 Let P={3 , 4 , 5 } and R={(3 , 4) ,(4 ,5),(3 , 5)} be a relation on A . Then, show that R
is reflexive.

20 If A={1 , 2, 3 , 4 } , define relations on A which have properties of being

(i) reflexive, transitive but not symmetric.

(ii) symmetric but neither reflexive nor transitive.

[NCERT Exemplar]
21 Show that relation R in the set of real numbers, defined as R={(a , b): a≤ b 2 } is
neither reflexive nor symmetric nor transitive.

[NCERT]

22 If f : R → R is the function, defined by f ( x)=4 x 3 +7, then show that f is a

bijection.

[Delhi 2011C]

23 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 .

[CBSE 2023]

24 Prove that function f :¿ →[−5 , ∞ ] defined as f ( x)=4 x 2 +4 x −5 is both one-one

and onto.

[CBSE 2023]

Long Answer Type Questions

25 Show that the relation R , defined in the set of A all triangles as R={( T 1 , T 2 ) :T 1 is
similar to T 2 } , is equivalence relation. Consider three right angle triangles T 1 with
sides 3 , 4 ,5 ; T 2 with sides 5 , 12, 13 and T 3 with sides 6 , 8 , 10, which triangle among
T 1 , T 2 and T 3 are related?

[NCERT]
−1 1
[ ]
26 Check whether a function f : R → 2 , 2 defined as f (x)=
1+ x
x
2 is one-one and

onto or not.

[CBSE 2023]
27 Show that the function f : N → N , given by f (n)=n−¿ is a bijection.

28 Let A=[−1 ,1], then discuss whether the following functions defined on A are
one-one and onto or bijective.

(i) f (x)=x /2
(ii) g(x )=¿ x∨¿

(iii) k ( x)=x 2

[NCERT Exemplar]

Case Study Bused Questions

29 In a school, madam Sunita take lecture in Class XII. In this class, students
divided into two groups A and B. Group A has 20 students and group B has 25
students.

The relation between students of these groups are defined as R : group

A → group ⁡B or R : A → B R=¿ and y ∈ B ¿.

(i) Find the number of elements in codomain of R : A → B .

(ii) Find the set of all identity elements.

(iii) Find the total number of relations that can be formed from set A to B.

Or

Suppose the relation defined from set A to set B is R1= {( a1 , b1 ) , ( a2 , b3 ) , ( a 3 , b 4 ) }, then

find the inverse relation.
Hints & Solutions
1. (c)
2. (a)
3. (d)
4. (d)
5. (c)
6. (b)
7. equivalence
8. integer
9. one-one, onto
10.True
11.False;
Hint y−x is an integer ⇒ x− y is an integer.
It is symmetric.
12.True 13. True
13.(a) For reflexive, we know that x is divisible by x , which is true for all x ∈ A .
∴ (x , x )∈ R for all x ∈ A . So, R is reflexive.
For symmetry, we observe that 6 is divisible by 2 . This means that (2 , 6)∈ R
but (6 , 2)∉ R. So, R is not symmetric.
For transitivity, let (x , y )∈ R and ( y , z)∈ R
⇒ y is divisible by x and z is divisible by y .
⇒ z is divisible by x .
⇒ (x , z )∈ R For example, 2 is divisible by 1 and 4 is divisible by 2 . So, 4 is
divisible by 1 . So, R is transitive.
14.(a) Here, f : R → R is given as f ( x)=x3 .
Suppose f (x)=f ( y)
where x , y ∈ R ⇒ x 3= y 3
Now, we try to show that x= y .
Suppose x ≠ y , their cubes will also be not equal.
3 3
x ≠y
However, this will be a contradiction to Eq. (i).
Therefore, x= y . Hence, f is injective.
16. R={(1, 1),(1, 2), (2 ,1) ,(2 ,2),(2 ,3),(3 , 2), (3 ,3),(3 , 4) ,
17. One-one
(4 , 3)(4 , 4),(5 ,5)}

18. B={2 , 4 , 6 , 8 }
19.(i) {(1 ,1),(1 , 2),(2 , 3),(2 , 2), (1, 3),(3 , 3),(4 , 4 )}
(ii) {(2 , 2),(1 , 2),(2 , 1)}
20.a=± 3
21.T 1 and T 3
22. f (x) is onto but not one-one.
23.(i) f is one-one but not onto
(ii) g is neither one-one nor onto
(iii) k is neither one-one nor onto
(i) 25
(ii) equivalence
(iii) 2 ∨⁡{ ( b1 , a1 ) , ( b3 , a2 ) , ( b 4 ,a 3 ) }
500