OPTIMAL STRATEGIES Including

FOR ACHIEVING A Daily Practice Paper

PERFECT SCORE OF NCERT Solutions
100/100 IN YOUR Line by Line Questions
EXAMS Previous year Question Papers
Chapter Wise Mind Maps
Commence your study session equipped
with our meticulously crafted chapter-wise
and topic-wise notes, designed to optimize
your exam performance, exclusively AS PER LATEST CBSE
provided by Artham Resources.
CURRICULLUM 2024-25

WWW.EDUCATORSRESOURCE.IN
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

INDEX

Chapter 1: Relati ns and Functi ns

Concepts Covered:
1. Pre-Introductio of Relatio
2. Types of Rela ons
➢ Empty rela on
➢ Universal rela on
➢ Re exive rela on
➢ Symmetric rela on
➢ Transi ve rela on
➢ Equivalence rela on
3. Types of Function
➢ One-One Func on [Injec ve]
➢ Many-One Func ons
➢ Onto Func ons [Surjec ve]
➢ One-One onto Func ons [bijec ve]
4. Composi on of Func ons
5. Invertib e Function
6. Binary Operation
➢ Iden ty Opera ons
➢ Inverse Opera ons
➢ Commuta ve Opera ons
➢ Associa ve Opera ons
7. Mind Map
➢ (Colourful & Interac ve/ Complete All Concept Covered)
Prac ce Questi ns (All Topics Available)
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

PRE-INTRODUCTION OF RELATION

PRE-INTRODUCTION OF RELATION
Rela on

A relation, in mathematics, can be defin d as:

“The relationsh p between two di erent information sets.”

• In case two sets are assumed, the relatio that is going to be established between them is the
connectio between elements of two or more non-empty sets.
• Simply, a set of ordered pairs can be expressed as a Relation
• The sets, in this case, must be non-empty.
• A subset of the Cartesian product is also known to form a relatio R.
• A relation an be classifie either by the Roster method or by the Set-builder method.

Consider that A and B be are two sets. Thus, A = {2, 5, 7, 8, 10, 13} and B = {1, 2, 3, 4, 5}. Hence, it
can be represented as:

→ R = {(x, y): x = 4y – 3, x ∈ A and y ∈ B} (Set-builder form)

→ R = {(5, 2), (10, 3), (13, 4)} (Roster form)

‘A set of ordered pairs is defin d as a relation ’

Representati n of Relation

Relations can be represented by three methods:

Roster Form

All elements of given sets are arranged in one set and separated by commas within the brackets.

Set-Builder Form

In case of Set-Builder form:

• It is used when a set has infin te numbers.

Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

PRE-INTRODUCTION OF RELATION

• It’s used with integers and real numbers. etc.

• It’s a representation of a set that forms an equation

Arrow-Diagram

The relation b tween the two sets is shown by the arrows.

Functi ns

Functio s are defin d as the relatio s which give a parti ular output for a parti ular input value. A
function h s a domain and codomain (range). f(x) usually denotes a functio where x is the input of
the function In general, a function s wri en as y = f(x).

A functio is a relatio between two sets set A and set B. Such that every element of set A has an
image in set B and no element in set A has more than one image in set B.

Let A and B be two nonempty sets. A func on or mapping f from A to B is wri en as f : A → B is a

rule by which each element a ∈ A is associated with a unique element b ∈ B

Conditio for a Func on

A functio is a relatio in which a parti ular input gives a parti ular output i.e. every input value has
a parti ular output and no input value has more than one output. Now, for any two non-empty sets
A and B, a function f : A → B denotes that f is a function from A to B, where A is a domain and B is a
co-domain.

For any element, a ∈ A, a unique element, b ∈ B is there such that (a, b) ∈ f.

The unique element b which is related to a is denoted by f(a) and is read as f of a.

Verti al Line Test

Verti al line test is used to determine whether a curve is a functio or not. If any curve cuts a verti al
line at more than one point then the curve is not a functio .
Page 3
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

PRE-INTRODUCTION OF RELATION

Functi n Not Exist

The condition when the function does not exists is when all the elements of the domain are not
mapped with the codomain element if any one of the elements will be le to be mapped with the
codomain then the functio will not exist.

From the above example, we can see that all the elements of the domain are not mapped b element
is le to be mapped so in this condition our function do s not exist for this parti ular domain.

Functi n in Algebra

Functio in algebra is an equation that gives a relation between a partic lar value of input say x with
the parti ular value of output say y. A functi n is wri en as,

y = f(x)

where,

x is the independent variable,

y is the dependent variable

Page 4
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

PRE-INTRODUCTION OF RELATION

Example: Some functi ns in algebra are:

y = x + 2,

y = x2 + x + 1, etc

Domain, Codomain, and Range of a Func on

The elements of set X are called the domain of f and the elements of set Y are called the codomain
of f. The images of the elements of set X are called the range of function, which is always a subset of
Y. The image given below demonstrates the domain, codomain, and range of the function

The image demonstrates the domain, co-domain, and range of the

function. Remember the element which is mapped only will be
counted in the range as shown in the image. The domain, co-
domain, and range of the above functio are:

Domain = {a, b, c}

Co-domain = {1, 2, 3, 4, 5}

Range = {1, 2, 3}
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF RELATIONS

TYPES OF RELATIONS

Empty relatio
An empty relation (also called, void relation is a type of relatio where there is no relation between
any elements of a set. For instance, consider set A = {1, 2, 3}. Here, one of the void relation is R = {x,
y} where |x – y| = 8. Thus, for empty relatio ,

→R=φ⊂A×A

Universal relati n
A Universal (also called Full Relation is a kind of relation wherein every element of a set is related
to one another.

A universal Relatio can be expressed by, R = A × A

It’s also called Full relation because every element of Set 1 is related to
Set 2.

For example: {1, 2,3, 4...} is Set 1, consis ng of Natural Numbers. While,
{0, 1, 2, 3, 4, 5, …} is Set 2, consistin of Whole numbers. Now, the relation between Set 1 and Set 2
is Universal since the numbers of both sets are directly linked or are the same.

Refl xive relati n

For a Re exive Relatio , every element is known to map itself. For Example, consider A = {1, 4}.

Here, R = {(1, 1), (4, 4), (1, 4), (4, 1)}

Hence, the Re exive Relation is (a, a) ∈ R (reverse A) a ∈ A.

Symmetric relati n
In case of a Symmetric Relation if a = b is considered true, then b = a is also equally true as well.
Simply, a relation R is symmetric only if (b, a) ∈ R is considered to be true when (a, b) ∈ R. It is a type
of Binary Relation

Thus, for a Symmetric Relation

aRb ⇒ bRa, ∀ a, b ∈ A

Transiti e relati n
A Transiti e relation represents a relatio ship between three sets.
Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF RELATIONS

In case of a transiti e relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R.

Thus, for a transiti e relation, a b and bRc ⇒ aRc ∀ a, b, c ∈ A.

Equivalence rela on
A relatio is an Equivalence Relation if it is re exive, symmetric, and transiti e. i.e. rela on R = {(1,1),
(2,2), (3,3), (1,2), (2,1), (2,3), (3,2), (1,3), (3,1)} on set A = {1,2,3} is equivalence relatio as it is
refl xive, symmetric, and transiti e. Number of equivalence rela on in a set containing n elements
is given by Bell number.
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF FUNCTIONS

TYPES OF FUNCTIONS
An example of a simple function is f(x) = x3. In this function, f(x) takes the value of “x” and then cubes
it to fin the value of the function. For example, if the value of x is taken
to be 2, then the function gives 8 as output i.e. f(2) = 8. Some other
examples of function are:
1
f(x) = cos x, f(x) = 5x 2 + 9, f(x) = , etc.
x3

There are several types of functions in maths. Some of the important

types are:

One-One Functi n [Injec ve]

A function f : X → Y is said to be a one-to-one func on if the images of dis nct elements of X under
f are distin t. Thus, f is one to one if f(x1) = f(x2)

Property: A functio f : A → B is one-to-one if f(x1) = f(x2) implies x1 = x2, i.e, an image of a distin t
element of A under f mapping (functio ) is dis nct.

Conditio to be One-to-One func on: Every element of the domain has a single image with a
codomain a er mapping.

Many-One Functi ns
If the functio is not one to one functio then it should be many to one functio means every
element of the domain has more than one image at codomain a er mapping.

Property: One or more elements having the same image in the codomain

Conditio to be Many to One function One or more than one element in the domain having a single
image in the codomain.
Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF FUNCTIONS

Onto Functi ns [Surjec ve]

A functio f : X → Y is said to be an onto function if every element of Y is an image of some element
of set X under f, i.e for every y ∈ Y there exists an element x in X such that f(x) = y.

Properti s:

• The range of function should be equal to the codomain.

• Every element of B is the image of some element of A.

Conditio to be Onto functi n: The range of functio should be equal to the codomain.

As we see in the above two images, the range is equal to the codomain means that every element
of the codomain is mapped with the element of the domain, as we know that elements that are
mapped in the codomain are known as the range. So these are examples of the Onto func on.

One-One onto Functi ns [bijecti e]

A function f is One – One and Onto or Bijecti e if the functio f is both One to One and Onto function.
In other words, the function f associates each element of A with a distin t element of B and every
element of B has a pre-image in A.
Page 3
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF FUNCTIONS
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

COMPOSITION OF FUNCTIONS
Compositio of functi n is the building of the complex function using the simple function. Suppose
we take two functio s f(x) and g(x) which both take x as input values and give the specifi output
than the compositio of functio f(x) and g(x) when f(x) is fi st computed is, g(f(x)) of (g∘f)(x). We
can understand this concept by the following example,

Example:

If, f(x) = x2 and g(x) = x + 3. Then calculate the compositio g(f(x)) and f(g(x)).

Solution

g(f(x)) = g(x2) = x2 + 3

Similarly, we can easily calculate the f(g(x)) or (f∘g)(x) where g(x) is

computed fi st.

f(g(x)) = f(x + 3) = (x + 3)2

Noti e that g(f(x)) is not equal to f(g(x)) they can or can not be equal depending on
the function f( ) and g(x). The compositio of a functio is also called the function of
a functio . Thus, we can say that,

• For f(g(x)), g(x) is the input of the functio f(x).

• For g(f(x)), f(x) is the input of the functio g(x).

We can understand this concept with the help of the image discussed below,

Symbol of Compositi n of Func ons

The compositio of functio s is represented using the symbol ∘. We can also represent the
compositio of functi ns by simply using the parenthesis (). For any two given function f(x) and g(x)
we can fin the composition o the function by usin the formula,
Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

(f∘g)(x) = f(g(x))

The above functio is read as “f of g of x”. Here, fi st x is passed to g(x) which gives the answer in x
and then the answer is passed to f(x) to fin the desired compositi n of functio .
(g∘f)(x) = g(f(x))
The above functio is read as “g of f of x”. Here, fi st x is passed to f(x) which gives the answer in x
and then the answer is passed to g(x) to fin the desired compositi n of functio .
Finding Composite Functi n From Graph
If the functions are not given algebraically and only their graphical value is given then also they can
be easily calculated using the graphs given.
To fin the composite functio of two functi ns f(x) and g(x) whose graphs are given, then (x, y) is a
point on a function f(x) then f(x) = y. We can fin f(g(a)) (i.e., f(g(x)) at x = a) using the above
information
Step 1: Firstly fin g(a) i.e., the y-coordinate the on the graph of g(x) at x = a
Step 2: Now fin f(g(a)) i.e., the y-coordinate on the graph of f(x) at x = g(a))
This can be understood using the image discussed below,

Finding Composite Functi n From Table

Composite function or compositio of functi n can also be easily calculated using the table in which
the values of the function corresponding to a given input value are given. Let’s fin the composite
function usi g the table given below,
Example:
From the following tables of f(x) and g(x), fin g(f(1)).
Page 3
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

For f(x) the table is,

x f(x)
1 3
2 4
3 5

For g(x) the table is,

x g(x)
1 1
2 4
3 9

Solution

f(1) = 3 (from the fi st table)

g(f(1)) = g(3)

Now using the second table we can get the above value.

g(3) = 9

Thus, the required solution or g(f(1)) is 9

Functi n Compositio with Itself (Self Composition

We can also compose a function with it self and it is called a self-composite function For any given
function f( ) the func on composition with itself is f(f(x)) it is also defin d as (f∘f)(x). Now,

(f∘f)(x) = f(f(x))

It can be be er understood with the help of an example:

Example:

If f(x) = x3, then fin (f∘f)(x).

Solution

Given: f(x) = x3
Page 4
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

(f∘f)(x) = f(f(x))

= f(x3)

= (x3)3

(f∘f)(x) = x6

Domain and Range of Composi on of Func ons

It is not possible to compose any two functi ns, some function cannot be composed together, for
example, let’s say f(x) = ln(x) and g(x) = -x. If we try to compose f(g(x)), it is not possible for the
positi e value of x, as the logarithmic functi n cannot take negati e input values, so f(g(x)) is not
possible. So, there are certain things that should be kept in mind while deciding on composing the
functio .

So before composing any two function fi st we have to fin the domain and range of the functio .

Domain of Composite Functi ns

For any functio f(x) and g(x) defin d as g: X → Y and f: Y → Z then f(g(x)) is
defin d as f∘g: X → Z. i.e., the domain of f ∘ g is X and the range is Z.

If the function are defin d algebraically then also we can easily defin
their domain. To fin the domain of the composite functio use the following
steps. If we have to fi d the domain of f(g(x))

Step 1: Firstly we will nd the domain of the inner functio g(x)

Step 2: Then we fin the domain of the func on obtained by fin ing f(g(x))

Step 3: Now the intersectio of the domain of g(x) and the domain of f(g(x)) is the
domain of f(g(x))

Range of Composite Functi ns

The range of the composite functio does not get a ected by the inner functio it only depends on
the outer func on and we can easily fin the range of the composite functio using normal methods.

We can easily understand these concepts with the help of the following example.

Example:

Find the domain and range of f(g(x)) when f(x) = x+2 and g(x) = x2.
Page 5
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

Solution

For f(g(x)),

The inner functio is g(x) and its domain is A = R

Now f(g(x)) = f(x2)

f(g(x)) = x2 + 2

The domain of x2 + 2 is R (say B)

Now the intersec on of A and B is the domain of f(g(x))

Domain of f(g(x)) = A∩B = R

The range of f(g(x)) is the range of x2 + 2

Now the range is [2, ∞)

Properti s of Composition of Func on

There are various properties of the composi on of functio , some of those properties are:

Associativ ty Property: For functio s f, g, and h, the compositio of these functio s is associati e, if
and only if

(f∘g)∘h = f∘(g∘h)

Commuta ve Property: Compositio for any two function f and g, is commutati e if and only if

f∘g = g∘f

Iden ty Property: For any function f, the identi y function I(x) = x acts as the identi y element for
compositio , meaning

f∘I = I∘f = f

Inverse Property: If a functio f has an inverse functio f⁻¹, then

(f∘f⁻¹) = I = (f⁻¹∘f)

Some other properti s of the Composi on of Functio s are:

• The compositio of two or more one-one functio s (Injecti e) is always one-one.

Page 6
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

• The compositio of onto functions(s rjecti e) is always onto.

• Also, the composi on of two or more bijecti ns(one-one and onto) is always bijectio .
• The inverse function of the compositio of two invertibl functio s has the property that
(f∘g)−1 = g−1∘f−1.

Example:

For the given func ons f(x) = ex and g(x) = x2 + 1. Find out the values of f(g(x)) and g(f(x)).

Solution:

The domain of both the function are real numbers, so there is no need to modify the domain for
the fi st function i any case.

For f∘g(x),

f∘g(x) = f(g(x))

⇒ f∘g(x) = f(x2 + 1)
2
⇒ f∘g(x) = ex + 1

For g∘f(x)

g∘f(x) = g(f(x))

⇒ g∘f(x) = g(ex)

⇒ g∘f(x) = (ex)2 + 1

⇒ g∘f(x) = e2x + 1
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

INVERTIBLE FUNCTIONS

INVERTIBLE FUNCTIONS
As the name suggests Invertibl means “inverse“, and Invertibl function means the inverse of the
function. Invertibl functio s, in the most general sense, are functio s that “reverse” each other. For
example, if f takes a to b, then the inverse, f-1, must take b to a.

Invertib e Functio Defin tio

Inverse of a functio is denoted by f-1

In other words, we can defin it as, If f is a function the set of ordered pairs obtained by interchanging
the fi st and second coordinates of each ordered pair in f is called the inverse of f. Let’s understand
this with the help of an example.

Example:

function g = {(0, 1), (1, 2), (2,1)}, here we have to fin the g-1

As we know that g-1 is formed by interchanging X and Y co-ordinates.

g = {(0, 1), (1, 2), (2, 1)} → interchange X and Y, we get

g-1 = {(1, 0), (2, 1), (1, 2)}

So this is the inverse of function g

Graph of Invertible Functi n

The function is invertibl or not by plo ng on the graph. We can plot the graph by using the given
function a d check for the invertibi ity of that function, hether the functio is invertibl or not.

Example:

Find and plot the inverse of the functio f(x) = 3x + 6.

Solution

f(x) = 3x + 6

y = 3x + 6
Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

INVERTIBLE FUNCTIONS

Interchange x with y

x = 3y + 6

x – 6 = 3y
x– 6
y =
3
x
y = –2
3
x
Thus, f −1 (x) = –2
3

1
Now let’s plot the graph for f-1(x). The inverse of a function having intercept and slope 3 and
3
respecti ely.

A function and its inverse will be symmetric around the line y = x. Then the function is said to be
invertibl . So let’s draw the line between both the function and the inverse of the function and check
whether it separated symmetrically or not.
Page 3
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

INVERTIBLE FUNCTIONS

A er drawing the straight line y = x, we observe that the straight line intersects the line of both of
the functions symmetrically. So, the function f(x) is an invertibl func on and in this way, we can plot
the graph for an inverse functio and check the invertibi ity.

Conditio s for the Func on to Be Invertibl

Condition To prove the function to be invertibl , we need to prove that, the function is both One to
One and Onto, i.e, Bijecti e.

Explanatio

We can say the func on is One to One when every element of the domain has a single image with a
codomain a er mapping. We can say the function is Onto when the Range of the functio should be
equal to the codomain. When we prove that the given functio is both One to One and Onto then
we can say that the given functio is invertibl . Let’s see some examples to understand the conditio
properly.

Example:
x–2
Let A: R – {3} and B: R – {1}. Consider the function f ∶ A → B defin d by f(x) = . Show that
x–3
function f( ) is invertibl and hence nd f-1.

Solution

To show the functio is invertibl , we have to verify the condition of the functio to be inverti le as
we discuss above. To show that the function is invertibl we have to check fi st that the function is
One to One or not so let’s check.

Let x, y ∈ A such that f(x) = f(y)

(x – 2) y – 2
⇒ =
(x – 3) y – 3

⇒ (x - 2) (y - 3) = (x - 3) (y - 2)

⇒ xy - 3y - 2y + 6 = xy - 2x - 3y + 6

⇒ -3x + 2y + 6 = xy – 2x – 3y + 6

⇒ -3x + 2x = -3 + 2y

⇒ -x = -y

⇒x=y

Since f(x) = f(y) ⇒ x = y, ∀x, y ∈ A, so function s One to One.

Page 4
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

INVERTIBLE FUNCTIONS

We have proved the function to be One to One. Now let’s check for Onto. To show that f(x) is onto,
we show that range of f(x) = its codomain.
x–2
Let y =
x–3

Put f(x) = y.

⇒ xy - 3y = x - 2

⇒ xy - x = 3y - 2

⇒ x(y - 1) = 3y - 2
3y – 2
⇒ x = … (1)
y −1
Since x ∈ R – {3}, ∀ y belongs to R – {1}, so range of f is given as = R – {1}. Also
codomain of f = R – {1}.

Therefore, Range = Codomain ⇒ f is Onto functio

As both condition are sa sfie functio is both One to One and Onto, Hence
function f(x) is Invertibl . Now as the question asked a er proving functio
Invertibl we have to nd f-1

from eq. (1) we get,

3y – 2
f −1 (y) =
y– 1
3x – 2
→ f −1 (x) =
y–1
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

BINARY OPERATIONS

BINARY OPERATIONS
The binary operation c n be understood as an operation which is performed on the two elements p
& q from the set X. Thus, the binary operation p rformed on operands p and q is symbolized as p*q.
The function is given by *:AAA. The result of the operatio on p and q is another element from the
same set X.

Example 1:

Show that addition, subtraction and multiplication are binary operations on

R, but division is not a binary operation on R. Further, show that division is
binary operation on the set R of non-zero real numbers.

Solution:

+: R × R → R is given by +(a, b) → a + b
-: R × R → R is given by -(a, b) → a - b
: R × R → R is given by (a, b) → ab
Since +, - and are functions, they are binary operations on R.
a
But: R × R → R, given by (a, b) is not a function and hence not a binary operation, as
b
a
for b = 0, is not defined.
b
a
However, R × R → R is given by (a, b) is a function and hence a binary operation on set R of non
b
zero real numbers.
Example 2:

Show that the operation: R × R → R given by (p, q) max {p, q} and the operation: R × R → R given by
(p, q) min {p, q} are binary operations.
Solution:

Since, pq = max of p and q; p, qR

Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

BINARY OPERATIONS

pq will give output as either p or q.

Hence, pq R. Therefore, is a binary operation.

Also, pq = min of p and q, p, qR

pq will give output as either p or q.

Hence, pq R. Therefore, is a binary operation.

Identity perati ns
An element eX is called the identity of the operation *: XXX, if a*e = a = e*a, for every element aX.

Example: 0 and 1 are the identities for addition and multiplication operation on the set of real
numbers. There is no identity for subtraction and division operations on .

Inverse Operati ns
For a binary operation * on a non-empty set X, let e be the identity element. If aX, then a is invertible
if there exists an element bX such that a*b = b*a = e.

1
Example: is the inverse of a0 of the multiplication operation () on but it's not an inverse of X on
a
the set of natural numbers .

Commutati e Operati ns
A binary operation * is commutative on the set X, if a * b = b * a for every a, bX.

Example: Addition and multiplication are commutative binary operations, but subtraction and
division are not.

Associati e Operati ns
A binary operation on set X is associative if for every a, b, cX, a*(b*c) = (a*b)*c

Example: Addition and multiplication are associative binary operations on the

set of real numbers, but subtraction and division are not.
 Relations and Functions

DPP-01

[Topic: Relations]

Multiple Choice Questions (MCQs)

1. Number of relations possible in set A having 3 elements will be

(a) 26
(b) 29
(c) 28
(d) 23
2. Number of relations possible in set A = {2,4,7,9} is given by
(a) 210
(b) 28
(c) 212
(d) 216
3. A relation 𝑅 is defined from set 𝐴 = {1,2,3} to set 𝐵 = {4, 5,6,7}. Number of relations possible
from set A to set 𝐵 will be
(a) 27
(b) 28
(c) 212
(d) 210
4. A relation 𝑅 is defined in set 𝐴 = {1,3,5,7,9} such that R = {(𝑎, 𝑏): 𝑎 + 𝑏 ≤ 10}𝑎 ∈ A, 𝑏 ∈ A}.
Domain of the relation 𝑅 is given by
(a) {1,3,5,8,9}
(b) {1,3,5,7,9}
(c) {1,3,6,7,9}
(d) {1,6,7,9,5}

Short Answer Type Questions-I

1. A relation 𝑅 is defined from set 𝐴 = {1,3,4,5} to set B = {2,4,6} as R = {(𝑎, 𝑏): 𝑏 is divisible by
𝑎}. Here, 𝑎 ∈ A and 𝑏 ∈ B. Write the relation R in
(i) Roster form
(ii) domain of R and
(iii) Range of the relation R
 Relations and Functions

DPP-02

[Topic: Types of Relations]

Multiple Choice Questions (MCQs)

1. R is a relation over the set N × N and it is defined by (𝑎, 𝑏)R(𝑐, 𝑑) ⇒ 𝑎 + 𝑑 = 𝑏 + 𝑐, then R is

(a) reflexive only
(b) symmetric only
(c) transitive only
(d) equivalence relation
2. Let R be a relation over the set of straight lines in a plane such that 𝑙1 R𝑙2 such that 𝑙1 ⊥ 𝑙2 , then R
is
(a) symmetric
(b) reflexive
(c) transitive
(d) equivalence relation
3. A relation R is defined on plane A of triangles in a given planes defined as R = {(T1 , T2 ): T1 ≅
T2 and T1 , T2 ∈ A}, then 𝑅 is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
4. Consider the non-empty set consisting of children in a family and a relation 𝑅 defined as 𝑎R𝑏 if
𝑎 is a brother of b. Then 𝑅 is
(a) symmetric but not transitive
(b) transitive but not symmetric
(c) neither symmetric nor transitive
(d) both symmetric and transitive.
5. Let 𝑅 be the relation on the set 𝑅 of all real numbers defined by 𝑎R𝑏 iff |𝑎 − 𝑏| ≤ 1. Then R is
(a) reflexive and symmetric
(b) symmetric only
(c) transitive only
(d) anti symmetric only
6. A relation R = {(𝑎, 𝑏): 𝑎 divides 𝑏} on the set N of all natural numbers is
(a) reflexive
(b) symmetric
(c) reflexive and transitive
(d) symmetric and transitive
7. Let R be a relation on the set N defined by {(𝑥, 𝑦) : 𝑥, 𝑦 ∈ N, 2𝑥 + 𝑦 = 41}. Then R is
(a) reflexive
(b) symmetric
 (c) transitive
(d) None of these.
8. Let S be the set of all real numbers. Then the relation R = {(𝑎, 𝑏): 1 + 𝑎𝑏 > 0} on 𝑆 is
(a) reflexive and symmetric but not transitive.
(b) reflexive and transitive but not symmetric.
(c) symmetric and transitive but not reflexive.
(d) reflexive, symmetric and transitive.
9. Let 𝑊 denote the words in the English dictionary. The relation R is defined by R = {(𝑥, 𝑦) ∈
W × W : the words 𝑥 and 𝑦 have at least one letter in common}. Then 𝑅 is
(a) not reflexive, symmetric and transitive
(b) reflexive, symmetric and not transitive
(c) reflexive, symmetric and transitive
(d) reflexive, transitive and not symmetric
10. On the set N of all natural numbers define the relation 𝑅 by 𝑎𝑅𝑏 if and only if the G.C.D. of 𝑎
and 𝑏 is 2, then 𝑅 is
(a) reflexive but not symmetric
(b) symmetric only
(c) reflexive and transitive
(d) reflexive, symmetric and transitive.

Very Short Answer Type Questions

1. State the reason why the relation 𝑅 = {(𝑎, 𝑏): 𝑎 ≥ 𝑏 2 } defined in the set of real numbers is not
reflexive.
2. State the reason of the relation 𝑅 in the set {1,2,3} given by: R = {(1,2), (2,1)} not to be
transitive.
3. If R = {(𝑥, 𝑦): 𝑥 + 2𝑦 = 8} is a relation on N. Write the domain of 𝑅.
4. Let 𝑅 be the equivalence relation in the set A = {0,1,2,3,4,5} given by R = {(𝑎, 𝑏): 2 divides
(𝑎 − 𝑏); 𝑎, 𝑏 ∈ A}. Write the equivalence class of [0].
5. Let 𝐴 = {1,2,3,4} and 𝑅 be a relation in set 𝐴 given by
𝑅 = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,1), (3,1), (1,3)} then show that the relation 𝑅 is reflexive
and symmetric.
6. Show that the relation 𝑅 less than in the set of natural numbers is transitive.
7. For real numbers 𝑥 and 𝑦, we write 𝑥𝑅𝑦 ⇒ 𝑥 − 𝑦 + √2 is an irrational number, then show that
the relation 𝑅 is reflexive.
8. State the reason why a relation R = {(𝑎, 𝑏): 𝑎 > 𝑏, 𝑎, 𝑏 ∈ real numbers} defined in the set of real
numbers, is transitive.
9. A relation 𝑅 = {(𝑥, 𝑦): 𝑥 + 𝑦 < 10; 𝑥, 𝑦 ∈ 𝐴} defined in the set 𝐴 = {1,2,3,4}. Is relation 𝑅
symmetric? Give reason.
 10. Take a relation R = {(𝑎, 𝑏): 𝑎 = 𝑏, 𝑎, 𝑏 ∈ A} defined on a set 𝐴 of real numbers. Is 𝑅 a reflexive
relation? Give reason.

Short Answer Type Questions-I

1. If set 𝐴 = {1,2,3,4}, set 𝐵 = {𝑎, 𝑏, 𝑐, 𝑑} and relation 𝑅 = {(1, 𝑎), (2, 𝑏), (3, 𝑐), (4, 𝑑)} is a
relation defined from set A to set B. Write relation R−1 .
2. A relation 𝑅 defined in set 𝐴 = {1,2,3, … ,10} as R = {(𝑥, 𝑦): 3𝑥 − 𝑦 = 0, 𝑥, 𝑦 ∈ A}. Show that
the relation is not reflexive.
3. Let A = {𝑎, 𝑏, 𝑐} and a relation R is defined in set A as: R = {(𝑎, 𝑎), (𝑏, 𝑐), (𝑎, 𝑏)}. Write the
minimum number of ordered pairs be included in relation 𝑅 to make it reflexive and symmetric.
4. Check whether the relation 𝑅 defined in the set 𝐴 = {1,2,3, 4,5,6} as R = {(𝑥, 𝑦): 𝑦 = 𝑥 +
1, 𝑥, 𝑦 ∈ 𝐴} is reflexive or symmetric.
5. Show that the relation: ℝ = {(1,2), (2,3), (3,2), (1,3), (2,1), (2,2), (3,3), (3,1), (1,1)} is
reflexive, symmetric and transitive.
6. Show that the relation: 𝑅 = {(1,1), (1,2), (2,1), (2,2)} is reflexive, symmetric and transitive.
7. Show that the relation: ℝ = {(1,1), (3,3), (5,5), (1,3), (3,1), (3,5)} is reflexive and is neither
symmetric nor transitive.
8. Take a set 𝐴 = {1,3,7} and find a relation 𝑅 = 𝐴 × 𝐴, then show that it is reflexive, symmetric
and transitive.
9. Relation 𝑅 defined in a set of natural numbers 𝑁 as: 𝑅 = {(𝑥, 𝑦): 𝑥 > 𝑦∀𝑥, 𝑦 ∈ N}. Show that R
is transitive and it is neither reflexive nor symmetric.
10. Relation 𝑅 defined in a set of natural numbers 𝑁 as: R = {(𝑥, 𝑦): 𝑥 ≥ 𝑦∀𝑥, 𝑦 ∈ N}. Show that
relation R is reflexive and transitive but not symmetric.
11. Relation R defined in a set of natural numbers N as: R = {(𝑎, 𝑏): (𝑎 + 𝑏) is an even natural
number, where 𝑎, 𝑏 ∈ 𝑁}. Show that 𝑅 is reflexive, symmetric and transitive.
12. Relation 𝑅 defined in a set of natural numbers 𝑁 as: R = {(𝑎, 𝑏): (𝑎 − 𝑏) is an even natural
number and 𝑎, 𝑏 ∈ 𝑁}. Show that 𝑅 is neither reflexive nor symmetric but transitive.
13. Relation 𝑅 defined in a set of real numbers 𝑅 as:
R = {(𝑥, 𝑦): (𝑥 + 𝑦) is divisible by 5∀𝑥, 𝑦 ∈ R}. Show that 𝑅 is neither reflexive nor transitive
but symmetric.
Note: In a set of real numbers 𝑅, if relation 𝑅 = {(𝑎, 𝑏) : (𝑎 + 𝑏) is a multiple of
3,4,5,6, … , 𝑛∀𝑎, 𝑏 ∈ R} then R is neither reflexive nor transitive but symmetric.
14. Show that the relation 𝑅 in set 𝐴 = {1,2,3} given by ℝ = {(1,1), (2,2), (3,3), (1,2), (2,3)} is
reflexive but neither symmetric nor transitive.
15. Let 𝐿 be the set of lines in a plane and 𝑅 be the relation in I defined as: 𝑅 = {(𝐿1 , 𝐿2 ): 𝐿1 is
perpendicular to 𝐿2 , 𝐿1 and 𝐿2 ∈ 𝐿 }. Show that 𝑅 is symmetric but neither reflexive nor
transitive.
Short Answer Type Questions-II
1. Let 𝑇 be the set of all the triangles in a plane with 𝑅 a relation in 𝑇 given by: R = {(T1 , T2 ): T1 is
congruent to 𝑇2 , 𝑇1 and 𝑇2 ∈ 𝑇}. Show that 𝑅 is an equivalence relation.
2. Show that the relation 𝑅 in the set 𝐴 of all the books in a library of a college given by 𝑅 =
{(𝑥, 𝑦): 𝑥 and 𝑦 have the same number of pages and 𝑥, 𝑦 ∈ A} is an equivalence relation.
3. Show that each of the relation 𝑅 in the set 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12} given by
(A) R = {(𝑎, 𝑏): |𝑎 − 𝑏| is a multiple of 4 and 𝑎, 𝑏 ∈ A}
(B) R = {(𝑎, 𝑏): 𝑎 = 𝑏 and 𝑎, 𝑏 ∈ A}
are equivalence relations.
Find the set of all elements related to 1 in each case.
4. Show that the relation 𝑅 in the set 𝐴 of points in a plane given by: R = {(𝑝, 𝑞) : distance of the
point 𝑝 from the origin is same as the distance of the point 𝑞 from the origin} is an equivalence
relation. Further, show that the set of all points related to a point 𝑝 ≠ (0,0) is the circle passing
through 𝑝 with origin as centre.
5. Show that the relation 𝑅 defined in the set 𝐴 of all triangles as: 𝑅 = {(𝑇1 , 𝑇2 ): 𝑇1 is similar to 𝑇2
and 𝑇1 , 𝑇2 ∈ 𝑇} is an equivalence relation. Consider three right angled triangles T1 with sides
3,4,5, T2 with sides 5,12,13 and T3 with sides 6,8,10. Which triangles among T1 , T2 and T3 are
related?
6. Show that the relation 𝑅 defined in the set 𝐴 of all polygons as: 𝑅 = {(𝑃1 , 𝑃2 ): 𝑃1 and 𝑃2 have the
same number of sides } is an equivalence relation. What is the set of all the elements in 𝐴 related
to the right angled triangle 𝑇 with sides 3,4 and 5?
7. Let 𝐿 be the set of all lines in the XY plane and 𝑅 be the relation in L defined as: R =
{(L1 , L2 ): L1 is parallel to L2 and 𝐿1 , 𝐿2 ∈ 𝐿 }. Show that 𝑅 is an equivalence relation. Find the
set of all lines related to line 𝑦 = 2𝑥 + 4.
8. Prove that the relation 𝑅 in the set 𝐴 = {1,2,3,4,5} given by R = {(𝑎, 𝑏): |𝑎 − 𝑏| and 𝑎, 𝑏 ∈ A is
an even number } is an equivalence relation.
9. Show that the relation 𝑆 in the set 𝑅 of real numbers defined as: S = {(𝑎, 𝑏): 𝑎, 𝑏 ∈ ℝ and
𝑎 ≤ 𝑏 3 } is neither reflexive nor symmetric nor transitive.
10. Let 𝑅 be a relation defined on the set of natural numbers N as follows:
R = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ N and 2𝑥 + 𝑦 = 24}

Find the domain and range of the relation 𝑅. Also find 𝑅 is an equivalence relation or not.

Long Answer Type Questions

1. Let N denote the set of all natural numbers and R be the relation on N × N defined by
(𝑎, 𝑏)R(𝑐, 𝑑) if 𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑). Show that R is an equivalence relation.
2. Let 𝑛 be a fixed positive integer. Define a relation R in Z as follows ∀𝑎, 𝑏 ∈ Z, 𝑎R𝑏 if and only if
(𝑎 − 𝑏) is divisible by 𝑛. Show that 𝑅 is an equivalence relation.
3. If 𝑅 and 𝑆 are equivalence relation in set 𝐴, show that R ∩ S is also an equivalence relation.
4. Let 𝑅 be a relation defined as
R = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ N and 2𝑥 + 𝑦 = 41}

Find the domain and range of 𝑅 also verify that 𝑅 is neither reflexive, nor symmetric nor
transitive.

5. Given the relation 𝑅 = {(1,2), (2,3)} in set 𝐴 = {1,2,3}. Find the minimum number of ordered
pairs which when added to R makes it an equivalence relation.
6. Give an example to show that union of two equivalence relation on set 𝐴 is not necessarily
equivalence on 𝐴.
7. Let R be a relation defined in N × N defined by:

R = {(𝑎, 𝑏)R(𝑐, 𝑑) if and only if 𝑎𝑑 = 𝑏𝑐 and 𝑎, 𝑏, 𝑐,

𝑑 ∈ N}

Prove that 𝑅 is an equivalence relation.

8. Let R be a relation on the set of integers given by 𝑎R𝑏 ⇒ 𝑎 = 2K 𝑏 for some integer K. Show that
R is an equivalence relation.
 Relations and Functions

DPP-03

[Topic: Functions]

Multiple Choice Questions (MCQs)

1. A function 𝑓: N → N defined as 𝑦 = 𝑥 2 is
(a) one-one
(b) onto
(c) bijective
(d) None of these.
2. Domain of the function: 𝑓: R → R defined as 𝑦 = 𝑥 + 4 is
(a) Real numbers
(b) Natural numbers
(c) Negative real numbers
(d) None of these.
3. Domain of a real valued function 𝑓(𝑥) = √36 − 𝑥 2 is:
(a) [−6,6]
(b) (−6,6)
(c) (−6,6]
(d) [−6,6)
4. Number of functions from set {1,2} into set {𝑎, 𝑏, 𝑐} are
(a) (2)3
(b) (3)2
(c) (2)2
(d) (3)3
5. Number of one-one functions that can be defined from a set {3,4,5} into a set {1,2} are
(a) 2 P3
(b) 0
(c) 2 P2
(d) 3 P3
6. The function 𝑓: R → [−1,1] defined by 𝑓(𝑥) = cos 𝑥 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. Every function is a
(a) relation.
(b) onto function
(c) injective function
(d) bijective function
 8. A function which is injective and surjective is called
(a) onto function only
(b) bijective function
(c) one-one function
(d) None of these.
9. An onto function from set 𝐴 to set 𝐵 means every element of set 𝐵 has a pre-image in
(a) Set B × 𝐴
(b) Set A
(c) Set 𝐴 × 𝐵
(d) None of these.
10. A function 𝑓: R → R is defined as 𝑓(𝑥) = 𝑥 3 + 1. Then the function has
(a) no minimum value
(b) no maximum value
(c) both maximum and minimum value
(d) neither maximum value nor minimum value

Short Answer Type Questions-I

1. A function 𝑓: 𝑁 → 𝑁 is given by 𝑓(𝑥) = 2𝑥 + 3. Show that 𝑓(𝑥) is one-one but not onto.
2. A function 𝑓: 𝑍 → 𝑍 is given by 𝑓(𝑥) = 2𝑥 + 3. Show that 𝑓(𝑥) is one-one but not onto.
3. A function 𝑓: Q → Q is defined as 𝑓(𝑥) = 2𝑥 + 3. Show that 𝑓(𝑥) is one-one and onto.
4. A function 𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 2𝑥 + 3. Show that 𝑓(𝑥) is one-one and onto.
5. A function 𝑓: N → N is defined as 𝑓(𝑥) = 2𝑥 2 + 3. Show that 𝑓(𝑥) is one-one but not onto.
6. A function 𝑓: ℝ → ℝ is defined as 𝑓(𝑥) = 2𝑥 2 + 3. Show that 𝑓(𝑥) is neither one-one nor onto.
7. A function 𝑓: N → N is defined as 𝑓(𝑥) = 2𝑥 3 + 3. Show that 𝑓(𝑥) is one-one but not onto.
8. A function 𝑓: R → R is defined as 𝑓(𝑥) = 2𝑥 3 + 3. Show that 𝑓(𝑥) is one-one and onto.
9. Write Domain and Range of modulus function.
10. Write Domain and Range of signum function.
11. Write Domain and Range of the greatest integer function 𝑓: 𝑅 → 𝑅 and 𝑓(𝑥) = [𝑥]

Short Answer Type Questions-II

1. Let A be the set of all 50 students of Class X in a school. Let 𝑓: A → N be a function defined by
𝑓(𝑥) = roll numbers of the student 𝑥. Show that 𝑓 is one-one, but not onto.
2. Show that the function 𝑓: N → N given by 𝑓(𝑥) = 2𝑥, is one-one but not onto.
3. Prove that the function 𝑓: R → R given by 𝑓(𝑥) = 2𝑥, is one-one and onto.
4. Show that the function 𝑓: N → N given by 𝑓(1) = 𝑓(2) = 1 and 𝑓(𝑥) = 𝑥 − 1 for every 𝑥 > 2
is onto but not one-one.
 𝑥 + 1 if 𝑥 is odd
5. Show that 𝑓: N → N given by 𝑓(𝑥) = �
𝑥 − 1 if 𝑥 is even
1
6. Show that the function defined by 𝑓: R + → R + and given by 𝑓(𝑥) = is one-one and onto, where
𝑥
𝑅, is the set of allnon- zero positive real numbers. Is the result true, if the domain 𝑅+ is replaced by 𝑁
with co-domain being same as 𝑅+ ?
7. Prove that the greatest integer function 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = [𝑥], is neither one-one nor
onto, where [𝑥] denotes the greatest integer less than or equal to 𝑥.
8. Show that the signum function 𝑓: 𝑅 → 𝑅 given by
9. Let A = {3,7,9}, B = {2,4,10} and let 𝑓 = {(3,2), (7,4), (9,10)} be a function from 𝐴 to 𝐵.
Show that 𝑓 is one-one.
10. In a function given below, state whether the function is one-one, onto or bijective. Justify your
answer. 𝑓: ℝ → ℝ defined by 𝑓(𝑥) = 1 + 𝑥 2 .
11. Let A and B be two sets. Show that 𝑓: A × B → B × A such that 𝑓(𝑎, 𝑏) = (𝑏, 𝑎) is bijective
function.
𝑥−2
12. Let 𝐴 = 𝑅 − {3} and 𝐵 = 𝑅 − {1}. Consider the function 𝑓: A → B defined by 𝑓(𝑥) = � �. Is
𝑥−3
fone-one and onto? Justify your answer.
13. Let A = {−1,0,1,2}, B = {−4, −2,0,2} and 𝑓, 𝑔 : A → B be functions defined by 𝑓(𝑥) = 𝑥 2 −
1
𝑥, 𝑥 ∈ A and 𝑔(𝑥) = 2 �𝑥 − � − 1, 𝑥 ∈ A. Are 𝑓 and 𝑔 equal? Justify your answer.
2
[Hint: One may note that two functions 𝑓: 𝐴 → 𝐵 and 𝑔 : A → B such that 𝑓(𝑎) = 𝑔(𝑎)∀𝑎 ∈ A,
are called equal functions].
14. Find the Domain and Range of each of the following functions.
(i) 𝑓(𝑥) = ��𝑥, √4 − 𝑥 2 �: 𝑥 ∈ R�.
𝑥 2 −9
(ii) 𝑓(𝑥) = ��𝑥, � : 𝑥 ∈ 𝐑 and 𝑥 ≠ 3}
𝑥−3
(iii) 𝑓(𝑥) = {(𝑥, 𝑥 − |𝑥|): 𝑥 ∈ 𝐑}
2
(iv) 𝑓(𝑥) = ��𝑥, 2 � : 𝑥 ∈ 𝐑�
4−𝑥
𝑥+1
if 𝑥 is odd
15. Let 𝑓: N → N be defined as 𝑓(𝑥) = �𝑥 2 𝑥 ∈ 𝑁. State whether function 𝑓 is
if 𝑥 is even
2
bijective.
16. Let 𝑓: X → Y be a function. Determine a relation R in X given by R = {(𝑎, 𝑏): 𝑓(𝑎) = 𝑓(𝑏)}.
Show that R is an equivalence relation.
17. Show that the function 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = 𝑎𝑥 + 𝑏, where 𝑎, 𝑏 ∈ R, 𝑎 ≠ 0 is bijective.
18. If 𝑓: 𝑅 → 𝑅 be the function defined by 𝑓(𝑥) = 4𝑥 3 + 7. Show that 𝑓(𝑥) is bijective.
19. Show that the function 𝑓: W → W defined by

Long Answer Type Questions

1. Show that the modulus function 𝑓: R → R given by 𝑓(𝑥) = |𝑥| is neither one-one nor onto,
where |𝑥| is 𝑥 if 𝑥 is positive or 0 and |𝑥| is (−𝑥), if 𝑥 is negative.
2. Let the function 𝑓: R → [−1,1] defined by 𝑓(𝑥) = cos 𝑥, ∀ 𝑥 ∈ R. Show that 𝑓(𝑥) is neither
one-one nor onto.
1
3. Let 𝑓: 𝑅 → 𝑅 be the function defined as 𝑓(𝑥) = , ∀𝑥 ∈ 𝐑. Find the range of 𝑓(𝑥).
2−cos 𝑥
𝑥
4. If 𝑓: [0, ∞) → [0, ∞) and 𝑓(𝑥) = , then prove that 𝑓(𝑥) is one-one but not onto.
1+𝑥

5. Let 𝑓: 𝑅 → 𝑅 be a function defined by 𝑓(𝑥) = 2𝑥 3 + 5, then show that 𝑓(𝑥) is bijective.

6. Find the domain of the function:
1
(i) 𝑓(𝑥) =
�𝑥−|𝑥|
1
(ii) 𝑓(𝑥) =
�𝑥+|𝑥|

7. Find the domain:

(i) 𝑓(𝑥) = cos−1 (3𝑥 − 1)
sin−1 𝑥
(ii) 𝑓(𝑥) =
𝑥
(iii) 𝑓(𝑥) = sin−1 (log 2 𝑥)
 Relations And Functions
Previous Year Questions (Topic-wise)

1. RELATIONS AND ITS TYPES

Objective Qs (1 mark)
1. Let R be a relation in the set N given by 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏 − 2, 𝑏 > 6}, then:
(a) (2,4) ∈ 𝑅
(b) (3,8) ∈ 𝑅
(c) (6,8) ∈ 𝑅
(d) (8,7) ∈ 𝑅
[CBSE Term-1 SQP 2021]

2. 𝐴 = {1,2,3,4}. A relation 𝑅 in the set 𝐴 is given by 𝑅 = {(1,1), (2,3), (3,2), (4,3), (3,4)}, then relation
𝑅 is:
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
[Delhi Gov. Term-1 SQP 2021]

3. Let set 𝑋 = {1,2,3} and a relation 𝑅 is defined in 𝑋 as 𝑅 = {(1,3), (2,2), (3,2)}, then minimum ordered
pairs which should be added in relation R to make it reflexive and symmetric are:
(a) {(1,1), (2,3), (1,4)}

(b) {(5,3), (3,1), (1,2)}

(c) {(1,1), (3,3), (3,1), (2,3)}

(d) {(1,1), (3,3), (3,1), (1,2)}

[CBSE Term-1 2021]

4. If 𝑅 = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ 𝑍, 𝑥 2 + 𝑦 2 ≤ 4} is a relation in set 𝑍. Then domain of 𝑅 is:

(a) {0,1,2}
(b) {−2, −1,0,1,2}
(c) [0, −1, −2]
(d) {−1,0,1}
[CBSE Term-1 2021]

5. A relation 𝑅 is defined on 𝑁. Which of the following is the reflexive relation?

 (a) R = {(𝑥, 𝑦): 𝑥 > 𝑦; 𝑥, 𝑦 ∈ N}

(b) R = {(𝑥, 𝑦): 𝑥 + 𝑦 = 10; 𝑥, 𝑦 ∈ N}

(c) R = {(𝑥, 𝑦): 𝑥𝑦 is the square number; 𝑥, 𝒚 ∈ N} (d) 𝑅 = {(𝑥, 𝑦): 𝑥 + 4𝑦 = 10; 𝑥, 𝑦 ∈ 𝑁}

[CBSE Term-1 2021]

6. The number of equivalence relations in the set {1,2,3} containing the elements (1,2) and (2,1) is:
(a) 0
(b) 1
(c) 2
(d) 3
[CBSE Term-1 2021]

7. A relation 𝑅 is defined on 𝑍 as: 𝑎R𝑏 if and only if 𝑎2 − 7𝑎𝑏 + 6𝑏 2 = 0

Then, 𝑅 is:

(a) reflexive and symmetric

(b) symmetric but not reflexive

(c) transitive but not reflexive

(d) reflexive but not symmetric

[CBSE Term-1 2021]

Very Short & Short Qs (𝟏 - 3 marks)

8. Let 𝑅 be the equivalence relation on the set 𝑍 of integers given by 𝑅 = {(𝑎, 𝑏): 2 divides 𝑎 − 𝑏}. Write
the equivalence class {0}.
[CBSE 2021]

9. Check if the relation 𝑅 in the set 𝑅 of real numbers defined as 𝑅 = {(𝑎, 𝑏): 𝑎 < 𝑏} is:
(A) symmetric;

(B) transitive

[CBSE 2020]

10. Let 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}. Show that R = {(𝑎, 𝑏): 𝑎, 𝑏 ∈ A, |𝑎 − 𝑏| is divisible by 4} is an

equivalence relation. Find the set of all elements related to 1. Also, write the equivalence class [2].
[CBSE 2018]

11. If 𝑅 = {(𝑥, 𝑦): 2𝑥 + 𝑦 = 8} is a relation on 𝑁, write the range of 𝑅.

 [CBSE 2014]

12. Let 𝑅 = {(𝑎, 𝑎3 ): 𝑎 is a prime number less than 5} be a relation. Find the range of 𝑅.
[CBSE 2014]

13. Let 𝑅 be a relation defined on the set of natural numbers 𝑁 as 𝑅 = {(𝑥, 𝑦): 𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 and 2𝑥 + 𝑦 =
24}. Then, find the domain and range of the relation 𝑅.
Also, find whether 𝑅 is an equivalence relation or not.

[CBSE 2014]

Long Qs (𝟒 - 5 marks)

14. Let N be the set of all natural numbers and R be a relation on N × N defined by
(𝑎, 𝑏)R(𝑐, 𝑑) ⇔ 𝑎𝑑 = 𝑏𝑐 for all (𝑎, 𝑏), (𝑐, 𝑑) ∈ N × N. Show that R is an equivalence relation on
N × N. Also, find the equivalence class of (2,6), i.e., [(2,6)].

[CBSE SQP 2023]

15. Given a non-empty set 𝑋, define the relation 𝑅 in 𝑃(𝑋) as follows:

For 𝐴, 𝐵 ∈ 𝑃(𝑋), (𝐴, 𝐵) ∈ 𝑅 if 𝐴 ⊂ 𝐵. Prove that 𝑅 is reflexive, transitive and not symmetric.

[CBSE SQP 2022]

16. Define the relation 𝑅 in the set 𝑁 × 𝑁 as follows:

For (𝑎, 𝑏), (𝑐, 𝑑) ∈ N × N, (𝑎, 𝑏)R(𝑐, 𝑑) if 𝑎𝑑 = 𝑏𝑐. Prove that 𝑅 is an equivalence relation in N × N.

[CBSE SQP 2022]

17. Show that the relation 𝑆 in the set 𝐴 = [𝑥 ∈ 𝑍 : 0 ≤ 𝐗 ≤ 12] given by 𝑆 = [(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝑍, |𝑎 − 𝑏| is
divisible by 3 ] is an equivalence relation.
[CBSE 2019]

18. Let 𝐍 denote the set of all natural numbers and R be a relation on N × N defined by (𝑎, 𝑏)R(𝑐, 𝑑) if
𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑). Prove that 𝑅 is an equivalence relation.
[CBSE 2015]

19. Show that the relation 𝑅 in the set 𝐴 = {1,2,3,4,5} given by 𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| is divisible by 2} is an
equivalence relation. Write all the equivalence classes of 𝑅.
[CBSE 2015]
 2. FUNCTIONS AND ITS TYPES

Objective Qs (1 mark)
20. Let A = {1,2,3, … , 𝑛} and B = {𝑎, 𝑏}. Then the number of surjections from 𝐴 to 𝐵 is:
(a) 𝑛 P2
(b) 2𝑛 − 2
(c) 2𝑛 − 1
(d) None of these
[Delhi Gov. SQP 2022]

21. Let 𝑋 = {𝑥 2 : 𝑥 ∈ 𝑁} and the function 𝑓: 𝑁 → 𝑋 is defined by 𝑓(𝑥) = 𝑥 2 , 𝑥 ∈ 𝑁. Then this function is:
(a) injective only
(b) not bijective
(c) surjective
(d) bijective
[CBSE Term-1 2021]

22. A function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 2 + 𝑥 2 is:

(a) not one-one

(b) one-one

(c) not onto

(d) neither one-one nor onto

[CBSE Term-1 2021]

23. The function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 4 + 3cos 𝑥 is:

(a) bijective
(b) one-one but not onto
(c) onto but not one-one

(d) neither one-one nor onto

[CBSE Term-1 2021]

24. The number of functions defined from {1,2, 3,4,5} → {𝑎, 𝑏} which are one-one is:
(a) 5
(b) 3
(c) 2
(d) 0
[CBSE Term-1 2021]
 1
25. Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = , 𝑥 ∈ 𝑅. Then 𝑓 is:
𝑥
(a) one-one
(b) onto
(c) bijective
(d) f is not defined
[CBSE Term-1 2021]

26. Assertion (A): The relation 𝑓: {1,2,3,4} → {𝑥, 𝑦, 𝑧, 𝑝} defined by 𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧)} is a
bijective function.
Reason (R): The function 𝑓: {1,2,3} → {𝑥, 𝑦, 𝑧, 𝑝} such that 𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧)} is one-one.

[CBSE SQP 2023]

Very Short & Short Qs (1 - 3 marks)

27. Let 𝑓: N → N be defined as:
𝑛+1
, if 𝑛 is odd
𝑓(𝑛) = �𝑛2 for all 𝑛 ∈ 𝑁.
, if 𝑛 is even
2

Find whether the function 𝑓 is bijective or not.

[Delhi Gov. SQP 2022]

28. Let 𝑓: 𝑋 → 𝑌 be a function. Define a relation 𝑅 on 𝑋 given by 𝑅 = {(𝑎, 𝑏): 𝑓(𝑎) = 𝑓(𝑏)}. Show that 𝑅
is an equivalence relation on 𝑋.
[Delhi Gov. SQP 2022]

29. Prove that the function 𝑓 is surjective, where 𝑓: N → N such that

𝑛+1
, if 𝑛 is
2
𝑓(𝑛) = � 2
𝑛
, if 𝑛 is even

Is the function injective? Justify your answer.

[CBSE SQP 2022]

30. Let 𝐴 = {1,2,3}, 𝐵 = {4,5,6,7} and 𝑓 = {(1,4), (2,5), (3,6)} be a function from A to 𝐵. State whether '
𝑓 ' is one-one or not.
[CBSE 2014]
 Long Qs (4 - 5 marks)
𝑥
31. Show that the function 𝑓: 𝑅 → {𝑥 ∈ 𝑅 : −1 < 𝑥 < 1} defined by 𝑓(𝑥) = , 𝑥 ∈ 𝑅 is one-one and
1+|𝑥|
onto function. [CBSE SQP 2023]

32. A function 𝑓: [−4,4] → [0,4] is given by 𝑓(𝑥) = √16 − 𝑥 2 . Show that 𝑓 is an onto function but not a
one-one function. Further, find all possible values of ' 𝑎 ' for which 𝑓(𝑎) = √7.

[CBSE 2023]
𝑥
33. Show that the function 𝑓: (−∞, 0) → (−1,0) and 𝑓(𝑥) = , 𝑥 ∈ (−∞, 0) is one-one and onto.
1+|𝑥|

[CBSE 2020]
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

PRE INTRODUCTION OF RELATION

(Practice Sheet)
1 Which of the following is the definiti of a relatio in mathemati s?
A. A set of ordered pairs B. A set of natural numbers
C. A sequence of integers D. A set of equatio s
2 In a relation, if each element of the fi st set is related to exactly one element of the second
set, it is called?
A. One-to-one relatio B. Many-to-one relatio
C. One-to-many relatio D. None of the above
3 A relatio where every element of the fi st set is related to every element of the second
set is known as:
A. One-to-one relatio B. Many-to-one relatio
C. One-to-many relatio D. Many-to-many relatio
4 If there are 'm' elements in the fi st set and 'n' elements in the second set of a relation
then the maximum number of relati ns that can be defi ed is:
A. m + n B. m × n
C. 2 (m+n) D. mn
5 In a relation, if two di erent ordered pairs have the same fi st element but di erent second
elements, it is:
A. One-to-one relatio B. Many-to-one relatio
C. One-to-many relatio D. Many-to-many relatio
6 Find out the range of functio : f(x) = √16 − x 2
7 Show the functio f: A - R. f(x) = x2 – 1. Consider A = { -4, 0, 1, 4) as a set of ordered pairs.
8 Assume that f(x) = x2 and g(x) = 2x + 1 are two real functions. Determine (f +
f
g) (x), (f – g) (x), (fg) (x), ( ) (x).
g
9 What is meant by the compositio of functio s?
10 Express fog, assuming that f: R → R and g: R → R are represented by f(x) = |x| and g(x) =
|5x – 2|.
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF FUNCTIONS

(Practice Sheet)
1 Which of the following relation contains no elements?
A. Refl xive relatio B. Symmetric relatio
C. Empty relatio D. Transiti e relatio
2 A rela on that includes all possible pairs from a set is called:
A. Empty relatio B. Universal relatio
C. Refl xive relatio D. Symmetric relatio
3 In a relation if every element is related to itself, it is called:
A. Refl xive relatio B. Symmetric relatio
C. Transiti e relatio D. Equivalence relatio
4 If for every (a, b) in a relation (b, a) is also present, the relation is:
A. Empty relatio B. Universal relatio
C. symmatric relatio D. Refl xive relatio
5 If (a, b) and (b, c) are in a relation, then (a, c) must also be in the relation This relatio is
known as:
A. Empty relatio B. Universal relatio
C. Refl xive relatio D. Transiti e relatio
6 Defin Re exive Rela on.
7 Assume that A = 3, 4, 5, 6 and B = x, y, z. Now let R be a relatio from A into B represented by
R = (3, x), (4, y), (5, z), (6, x), (6, y). Thus, determine the domain and range of R.
8 Illustrate that relation R on R defin d as R = [(a, b): a ≤ b], is refl xive, and transiti e but not
symmetric.
9 Check whether the relation R defin d on the set A = 1, 2, 3, 4, 5, 6 as R = (a, b) : b = a + 1 is
refl xive, symmetric or transiti e.
10 Let A = 1, 2, 3, ..., 9 and R be the relation in A × A defin d by (a, b) R (c, d) if a + d = b + c for
(a, b), (c, d) in A × A. Prove that R is an equivalence relation Also obtain the equivalence class
[(2, 5)].
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

TYPES OF FUNCTIONS

(Practice Sheet)
1 Which type of func on ensures that each element in the domain maps to a unique
element in the codomain?
A. Many-One Functio B. Onto Functio
C. One-One Onto Functio D. One-One Functio (Injecti e)
2 A func on is considered onto if:
A. It maps each element to a unique B. It maps each element to exactly one
element. element.
C. It covers the enti e codomain. D. It covers the enti e domain.
3 A func on that is both one-one and onto is called:
A. Many-One Functio B. Bijecti e Functio
C. Inverse Functio D. Surjecti e Functio
4 If a func on is onto, it means that:
A. It has a unique output for each input. B. It has multip e outputs for each input.
C. It covers the enti e codomain. D. It covers the enti e domain.
5 Which of the following can be true for a function th t is not one-one?
A. It can be onto B. It can be both onto and one-one
C. It cannot be onto D. It must be bijecti e
6 Check whether the functio f(x) = 2x + 3, is one-to-one or not if Domain = 1, 2,
1
and
2
Codomain= 5, 7, 4
7 Check whether the functio is one-to-one or not: f(x) = 3x – 2
8 Check whether the functio is one-to-one or not: f(x) = x2 + 3.
9 If N: → N, f(x) = 2x + 1 then check whether the function i injecti e or not.
10 f(x) = x2, check whether the functio is Many to One or not.
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

COMPOSITION OF FUNCTIONS

(Practice Sheet)
1 If f(x) = 2x + 3 and g(x) = x – 1, then the composite functio f ∘ g is equal to:
2

A. 2x2 + 3x – 1 B. 2x3 + 3x2 – 2x – 3

C. 4x2 + 9 D. 2x2 + 3x +1
2 Given f(x) = x3 and 𝐠(𝐱) = √𝐱, the value of gof (1) is:
A. 0 B. 1
C. √2
3
D. 2
3 𝟏
If f(x) = 2x - 1 and 𝐠(𝐱) = , then fog(x) is:
𝐱
2x−1 2x+1
A. B.
x x
1 1
C. 2x − D. 2x +
x x
4 𝟏
If 𝐟(𝐱) = and g(x) = x , then fog(x) is equal to:
2
𝐱
A.
1
B. x
x2
x
C.
1
D.
x4 x2 +1
5 If f(x) = 3x and 𝐠(𝐱) =
𝟏
, then the composite func on gof is equal to:
𝐱+𝟏
A.
3x
B. 3x + 1
x+1
C. 3x D.
1
3x
6 For the given func ons f(x) = ex and g(x) = x2 + 1. Find out the values of f(g(x)) and g(f(x)).
7 For the given func ons f(x) = 2x and g(x) = x2 + 1. Find out the values of f(g(x)) and g(f(x)) at
x = 2.
8 For the given functio s f(x) = sin(x) and g(x) = x2. Find out the domain and range for fog(x)
and gof(x).
9 For the given func ons f(x) = log(x) and g(x) = x + 1. Find out the values of f(g(x)).
10 What is a Composite Functio ?
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

INVERTIBLE FUNCTIONS

(Practice Sheet)
1 Which of the following statements about inver ble function is true?
B. Invertibl function always have a
A. Every functio is invertibl .
horizontal asymptote.
C. Invertibl function have exactly one D. Invertibl function have a non-zero slope
value of x for each value of y. at every point.
2 Invertib e func ons have exactly one value of x for each value of y.
A. Lies en rely above the x-axis. B. Is symmetric with respect to the x-axis.
C. Is symmetric with respect to the y-axis. D. Lies en rely above the y-axis.
3 For a func on to be invertible, it must be:
A. Contin ous. B. Discontin ous.
C. Constant. D. Non-monotonic.
4 The inverse of a func on f is denoted by:
A. f' B. f-1
C. ∫ f D. f’
5 If two func ons, f and g, are invertible then the composition g ∘ f) is:
A. Invertibl . B. Non-invertibl .
C. A constant function D. A linear functio .
6 Find and plot the inverse of the functio f(x) = 3x + 6.
7 3
Show that f: R − 0 → R − 0given by f(x) = is invertibl .
x

8 Consider f ∶ R + → [4, ∞] given by f(x) = x2 + 4. Show that f is invertibl , where R+ is the set of
all non-negati e real numbers.
9 If f is an invertibl function, d fin d as f(x) =
3x −4
, then write f-1(x).
5
10 f: R → R defin d by f(x) = 2x -1, fin f-1(x)?
Page 1
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

BINARY OPERATIONS

(Practice Sheet)
1 Which of the following is an example of an iden ty opera on?
A. Additio of integers B. Multipl cation o real numbers
C. Division of ratio al numbers D. Subtractio of natural numbers
2 In a binary operation, if every element of the set is an iden ty for some element, it is
called:
A. Inverse operatio B. Associati e operatio
C. Associati e operatio D. Cancellation op ratio
3 Which of the following opera ons is commutativ ?
A. Matrix multipl catio B. Division of whole numbers
C. Exponenti tio D. Additio of ration l numbers
4 Which property does the binary opera on of subtraction of real numbers sati fy?
A. Identi y B. Associati e
C. Inverse D. Commutati e
5 For a binary operatio to be associa ve:
A. a* (bc) must be equal to (ab)c B. a(bc) must be equal to abc
C. a (bc) must be equal to a + b + c D. a(bc) must be equal to ab + c
6 Let * be a binary operatio on Z defin d by a * b = a + b – 4 for all a, b ∈ Z.
i. Show that * is both commutati e and associati e.
ii. Find the identi y element in Z.
iii. Find the invertibl element in Z.
7 Let * be a binary operatio on Q0 (set of non-zero ratio al numbers) defin d by a × b =
3ab
( ) for all a, b ∈ Q0. Show that * is commutati e as well as associati e. Also, fin its
5
identi y element, if it exists.
8 Let * be a binary operation on Q – {-1} defi ed by a × b = a + b + ab for all a, b ∈ Q – {-1}.
Then,
i. Show that * is both commutati e and associati e.
ii. Find the identi y element in Z.
iii. Find the invertibl element in Z.
9 Let ‘*’ be a binary operation on he set of Q0 of all non zero ration l numbers defin d by a ∗
ab
b = for all a, b ∈ Q0
2
i.show that ‘*’ is both commutati e and associati e.
ii.Find the identi y element in Q0.
iii.Find the invertibl element of Q0.
Page 2
Class 12th Mathematics

01 RELATIONS AND FUNCTIONS

BINARY OPERATIONS

10 Let * be the binary operation o N defin d by a * b = H.C.F of a and b. Is * commutati e? Is

* associati e? Does there exist identi y for this binary operatio on N?
CLASS : XIIth SUBJECT : MATHS
DATE : DPP NO. : 10

Topic :- RELATIONS AND FUNCTIONS

2𝑥
1. Let 𝑓: (−1, 1) → 𝐵, be a function defined by 𝑓(𝑥) = tan−1 , then 𝑓 is both one-one and onto
1−𝑥 2
when 𝐵 is the interval
𝜋 𝜋 𝜋 𝜋 𝜋 𝜋
a) �− , � b) �− , � c) [0, ) d) �0, �
2 2 2 2 2 2

2. If 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 𝑥 3 , then 𝑓 −1 (8) is equal to

a) {2} b) {2, 𝜔, 2𝜔2 } c) {2, −2} d) {2, 2}

3. The set of all 𝑥 for which there are no functions

1
𝑓(𝑥) = log (𝑥−2)/(𝑥+3) 2 and 𝑔(𝑥) = , is
2
√𝑥 − 9
a) [−3, 2] b) [−3, 2) c) (−3, 2] d) (−3, −2)

4. Which of the following functions is (are) not an injective map(s)?

a) 𝑓(𝑥) = |𝑥 + 1|, 𝑥 ∈ [−1, ∞)
1
b) g(𝑥) = 𝑥 + , 𝑥 ∈ (0, ∞)
𝑥
c) ℎ(𝑥) = 𝑥 2 + 4 𝑥 − 5, 𝑥 ∈ (0, ∞)
d) 𝑘(𝑥) = 𝑒 −𝑥 , 𝑥 ∈ [0, ∞)

5. If 𝑓: 𝑁 → 𝑍 is defined by
2 if 𝑛 = 3𝑘, 𝑘 ∈ 𝑍
𝑓(𝑛) = �10 if 𝑛 = 3𝑘 + 1, 𝑘 ∈ 𝑍,
0 if 𝑛 = 3𝑘 + 2, 𝑘 ∈ 𝑍
Then {𝑛 ∈ 𝑁: 𝑓(𝑛) > 2} is equal to
a) {3, 6, 4} b) {1, 4, 7} c) {4, 7} d) {7}

2𝑥−1
6. If 𝑓(𝑥) = (𝑥 ≠ −5), then 𝑓 −1 (𝑥) is equal to
𝑥+5
𝑥+5 1 5𝑥+1 𝑥−5 1 5𝑥−1
a) ,𝑥 ≠ b) ,𝑥 ≠ 2 c) ,𝑥 ≠ d) ,𝑥 ≠ 2
2𝑥−1 2 2−𝑥 2𝑥+1 2 2−𝑥

7. If 𝑎, 𝑏 are two fixed positive integers such that

𝑓(𝑎 + 𝑥) = 𝑏 + [𝑏 3 + 1 − 3𝑏 2 𝑓(𝑥) + 3𝑏 {𝑓(𝑥)}2 − {𝑓(𝑥)}3 ]1/3
For all 𝑥 ∈ 𝑅, then 𝑓(𝑥) is a periodic function with period
a) 𝑎 b) 2𝑎 c) 𝑏 d) 2𝑏
8. Let 𝐴 be a set containing 10 distinct elements, then the total number of distinct function from
𝐴 to 𝐴 is
a) 1010 b) 101 c) 210 d) 210 − 1

𝑝 𝑝
9. If 𝒬 denotes the set of all rational numbers and 𝑓 � � = �𝑝2 − 𝑞 2 for any ∈ 𝒬, then
𝑞 𝑞
observe the following statements.
𝑝 𝑝
I. 𝑓 � � is real for each ∈ 𝒬.
𝑞 𝑞
𝑝 𝑝
II. 𝑓 � � is a complex number for each ∈ 𝒬.
𝑞 𝑞
Which of the following is correct?
a) Both I and II are true b) I is true, II is false
c) I is false, II is true d) Both I and II are false

10. The domain of the function 𝑓(𝑥) = log 3+𝑥 (𝑥 2 − 1) is

a) (−3, −1) ∪ (1, ∞) b) [−3, −1] ∪ [1, ∞]
c) (−3, −2) ∪ (−2, −1) ∪ (1, ∞) d) [−3, −2) ∪ (−2, −1) ∪ (1, ∞)

𝑥−2
11. Let 𝐴 = 𝑅 − {3}, 𝐵 = 𝑅 − {1}. Let 𝑓: 𝐴 → 𝐵be defined by 𝑓(𝑥) = .Then,
𝑥−3
a) 𝑓 is bijective b) 𝑓 is one-one but not onto
c) 𝑓 is onto but not one-one d) None of the above

√sin 𝑥
12. Let 𝑓(𝑥) = 3 . If 𝐷 is the domain of 𝑓, then 𝐷 contains
1+ √sin 𝑥
a) (0, 𝜋) b) (−2 𝜋, −𝜋) c) (3 𝜋, 4 𝜋) d) (4 𝜋, 6 𝜋)

13. Let 𝑓: 𝑅 → 𝑅 and 𝑔: 𝑅 → 𝑅 be given by 𝑓(𝑥) = 3𝑥 2 + 2 and 𝑔(𝑥) = 3𝑥 − 1 for all 𝑥 ∈ 𝑅. Then,
a) 𝑓𝑜𝑔(𝑥) = 27𝑥 2 − 18𝑥 + 5
b) 𝑓𝑜𝑔(𝑥) = 27𝑥 2 + 18𝑥 − 5
c) 𝑔𝑜𝑓 (𝑥) = 9𝑥 2 − 5
d) 𝑔𝑜𝑓 (𝑥) = 9𝑥 2 + 15

14. The domain of definition of the function

1
𝑓(𝑥) = , is
�|𝑥| − 𝑥
a) 𝑅 b) (0, ∞) c) (−∞, 0) d) None of these

15. Let 𝑓: 𝐴 → 𝐵 and g: 𝐵 → 𝐴 be two functions such that 𝑓𝑜g = 𝐼𝐵 . Then,

a) 𝑓 and g both are injections
b) 𝑓 and g both are surjections
c) 𝑓 is an injection and g is a surjection
d) 𝑓 is a surjection and g is an injection

16. If 𝑓(𝑥) = 𝑥 2 − 1 and 𝑔(𝑥) = (𝑥 + 1)2 , then (𝑔𝑜𝑓)(𝑥) is

a) (𝑥 + 1)4 − 1 b) 𝑥 4 − 1 c) 𝑥 4 d) (𝑥 + 1)4
17. If 𝑓: 𝑅 → 𝑅 satisfies 𝑓(𝑥 + 𝑦) = 𝑓(𝑥) + 𝑓(𝑦), for all 𝑥, 𝑦 ∈ 𝑅 and 𝑓(1) = 7, then ∑𝑛𝑟=1 𝑓(𝑟) is
7𝑛 7(𝑛+1) 7𝑛(𝑛+1)
a) b) c) 7𝑛(𝑛 + 1) d)
2 2 2

18. If 𝑓(𝑥) = 2𝑥 4 − 13𝑥 2 + 𝑎𝑥 + 𝑏 is divisible by 𝑥 2 − 3𝑥 + 2, then (𝑎, 𝑏) is equal to

a) (−9, −2) b) (6, 4) c) (9, 2) d) (2, 9)

𝑥 2 −8
19. Let 𝑓: 𝑅 → 𝑅 be a function defined by 𝑓(𝑥) = Then, 𝑓 is
𝑥 2 +2
a) One-one but not onto
b) One-one and onto
c) Onto but not one-one
d) Neither one-one nor onto

sin−1 (𝑥−3)
20. The domain of the function 𝑓(𝑥) = , is
√9−𝑥 2
a) [1, 2) b) [2, 3) c) [1, 2] d) [2, 3]
 LINE BY LINE QUESTIONS
RELATIONS, FUNCTIONS

EXERCISE - 1 : BASIC OBJECTIVE QUESTIONS

Relation and its Types 6. The range of the function y = log3 (5 + 4x – x2) is
(a) (0, 2] (b) (–¥, 2]
1. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9),
(3, 12), (3, 6)} be a relation on the set A = {3, 6, 9, 12}. The (c) (0, 9] (d) none of these
relation is 7. If ex + ef(x) = e, then range of the function of f is
(a) reflexive and symmetric only (a) (–¥, 1] (b) (–¥, 1)
(b) an equivalence relation (c) (1, ¥) (d) [1, ¥)
(c) reflexive only
(d) reflexive and transitive only x2 + x + 2
8. Range of the function f (x) = ; x Î R is
x2 + x + 1
2. Let W denotes the words in the English dictionary. Define
the relation R by R = {(x, y) Î W × W : the words x and y
have at least one letter in common}. Then, R is æ 11 ö
(a) (1, ¥) (b) ç 1, ÷
è 7ø
(a) reflexive, symmetric and not transitive
(b) reflexive, symmetric and transitive
æ 7ù æ 7ö
(c) reflexive, not symmetric and transitive (c) ç 1, ú (d) ç 1, ÷
è 3û è 5ø
(d) not reflexive, symmetric and transitive
3. Let N be the set of natural numbers and a relation R on N x 1 p
9. The equation 2 sin2 . cos2 x = x + , 0 < x < has
be defined by 2 x 2

R= x, y Î N ´ N : x 3 - 3x 2 y - xy 2 + 3y 3 = 0 . (a) one real solution

Then the relation R is: (b) no real solution

(a) reflexive and symmetric, but not transitive (c) infinitely many real solutions

(b) reflexive but neither symmetric nor transitive (d) none of these
(c) an equivalence relation
x - [ x]
(d) symmetric but neither reflexive nor transitive 10. Let f(x) = , x Î R, then the range of f is :
1 + x - [ x]
Functions and its classifications
(a) [0, 1] (b) [0, 1/2]
(c) [0, 1/2) (d) (0, 1)
ax 2
4. Let f (x) = , x ¹ - 1 . The value of a for which 11. The range of k for which ||x–1|–5| = k have four distinct
x +1
f (a) = a, (a ¹ 0) is solutions -
(a) [0, 5] (b) (–¥, 5)
1 1
(a) 1 - (b) (c) [0, ¥) (d) (0, 5)
a a
2
1 1 12. The function f (x) = cos log x + x + 1 is :
(c) 1 + (d) - 1
a a
(a) even (b) odd
log 2 x + 3 (c) constant (d) None of these
5. The domain of f (x) = is
x 2 + 3x + 2 13. Let f : R ® R be a function such that f (x) = x3 – 6x2 + 11x – 6. Then
(a) R – {–1, –2} (b) (–2, + ¥) (a) f is one-one and into (b) f is one-one and onto
(c) R – {–1, –2, –3} (d) (–3, + ¥) – {–1, –2} (c) f is many-one and into (d) f is many-one and onto
RELATIONS , FUNCTIONS

14. Let f : R ® R be a function such that 22. Which of the following function has period p ?
f (x) = x3 + x2 + 3x + sin x. Then
æ 2px ö æ px ö
(a) f is one-one and into (b) f is many-one and into (a) 2cos ç ÷ + 3sin ç ÷
è 3 ø è 3 ø
(c) f is one-one and onto (d) f is many-one and onto
(b) |tan x| + cos 2 x
15. Let f be a function from R to R given by f (x) = 2x + |cos x|.
Then f is æ pö æ pö
(c) 4cos ç 2px + ÷ + 2sin ç px + ÷
(a) one-one and into (b) one-one and onto è 2ø è 4ø

(c) many-one and into (d) many-one and onto (d) none of the above

23. Let f (x) = cos 3x + sin 3 x. Then f (x) is

x2 – 4
16. Let f be a function from R to R given by f (x) = .
x 2 +1 (a) a periodic function of period 2p.

Then f (x) is. (b) a periodic function of period 3 p.

(a) one-one and into (b) one-one and onto (c) not a periodic function
(c) many-one and into (d) many-one and onto (d) none of these
2
2
24. The period of sin q is
17. f (x) = x + x is a function from R ® R. Then f (x) is 2
(a) p (b) p
(a) injective (b) surjective 3
(c) p (d) p/2
(c) bijective (d) none of these 25. Which one is not periodic
18. A function f : A ® B, where A {x : – 1 £ x £ 1} and 2
2
B = {y : 1 £ y £ 2} is defined by the rule y = f (x) = 1 + x . (a) |sin 3x| + sin x (b) cos x + cos 2 x
2 2
Which of the following statement is true? (c) cos 4x + tan x (d) cos x + sin x
(a) f is injective but not surjective Composition of a function
(b) f is surjective but not injective
26. Let f (x) be a function defined on [0, 1] such that
(c) f is both injective and surjective
(d) f is neither injective nor surjective ì x x ÎQ
ï
f x =í
ì x, if x is rational ï1 - x, x Ï Q
19. f x =í and î
î0, if x is irrational
Then for all x Î [0, 1], fof (x) is
ì0, if x is rational (a) a constant (b) 1 + x
g x =í . Then, f – g is
î x, if x is irrational (c) x (d) none of these

(a) one-one and into (b) neither one-one nor onto 27. If f x = 2 - x and g x = 1 - 2 x , then the domain of
(c) many one and onto (d) one-one and onto f [g (x)] is
(a) (– ¥, 1/2] (b) [1/2, ¥)
20. If f : R ® S, define by f (x) = sin x – 3 cos x + 1, is onto,
(c) (– ¥, –3/2] (d) none of these
then the interval of S is
28. Let f (x) = sin x and g(x) = In |x|. If the ranges of the
(a) [0, 1] (b) [–1, 1] composition functions fog and gof are R 1 and R 2
(c) [0, 3] (d) [–1, 3] respectively, then
21. If a function f : [2, ¥) ® B defined by f (x) = x2 – 4x + 5 is a (a) R1 = {u : –1 < u < 1}, R2 = {v : –¥ < v < 0}
bijection, then B is : (b) R1 = {u : –¥ < u < 0}, R2 = {v : –1 < v < 0}
(a) R (b) [1, ¥) (c) R1 = {u : –1 < u < 1}, R2 = {v : –¥ < v < 0}
(c) [4, ¥) (d) [5, ¥) (d) R1 = {u : –1 < u < 1}, R2 = {v : –¥ < v < 0}
RELATIONS, FUNCTIONS

2 34. Let f : [–1, ¥) ® R be given by f (x) = (x + 1)2 –1,

29. If g {f (x)} = |sin x| and f {g (x)} = sin x , then x > –1. Then f –1 (x), is :

(a) f x = sin 2 x ,g x = x (a) – 1 + x +1

(b) f x = sin x ,g x = x (b) – 1 – x +1

(c) does not exist because f is not one-one

(c) f x = x 2 ,g x = sin x
(d) does not exist because f is not onto
(d) f and g cannot be determined 4 1/7
35. The inverse of the function y = [1 – (x – 3) ] is
7 1/4 7 1/4
30. If f(x) = sin2x, g x = x and h(x) = cos–1x, 0 £ x £ 1, then - (a) 3 + (1 – x ) (b) 3 – (1 – x )
7 1/4
(a) hogof(x) = gofoh(x) (c) 3 – (1 + x ) (d) none of these

(b) gofoh(x) = fohog(x) Functional Equations

(c) fohog(x) = hogof(x)
(d) None of these æ1ö 1
36. If 3 f (x) + 5 f ç ÷ = – 3, " x(¹ 0) Î R, then f (x) is
èxø x
31. If f(g(x)) = | cos x |, g(f(x)) = cos2 x , then -
equal to :
(a) f(x) is a periodic function and g(x) is a non-periodic
function. 1 æ3 ö 1 æ 3 ö
(a) ç + 5x – 6 ÷ (b) ç – + 5x – 6 ÷
(b) f(x) is a non-periodic function and g(x) is a periodic 16 è x ø 16 è x ø
function.
(c) Both f(x) and g(x) are periodic functions 1 æ3 ö
(c) ç - 5x - 6 ÷ (d) none of these
16 èx ø
(d) Neither f(x) nor g(x) is a periodic function

32. Consider the functions f x = x and g(x) = 7x + b. If 37. Let f : R ® R be a function given by f (x + y) = f (x) + f (y) for
all x, y Î R such that f (1) = a. Then, f (x) =
the function y = fog(x) passes through (4, 6) then the
(a) ax (b) ax
value of b is
a
(c) x (d) a + x
(a) 8 (b) – 8
38. Let f be a real valued function satisfying
(c) – 25 (d) 4 - 7 6 f (x + y) = f (x) f (y) for all x, y Î R such that f (1) = a. Then,
f (x) =
Inverse of a Function
(a) ax (b) ax
a
(c) x (d) none of these
a x - a -x
33. The inverse of the function f x = x is
a + a -x
æ 1 ö
39. If a f (x + 1) + bf ç ÷ = x, x ¹ -1, a ¹ –b, then f (1) is
(where codomain of f(x) is (–1, 1)) è x +1 ø

equal to
1 æ1- x ö 1 æ1+ x ö
(a) log a ç ÷ (b) log a ç ÷
2 è1+ x ø 2 è1- x ø (a) a + b (b) a2 – b2

1
æ 1+ x ö (c) (d) f(1) = 0
(c) log a ç (d) none of these a+b
÷
è 1- x ø
EXEMPLAR SOLUTIONS Chapter 1:
Relations and Functions

Exercise 1.3
Short Answer (S.A.)
1. Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive and
transitive.
Solution:

Given relation, R = {(a, a), (b, c), (a, b)}

To make R as reflexive we should add (b, b) and (c, c) to R. Also, to make R as transitive we should add
(a, c) to R.
Hence, the minimum number of ordered pairs to be added are (b, b), (c, c) and (a, c) i.e. 3.

2. Let D be the domain of the real valued function f defined by f(x) = √(25 – x2). Then, write D.
Solution:

Given, f(x) = √(25 – x2)

The function is defined if 25 – x2 ≥ 0
So, x2 ≤ 25
-5 ≤ x ≤ 5
Therefore, the domain of the given function is [-5, 5]

3. Let f, g: R → R be defined by f(x) = 2x + 1 and g (x) = x2 – 2, ∀ x ∈ R, respectively. Then, find g

o f.
Solution:

Given,
f(x) = 2x + 1 and g (x) = x2 – 2, ∀ x ∈ R
Thus, g o f = g (f (x))
= g (2x + 1)
= (2x + 1)2 – 2
= 4x2 + 4x + 1 – 2
= 4x2 + 4x - 1

4. Let f: R → R be the function defined by f (x) = 2x – 3, ∀ x ∈ R. write f –1.

Solution:

Given function,
f (x) = 2x - 3, ∀ x ∈ R
Let y = 2x – 3
x = (y + 3)/ 2
Thus,
f -1(x) = (x + 3)/ 2

5. If A = {a, b, c, d} and the function f = {(a, b), (b, d), (c, a), (d, c)}, write f –1.
Solution:

Given,
A = {a, b, c, d} and f = {(a, b), (b, d), (c, a), (d, c)}
So,
f -1 = {(b, a), (d, b), (a, c), (c, d)}

6. If f: R → R is defined by f (x) = x2 – 3x + 2, write f (f (x)).

Solution:

Given, f (x) = x2 – 3x + 2
Then,
f (f (x)) = f (x2 – 3x + 2)
= (x2 – 3x + 2)2 – 3(x2 – 3x + 2) + 2,
= x4 + 9x2 + 4 – 6x3 + 4x2 – 12x – 3x2 + 9x – 6 + 2
= x4 – 6x3 + 10x2 – 3x
Thus,
f (f (x)) = x4 – 6x3 + 10x2 – 3x

7. Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by g (x) = αx + β, then what value
should be assigned to α and β.
Solution:

Given, g = {(1, 1), (2, 3), (3, 5), (4, 7)}

It’s seen that every element of domain has a unique image. So, g is function.
Now, also given that g (x) = αx + β
So, we have
g (1) = α(1) + β = 1
α + β = 1 …….. (i)
And, g (2) = α(2) + β = 3
2α + β = 3 …….. (ii)
Solving (i) and (ii), we have
α = 2 and β = -1
Therefore, g (x) = 2x - 1

8. Are the following set of ordered pairs functions? If so, examine whether the mapping is injective
or surjective.
(i) {(x, y): x is a person, y is the mother of x}.
(ii){(a, b): a is a person, b is an ancestor of a}.
Solution:

(i) Given, {(x, y): x is a person, y is the mother of x}

It’s clearly seen that each person ‘x’ has only one biological mother.
Hence, the above set of ordered pairs make a function.
Now more than one person may have same mother. Thus, the function is many-many one and surjective.
(ii) Given, {(a, b): a is a person, b is an ancestor of a}
It’s clearly seen that any person ‘a’ has more than one ancestors.
Thus, it does not represent a function.

9. If the mappings f and g are given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, write
f o g.
Solution:

Given,
f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}
Now,
fog (2) = f(g(2)) = f(3) = 5
fog (5) = f(g(5)) = f(1) = 2
fog (1) = f(g(1)) = f(3) = 5
Thus,
fog = {(2, 5), (5, 2), (1, 5)}

10. Let C be the set of complex numbers. Prove that the mapping f: C → R given by f (z) = |z|, ∀ z
∈ C, is neither one-one nor onto.
Solution:

Given, f: C → R such that f (z) = |z|, ∀ z ∈ C

Now, let take z = 6 + 8i
Then,
f (6 + 8i) = |6 + 8i| = √(62 + 82) = √100 = 10
And, for z = 6 - 8i
f (6 - 8i) = |6 - 8i| = √(62 + 82) = √100 = 10
Hence, f (z) is many-one.
Also, |z| ≥ 0, ∀ z ∈ C
But the co-domain given is ‘R’
Therefore, f(z) is not onto.

11. Let the function f: R → R be defined by f (x) = cos x, ∀ x ∈ R. Show that f is neither one-one
nor onto.
Solution:

We have,
f: R → R, f(x) = cos x
Now,
f (x1) = f (x2)
cos x1 = cos x2
x1 = 2nπ ± x2, n ∈ Z
It’s seen that the above equation has infinite solutions for x1 and x2
Hence, f(x) is many one function.
Also the range of cos x is [-1, 1], which is subset of given co-domain R.
Therefore, the given function is not onto.

12. Let X = {1, 2, 3} and Y = {4, 5}. Find whether the following subsets of X × Y are functions from
X to Y or not.
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)} (ii) g = {(1, 4), (2, 4), (3, 4)}
(iii) h = {(1,4), (2, 5), (3, 5)} (iv) k = {(1,4), (2, 5)}.
Solution:

Given, X = {1, 2, 3} and Y = {4, 5}

So, X × Y = {(1, 4), (1, 5), (2, 4), (2, 5), (3, 4), (3, 5)}
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
f is not a function as f(1) = 4 and f(1) = 5
Hence, pre-image ‘1’ has not unique image.

(ii) g = {(1, 4), (2, 4), (3, 4)}

It’s seen clearly that g is a function in which each element of the domain has unique image.

(iii) h = {(1,4), (2, 5), (3, 5)}

It’s seen clearly that h is a function as each pre-image with a unique image.
And, function h is many-one as h(2) = h(3) = 5

(iv) k = {(1, 4),(2, 5)}

Function k is not a function as ‘3’ has not any image under the mapping.

13. If functions f: A → B and g: B → A satisfy g o f = IA, then show that f is one-one and g is onto.
Solution:

Given,
f: A → B and g: B → A satisfy g o f = I A
It’s clearly seen that function ‘g’ is inverse of ‘f’.
So, ‘f’ has to be one-one and onto.
Hence, ‘g’ is also one-one and onto.

14. Let f: R → R be the function defined by f(x) = 1/(2 – cos x) ∀ x ∈ R. Then, find the range of f.
Solution:

Given,
f(x) = 1/(2 – cos x) ∀ x ∈ R
Let y = 1/(2 – cos x)
2y – ycos x = 1
cos x = (2y - 1)/ y
cos x = 2 – 1/y
Now, we know that -1 ≤ cos x ≤ 1
So,
-1 ≤ 2 – 1/y ≤ 1
-3 ≤ – 1/y ≤ -1
1 ≤ – 1/y ≤ 3
1/3 ≤ y ≤ 1
Thus, the range of the given function is [1/3, 1].

15. Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only
if a – b is divisible by n. Show that R is an equivalance relation.
Solution:

Given ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n.

Now, for
aRa ⇒ (a - a) is divisible by n, which is true for any integer a as ‘0’ is divisible by n.
Thus, R is reflective.
Now, aRb
So, (a - b) is divisible by n.
⇒ - (b - a) is divisible by n.
⇒ (b – a) is divisible by n
⇒ bRa
Thus, R is symmetric.
Let aRb and bRc
Then, (a - b) is divisible by n and (b - c) is divisible by n.
So, (a - b) + (b - c) is divisible by n.
⇒ (a - c) is divisible by n.
⇒ aRc
Thus, R is transitive.
So, R is an equivalence relation.

Long Answer (L.A.)

16. If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
(a) reflexive, transitive but not symmetric
(b) symmetric but neither reflexive nor transitive
(c) reflexive, symmetric and transitive.
Solution:

Given that, A = {1, 2, 3}.

(i) Let R1 = {(1, 1), (1, 2), (1, 3), (2, 3), (2, 2), (1, 3), (3, 3)}
R1 is reflexive as (1, 1), (2, 2) and (3, 3) lie is R1.
R1 is transitive as (1, 2) ∈ R1, (2, 3) ∈ R1 ⇒ (1, 3) ∈ R1
Now, (1, 2) ∈ R1 ⇒ (2, 1) ∉ R1.

(ii) Let R2 = {(1, 2), (2, 1)}

Now, (1, 2) ∈ R2, (2, 1) ∈ R2
So, it is symmetric,
And, clearly R2 is not reflexive as (1, 1) ∉ R2
Also, R2 is not transitive as (1, 2) ∈ R2, (2, 1) ∈ R2 but (1, 1) ∉ R2

(iii) Let R3 = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}
R3 is reflexive as (1, 1) (2, 2) and (3, 3) ∈ R1
R3 is symmetric as (1, 2), (1, 3), (2, 3) ∈ R1 ⇒ (2, 1), (3, 1), (3, 2) ∈ R1
Therefore, R3 is reflexive, symmetric and transitive.

17. Let R be relation defined on the set of natural number N as follows:

R = {(x, y): x ∈ N, y ∈ N, 2x + y = 41}. Find the domain and range of the relation R. Also verify
whether R is reflexive, symmetric and transitive.
Solution:

Given function: R = {(x, y): x ∈ N, y ∈ N, 2x + y = 41}.

So, the domain = {1, 2, 3, ….., 20} [Since, y ∈ N ]
Finding the range, we have
R = {(1, 39), (2, 37), (3, 35), …., (19, 3), (20, 1)}
Thus, Range of the function = {1, 3, 5, ….., 39}
R is not reflexive as (2, 2) ∉ R as 2 x 2 + 2 ≠ 41
Also, R is not symmetric as (1, 39) ∈ R but (39, 1) ∉ R
Further R is not transitive as (11, 19) ∉ R, (19, 3) ∉ R; but (11, 3) ∉ R.
Thus, R is neither reflexive nor symmetric and nor transitive.

18. Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(a) an injective mapping from A to B
(b) a mapping from A to B which is not injective
(c) a mapping from B to A.
Solution:

Given, A = {2, 3, 4}, B = {2, 5, 6, 7}

(i) Let f: A → B denote a mapping
f = {(x, y): y = x + 3} or
f = {(2, 5), (3, 6), (4, 7)}, which is an injective mapping.
(ii) Let g: A → B denote a mapping such that g = {(2, 2), (3, 2), (4, 5)}, which is not an injective
mapping.
(iii) Let h: B → A denote a mapping such that h = {(2, 2), (5, 3), (6, 4), (7, 4)}, which is one of the
mapping from B to A.

19. Give an example of a map

(i) which is one-one but not onto
(ii) which is not one-one but onto
(iii) which is neither one-one nor onto.
Solution:

(i) Let f: N → N, be a mapping defined by f (x) = x2

For f (x1) = f (x2)
Then, x12 = x22
x1 = x2 (Since x1 + x2 = 0 is not possible)
Further ‘f’ is not onto, as for 1 ∈ N, there does not exist any x in N such that f (x) = 2x + 1.
(ii) Let f: R → [0, ∞), be a mapping defined by f(x) = |x|
Then, it’s clearly seen that f (x) is not one-one as f (2) = f (-2).
But |x| ≥ 0, so range is [0, ∞].
Therefore, f (x) is onto.

(iii) Let f: R → R, be a mapping defined by f (x) = x2

Then clearly f (x) is not one-one as f (1) = f (-1). Also range of f (x) is [0, ∞).
Therefore, f (x) is neither one-one nor onto.

20. Let A = R – {3}, B = R – {1}. Let f : A → B be defined by f (x) = x – 2/ x – 3 ∀ x ∈ A . Then show

that f is bijective.
Solution:

Given,
A = R – {3}, B = R – {1}
And,
f : A → B be defined by f (x) = x – 2/ x – 3 ∀ x ∈ A
Hence, f (x) = (x – 3 + 1)/ (x – 3) = 1 + 1/ (x – 3)
Let f(x1) = f (x2)

So, f (x) is an injective function.

Now let y = (x - 2)/ (x -3)
x – 2 = xy – 3y
x(1 - y) = 2 – 3y
x = (3y – 2)/ (y - 1)
y ∈ R – {1} = B
Thus, f (x) is onto or subjective.
Therefore, f(x) is a bijective function.

21. Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto
or bijective:
(i) f(x) = x/2 (ii) g(x) = |x|
(iii) h(x) = x|x| (iv) k(x) = x2
Solution:

Given, A = [–1, 1]
(i) f: [-1, 1] → [-1, 1], f (x) = x/2
Let f (x1) = f(x2)
x1/ 2 = x2
So, f (x) is one-one.
Also x ∈ [-1, 1]
x/2 = f (x) = [-1/2, 1/2]
Hence, the range is a subset of co-domain ‘A’
So, f (x) is not onto.
Therefore, f (x) is not bijective.

(ii) g (x) = |x|

Let g (x1) = g (x2)
|x1| = |x2|
x1 = ± x2
So, g (x) is not one-one
Also g (x) = |x| ≥ 0, for all real x
Hence, the range is [0, 1], which is subset of co-domain ‘A’
So, f (x) is not onto.
Therefore, f (x) is not bijective.

(iii) h (x) = x|x|

Let h (x1) = h (x2)
x1|x1| = x2|x2|
If x1, x2 > 0
x12 = x22
x12 – x22 = 0
(x1 – x2)(x1 + x2) = 0
x1 = x2 (as x1 + x2 ≠ 0)
Similarly for x1, x2 < 0, we have x1 = x2
It’s clearly seen that for x1 and x2 of opposite sign, x1 ≠ x2.
Hence, f (x) is one-one.
For x ∈ [0, 1], f (x) = x2 ∈ [0, 1]
For x < 0, f (x) = -x2 ∈ [-1, 0)
Hence, the range is [-1, 1].
So, h (x) is onto.
Therefore, h (x) is bijective.

(iv) k (x) = x2
Let k (x1) = k (x2)
x12 = x22
x1 = ± x2
Therefore, k (x) is not one-one.

22. Each of the following defines a relation on N:

(i) x is greater than y, x, y ∈ N
(ii) x + y = 10, x, y ∈ N
(iii) x y is square of an integer x, y ∈ N
(iv) x + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.
Solution:

(i) Given, x is greater than y; x, y ∈ N

If (x, x) ∈ R, then x > x, which is not true for any x ∈ N.
Thus, R is not reflexive.
Let (x, y) ∈ R
⇒ xRy
⇒x>y
So, y > x is not true for any x, y ∈ N
Hence, R is not symmetric.
Let xRy and yRz
⇒ x > y and y > z
⇒x>z
⇒ xRz
Hence, R is transitive.

(ii) x + y = 10; x, y ∈ N
Thus,
R = {(x, y); x + y = 10, x, y ∈ N}
R = {(1, 9), (2, 8), (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)}
It’s clear (1, 1) ∉ R
So, R is not reflexive.
(x, y) ∈ R ⇒ (y, x) ∈ R
Therefore, R is symmetric.
Now (1, 9) ∈ R, (9, 1) ∈ R, but (1, 1) ∉ R
Therefore, R is not transitive.

(iii) Given, xy is square of an integer x, y ∈ N

R = {(x, y) : xy is a square of an integer x, y ∈ N}
It’s clearly (x, x) ∈ R, ∀ x ∈ N
As x2 is square of an integer for any x ∈ N
Thus, R is reflexive.
If (x, y) ∈ R ⇒ (y, x) ∈ R
So, R is symmetric.
Now, if xy is square of an integer and yz is square of an integer.
Then, let xy = m2 and yz = n2 for some m, n ∈ Z
x = m2/y and z = x2/y
xz = m2 n2/ y2, which is square of an integer.
Thus, R is transitive.

(iv) x + 4y = 10; x, y ∈ N
R = {(x, y): x + 4y = 10; x, y ∈ N}
R = {(2, 2), (6, 1)}
It’s clearly seen (1, 1) ∉ R
Hence, R is not symmetric.
(x, y) ∈ R ⇒ x + 4y = 10
And (y, z) ∈ R ⇒ y + 4z = 10
⇒ x – 16z = -30
⇒ (x, z) ∉ R
Therefore, R is not transitive.

23. Let A = {1, 2, 3, ... 9} and R be the relation in A ×A defined by (a, b) R (c, d) if a + d = b + c for
(a, b), (c, d) in A ×A. Prove that R is an equivalence relation and also obtain the equivalent class
[(2, 5)].
Solution:

Given, A = {1, 2, 3, ... 9} and (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) ∈ A ×A.
Let (a, b) R(a, b)
So, a + b = b + a, ∀ a, b ∈ A which is true for any a, b ∈ A.
Thus, R is reflexive.
Let (a, b) R(c, d)
Then,
a+d=b+c
c+b=d+a
(c, d) R(a, b)
Thus, R is symmetric.
Let (a, b) R(c, d) and (c, d) R(e, f)
a + d = b + c and c + f = d + e
a + d = b + c and d + e = c + f
(a + d) – (d + e = (b + c) – (c + f)
a–e=b–f
a+f=b+e
(a, b) R(e, f)
So, R is transitive.
The equivalence class [(2, 5)] = {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}
Therefore, R is an equivalence relation.

24. Using the definition, prove that the function f : A→ B is invertible if and only if f is both one-
one and onto.
Solution:

Let f: A → B be many-one function.

Let f(a) = p and f(b) = p
So, for inverse function we will have f-1(p) = a and f-1(p) = b
Thus, in this case inverse function is not defined as we have two images ‘a and b’ for one pre-image
‘p’. But for f to be invertible it must be one-one.
Now, let f: A → B is not onto function.
Let B = {p, q, r} and range of f be {p, q}.
Here image ‘r’ has not any pre-image, which will have no image in set A.
And for f to be invertible it must be onto.
Thus, ‘f’ is invertible if and only if ‘f’ is both one-one and onto.
A function f = X → Y is invertible iff f is a bijective function.

25. Functions f , g : R → R are defined, respectively, by f (x) = x2 + 3x + 1, g (x) = 2x – 3, find

(i) f o g (ii) g o f (iii) f o f (iv) g o g
Solution:

Given, f(x) = x2 + 3x + 1, g (x) = 2x – 3

(i) fog = f(g(x))
= f(2x - 3)
= (2x - 3)2 + 3(2x - 3) + 1
= 4x2 + 9 – 12x + 6x – 9 + 1
= 4x2 – 6x + 1
(ii) gof = g(f(x))
= g(x2 + 3x + 1)
= 2(x2 + 3x + 1) – 3
= 2x2 + 6x – 1
(iii) fof = f(f(x))
= f(x2 + 3x + 1)
= (x2 + 3x + 1)2 + 3(x2 + 3x + 1) + 1
= x4 + 9x2 + 1 + 6x3 + 6x + 2x2 + 3x2 + 9x + 3 + 1
= x4 + 6x3 + 14x2 + 15x + 5
(iv) gog = g(g(x))
= g(2x - 3)
= 2(2x - 3) – 3
= 4x – 6 – 3
= 4x - 9

26. Let * be the binary operation defined on Q. Find which of the following binary operations are
commutative
(i) a * b = a – b ∀ a, b ∈Q (ii) a * b = a2 + b2 ∀ a, b ∈ Q
(iii) a * b = a + ab ∀ a, b ∈ Q (iv) a * b = (a – b)2 ∀ a, b ∈ Q
Solution:

Given that * is a binary operation defined on Q.

(i) a * b = a – b, ∀ a, b ∈Q and b * a = b - a
So, a * b ≠ b * a
Thus, * is not commutative.
(ii) a * b = a2 + b2
b * a = b2 + a2
Thus, * is commutative.
(iii) a * b = a + ab
b * a = b + ab
So clearly, a + ab ≠ b + ab
Thus, * is not commutative.
(iv) a * b = (a - b)2, ∀ a, b ∈Q
b * a = (b –a)2
Since, (a - b)2 = (b - a)2
Thus, * is commutative.

27. Let * be binary operation defined on R by a * b = 1 + ab, ∀ a, b ∈ R. Then the operation * is

(i) commutative but not associative
(ii) associative but not commutative
(iii) neither commutative nor associative
(iv) both commutative and associative
Solution:

(i) Given that * is a binary operation defined on R by a * b = 1 + ab, ∀ a, b ∈ R

So, we have a * b = ab + 1 = b * a
So, * is a commutative binary operation.
Now, a * (b * c) = a * (1 + bc) = 1 + a (1 + bc) = 1 + a + abc
Also,
(a * b) * c = (1 + ab) * c = 1 + (1 + ab) c = 1 + c + abc
Thus, a * (b * c) ≠ (a * b) * c
Hence, * is not associative.
Therefore, * is commutative but not associative.

Objective Type Questions

Choose the correct answer out of the given four options in each of the Exercises from 28 to 47
(M.C.Q.)
28. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as
aRb if a is congruent to b ∀ a, b ∈ T. Then R is
(A) reflexive but not transitive (B) transitive but not symmetric
(C) equivalence (D) none of these
Solution:

(C) equivalence
Given aRb, if a is congruent to b, ∀ a, b ∈ T.
Then, we have aRa ⇒ a is congruent to a; which is always true.
So, R is reflexive.
Let aRb ⇒ a ~ b
b~a
bRa
So, R is symmetric.
Let aRb and bRc
a ~ b and b ~ c
a~c
aRc
So, R is transitive.
Therefore, R is equivalence relation.

29. Consider the non-empty set consisting of children in a family and a relation R defined as aRb
if a is brother of b. Then R is
(A) symmetric but not transitive (B) transitive but not symmetric
(C) neither symmetric nor transitive (D) both symmetric and transitive
Solution:

(B) transitive but not symmetric

aRb ⇒ a is brother of b.
This does not mean b is also a brother of a as b can be a sister of a.
Thus, R is not symmetric.
aRb ⇒ a is brother of b.
and bRc ⇒ b is brother of c.
So, a is brother of c.
Therefore, R is transitive.

30. The maximum number of equivalence relations on the set A = {1, 2, 3} are
(A) 1 (B) 2
(C) 3 (D) 5
Solution:

(D) 5
Given, set A = {1, 2, 3}
Now, the number of equivalence relations as follows
R1 = {(1, 1), (2, 2), (3, 3)}
R2 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
R3 = {(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)}
R4 = {(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)}
R5 = {(1, 2, 3) ⇔ A x A = A2}
Thus, maximum number of equivalence relation is ‘5’.

31. If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is

(A) reflexive (B) transitive
(C) symmetric (D) none of these
Solution:

(D) none of these

R on the set {1, 2, 3} be defined by R = {(1, 2)}
Hence, its clear that R is not reflexive, transitive and symmetric.
 NCERT TEXTBOOK SOLUTIONS
Chapter 1 – Chapter 1 Relations and Functions
Exercise 1.1
Question 1:

Determine whether each of the following relations are reflexive, symmetric and transitive:

1. Relation R in the set A = {1, 2, 3…13, 14} defined as

R = {(x, y): 3x − y = 0}

2. Relation R in the set N of natural numbers defined as

R = {(x, y): y = x + 5 and x < 4}

3. Relation R in the set A = {1, 2, 3, 4, 5, 6} as

R = {(x, y): y is divisible by x}

4. Relation R in the set Z of all integers defined as

R = {(x, y): x − y is as integer}

5. Relation R in the set A of human beings in a town at a particular time given by

a) R = {(x, y): x and y work at the same place}

b) R = {(x, y): x and y live in the same locality}
c) R = {(x, y): x is exactly 7 cm taller than y}
d) R = {(x, y): x is wife of y}
e) R = {(x, y): x is father of y}

Answer:

(i) A = {1, 2, 3 … 13, 14}

R = {(x, y): 3x − y = 0}

∴R = {(1, 3), (2, 6), (3, 9), (4, 12)}

R is not reflexive since (1, 1), (2, 2) … (14, 14) ∉ R.

Also, R is not symmetric as (1, 3) ∈R, but (3, 1) ∉ R. [3(3) − 1 ≠ 0]

Also, R is not transitive as (1, 3), (3, 9) ∈R, but (1, 9) ∉ R.

[3(1) − 9 ≠ 0]

Hence, R is neither reflexive, nor symmetric, nor transitive.

(ii) R = {(x, y): y = x + 5 and x < 4} = {(1, 6), (2, 7), (3, 8)}

It is seen that (1, 1) ∉ R.

∴R is not reflexive.

(1, 6) ∈R

But,

(6, 1) ∉ R.

∴R is not symmetric.

Now, since there is no pair in R such that (x, y) and (y, z) ∈R, then (x, z) cannot belong to R.

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

(iii) A = {1, 2, 3, 4, 5, 6}

R = {(x, y): y is divisible by x}

We know that any number (x) is divisible by itself.

(x, x) ∈R

∴R is reflexive.

Now,

(2, 4) ∈R [as 4 is divisible by 2]

But,

(4, 2) ∉ R. [as 2 is not divisible by 4]

∴R is not symmetric.

Let (x, y), (y, z) ∈ R. Then, y is divisible by x and z is divisible by y.

∴z is divisible by x.
⇒ (x, z) ∈R

∴R is transitive.

Hence, R is reflexive and transitive but not symmetric.

(iv) R = {(x, y): x − y is an integer}

Now, for every x ∈ Z, (x, x) ∈R as x − x = 0 is an integer.

∴R is reflexive.

Now, for every x, y ∈ Z if (x, y) ∈ R, then x − y is an integer.

⇒ −(x − y) is also an integer.

⇒ (y − x) is an integer.

∴ (y, x) ∈ R

∴R is symmetric.

Now,

Let (x, y) and (y, z) ∈R, where x, y, z ∈ Z.

⇒ (x − y) and (y − z) are integers.

⇒ x − z = (x − y) + (y − z) is an integer.

∴ (x, z) ∈R

∴R is transitive.

Hence, R is reflexive, symmetric, and transitive.

(v) (a) R = {(x, y): x and y work at the same place}

(x, x) ∈ R

∴ R is reflexive.

If (x, y) ∈ R, then x and y work at the same place.

⇒ y and x work at the same place.

⇒ (y, x) ∈ R.
∴R is symmetric.

Now, let (x, y), (y, z) ∈ R

⇒ x and y work at the same place and y and z work at the same place.

⇒ x and z work at the same place.

⇒ (x, z) ∈R

∴ R is transitive.

Hence, R is reflexive, symmetric, and transitive.

(b) R = {(x, y): x and y live in the same locality}

Clearly (x, x) ∈ R as x and x is the same human being.

∴ R is reflexive.

If (x, y) ∈R, then x and y live in the same locality.

⇒ y and x live in the same locality.

⇒ (y, x) ∈ R

∴R is symmetric.

Now, let (x, y) ∈ R and (y, z) ∈ R.

⇒ x and y live in the same locality and y and z live in the same locality.

⇒ x and z live in the same locality.

⇒ (x, z) ∈ R

∴ R is transitive.

Hence, R is reflexive, symmetric, and transitive.

(c) R = {(x, y): x is exactly 7 cm taller than y}

Now,

(x, x) ∉ R

Since human being x cannot be taller than himself.

∴R is not reflexive.

Now, let (x, y) ∈R.

⇒ x is exactly 7 cm taller than y.

Then, y is not taller than x.

∴ (y, x) ∉R

Indeed if x is exactly 7 cm taller than y, then y is exactly 7 cm shorter than x.

∴R is not symmetric.

Now,

Let (x, y), (y, z) ∈ R.

⇒ x is exactly 7 cm taller thany and y is exactly 7 cm taller than z.

⇒ x is exactly 14 cm taller than z .

∴(x, z) ∉R

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

(d) R = {(x, y): x is the wife of y}

Now,

(x, x) ∉ R

Since x cannot be the wife of herself.

∴R is not reflexive.

Now, let (x, y) ∈ R

⇒ x is the wife of y.

Clearly y is not the wife of x.

∴(y, x) ∉ R

Indeed if x is the wife of y, then y is the husband of x.

∴ R is not symmetric.

Let (x, y), (y, z) ∈ R

⇒ x is the wife of y and y is the wife of z.

This case is not possible. Also, this does not imply that x is the wife of z.

∴(x, z) ∉ R

∴R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

(e) R = {(x, y): x is the father of y}

(x, x) ∉ R

As x cannot be the father of himself.

∴R is not reflexive.

Now, let (x, y) ∈R.

⇒ x is the father of y.

⇒ y cannot be the father of y.

Indeed, y is the son or the daughter of y.

∴(y, x) ∉ R

∴ R is not symmetric.

Now, let (x, y) ∈ R and (y, z) ∈ R.

⇒ x is the father of y and y is the father of z.

⇒ x is not the father of z.

Indeed x is the grandfather of z.

∴ (x, z) ∉ R

∴R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

Question 2:

Show that the relation R in the set R of real numbers, defined as

R = {(a, b): a ≤ b2} is neither reflexive nor symmetric nor transitive.

Answer:

R = {(a, b): a ≤ b2}

It can be observed that

∴R is not reflexive.

Now, (1, 4) ∈ R as 1 < 42

But, 4 is not less than 12.

∴(4, 1) ∉ R

∴R is not symmetric.

Now,

(3, 2), (2, 1.5) ∈ R

(as 3 < 22 = 4 and 2 < (1.5)2 = 2.25)

But, 3 > (1.5)2 = 2.25

∴(3, 1.5) ∉ R

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

Question 3:

Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as

R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.

Answer:

Let A = {1, 2, 3, 4, 5, 6}.

A relation R is defined on set A as:

R = {(a, b): b = a + 1}

∴R = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)}

We can find (a, a) ∉ R, where a ∈ A.

For instance,

(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6) ∉ R

∴R is not reflexive.

It can be observed that (1, 2) ∈ R, but (2, 1) ∉ R.

∴R is not symmetric.

Now, (1, 2), (2, 3) ∈ R

But,

(1, 3) ∉ R

∴R is not transitive

Hence, R is neither reflexive, nor symmetric, nor transitive.

Question 4:

Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not
symmetric.

Answer:

R = {(a, b); a ≤ b}

Clearly (a, a) ∈ R as a = a.

∴R is reflexive.

Now,

(2, 4) ∈ R (as 2 < 4)

But, (4, 2) ∉ R as 4 is greater than 2.

∴ R is not symmetric.
Now, let (a, b), (b, c) ∈ R.

Then,

a ≤ b and b ≤ c

⇒a≤c

⇒ (a, c) ∈ R

∴R is transitive.

Hence,R is reflexive and transitive but not symmetric.

Question 5:

Check whether the relation R in R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or
transitive.

Answer:

R = {(a, b): a ≤ b3}

It is observed that

∴ R is not reflexive.

Now,

(1, 2) ∈ R (as 1 < 23 = 8)

But,

(2, 1) ∉ R (as 2 > 13 = 1)

∴ R is not symmetric.

We have

But
∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

Question 6:

Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but
neither reflexive nor transitive.

Answer:

Let A = {1, 2, 3}.

A relation R on A is defined as R = {(1, 2), (2, 1)}.

It is seen that (1, 1), (2, 2), (3, 3) ∉R.

∴ R is not reflexive.

Now, as (1, 2) ∈ R and (2, 1) ∈ R, then R is symmetric.

Now, (1, 2) and (2, 1) ∈ R

However,

(1, 1) ∉ R

∴ R is not transitive.

Hence, R is symmetric but neither reflexive nor transitive.

Question 7:

Show that the relation R in the set A of all the books in a library of a college, given by R =
{(x, y): x and y have same number of pages} is an equivalence relation.

Answer:

Set A is the set of all books in the library of a college.

R = {x, y): x and y have the same number of pages}

Now, R is reflexive since (x, x) ∈ R as x and x has the same number of pages.

Let (x, y) ∈ R ⇒ x and y have the same number of pages.

⇒ y and x have the same number of pages.

⇒ (y, x) ∈ R

∴R is symmetric.

Now, let (x, y) ∈R and (y, z) ∈ R.

⇒ x and y and have the same number of pages and y and z have the same number of
pages.

⇒ x and z have the same number of pages.

⇒ (x, z) ∈ R

∴R is transitive.

Hence, R is an equivalence relation.

Question 8:

Show that the relation R in the set A = {1, 2, 3, 4, 5} given by

, is an equivalence relation. Show that all the elements of {1, 3,

5} are related to each other and all the elements of {2, 4} are related to each other. But no
element of {1, 3, 5} is related to any element of {2, 4}.

Answer:

A = {1, 2, 3, 4, 5}

It is clear that for any element a ∈A, we have (which is even).

∴R is reflexive.

Let (a, b) ∈ R.

∴R is symmetric.
Now, let (a, b) ∈ R and (b, c) ∈ R.

⇒ (a, c) ∈ R

∴R is transitive.

Hence, R is an equivalence relation.

Now, all elements of the set {1, 3, 5} are related to each other as all the elements of this
subset are odd. Thus, the modulus of the difference between any two elements will be
even.

Similarly, all elements of the set {2, 4} are related to each other as all the elements of this
subset are even.

Also, no element of the subset {1, 3, 5} can be related to any element of {2, 4} as all
elements of {1, 3, 5} are odd and all elements of {2, 4} are even. Thus, the modulus of the
difference between the two elements (from each of these two subsets) will not be even.

Question 9:

Show that each of the relation R in the set , given by

(i)

(ii)

is an equivalence relation. Find the set of all elements related to 1 in each case.

Answer:

(i)

For any element a ∈A, we have (a, a) ∈ R as is a multiple of 4.

∴R is reflexive.

Now, let (a, b) ∈ R ⇒ is a multiple of 4.

⇒ (b, a) ∈ R

∴R is symmetric.

Now, let (a, b), (b, c) ∈ R.

⇒ (a, c) ∈R

∴ R is transitive.

Hence, R is an equivalence relation.

The set of elements related to 1 is {1, 5, 9} since

(ii) R = {(a, b): a = b}

For any element a ∈A, we have (a, a) ∈ R, since a = a.

∴R is reflexive.

Now, let (a, b) ∈ R.

⇒a=b

⇒b=a

⇒ (b, a) ∈ R
∴R is symmetric.

Now, let (a, b) ∈ R and (b, c) ∈ R.

⇒ a = b and b = c

⇒a=c

⇒ (a, c) ∈ R

∴ R is transitive.

Hence, R is an equivalence relation.

The elements in R that are related to 1 will be those elements from set A which are equal
to 1.

Hence, the set of elements related to 1 is {1}.

Question 10:

Given an example of a relation. Which is

a) Symmetric but neither reflexive nor transitive.

b) Transitive but neither reflexive nor symmetric.
c) Reflexive and symmetric but not transitive.
d) Reflexive and transitive but not symmetric.
e) Symmetric and transitive but not reflexive.

Answer:

(i) Let A = {5, 6, 7}.

Define a relation R on A as R = {(5, 6), (6, 5)}.

Relation R is not reflexive as (5, 5), (6, 6), (7, 7) ∉ R.

Now, as (5, 6) ∈ R and also (6, 5) ∈ R, R is symmetric.

(5, 6), (6, 5) ∈ R, but (5, 5) ∉ R

∴R is not transitive.

Hence, relation R is symmetric but not reflexive or transitive.

(ii)Consider a relation R in R defined as:

R = {(a, b): a < b}

For any a ∈ R, we have (a, a) ∉ R since a cannot be strictly less than a itself. In fact, a = a.

∴ R is not reflexive.

Now,

(1, 2) ∈ R (as 1 < 2)

But, 2 is not less than 1.

∴ (2, 1) ∉ R

∴ R is not symmetric.

Now, let (a, b), (b, c) ∈ R.

⇒ a < b and b < c

⇒a<c

⇒ (a, c) ∈ R

∴R is transitive.

Hence, relation R is transitive but not reflexive and symmetric.

(iii)Let A = {4, 6, 8}.

Define a relation R on A as:

A = {(4, 4), (6, 6), (8, 8), (4, 6), (6, 4), (6, 8), (8, 6)}

Relation R is reflexive since for every a ∈ A, (a, a) ∈R i.e., (4, 4), (6, 6), (8, 8)} ∈ R.

Relation R is symmetric since (a, b) ∈ R ⇒ (b, a) ∈ R for all a, b ∈ R.

Relation R is not transitive since (4, 6), (6, 8) ∈ R, but (4, 8) ∉ R.

Hence, relation R is reflexive and symmetric but not transitive.

(iv) Define a relation R in R as:

R = {a, b): a3 ≥ b3}

Clearly (a, a) ∈ R as a3 = a3.

∴R is reflexive.

Now,

(2, 1) ∈ R (as 23 ≥ 13)

But,

(1, 2) ∉ R (as 13 < 23)

∴ R is not symmetric.

Now,

Let (a, b), (b, c) ∈ R.

⇒ a3 ≥ b3 and b3 ≥ c3

⇒ a3 ≥ c3

⇒ (a, c) ∈ R

∴R is transitive.

Hence, relation R is reflexive and transitive but not symmetric.

(v) Let A = {−5, −6}.

Define a relation R on A as:

R = {(−5, −6), (−6, −5), (−5, −5)}

Relation R is not reflexive as (−6, −6) ∉ R.

Relation R is symmetric as (−5, −6) ∈ R and (−6, −5}∈R.

It is seen that (−5, −6), (−6, −5) ∈ R. Also, (−5, −5) ∈ R.

∴The relation R is transitive.

Hence, relation R is symmetric and transitive but not reflexive.

Question 11:

Show that the relation R in the set A of points in a plane given by R = {(P, Q): distance of the
point P from the origin is same as the distance of the point Q from the origin}, is an
equivalence relation. Further, show that the set of all point related to a point P ≠ (0, 0) is
the circle passing through P with origin as centre.

Answer:

R = {(P, Q): distance of point P from the origin is the same as the distance of point Q from
the origin}

Clearly, (P, P) ∈ R since the distance of point P from the origin is always the same as the
distance of the same point P from the origin.

∴R is reflexive.

Now,

Let (P, Q) ∈ R.

⇒ The distance of point P from the origin is the same as the distance of point Q from the
origin.

⇒ The distance of point Q from the origin is the same as the distance of point P from the
origin.

⇒ (Q, P) ∈ R

∴R is symmetric.

Now,

Let (P, Q), (Q, S) ∈ R.

⇒ The distance of points P and Q from the origin is the same and also, the distance of
points Q and S from the origin is the same.

⇒ The distance of points P and S from the origin is the same.

⇒ (P, S) ∈ R

∴R is transitive.

Therefore, R is an equivalence relation.

The set of all points related to P ≠ (0, 0) will be those points whose distance from the origin
is the same as the distance of point P from the origin.

In other words, if O (0, 0) is the origin and OP = k, then the set of all points related to P is at
a distance of k from the origin.
Hence, this set of points forms a circle with the centre as the origin and this circle passes
through point P.

Question 12:

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

Answer:

R = {(T1, T2): T1 is similar to T2}

R is reflexive since every triangle is similar to itself.

Further, if (T1, T2) ∈ R, then T1 is similar to T2.

⇒ T2 is similar to T1.

⇒ (T2, T1) ∈R

∴R is symmetric.

Now,

Let (T1, T2), (T2, T3) ∈ R.

⇒ T1 is similar to T2 and T2 is similar to T3.

⇒ T1 is similar to T3.

⇒ (T1, T3) ∈ R

∴ R is transitive.

Thus, R is an equivalence relation.

Now, we can observe that:

∴The corresponding sides of triangles T1 and T3 are in the same ratio.

Then, triangle T1 is similar to triangle T3.

Hence, T1 is related to T3.

Question 13:

Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have
same number of sides}, is an equivalence relation. What is the set of all elements
in A related to the right angle triangle T with sides 3, 4 and 5?

Answer:

R = {(P1, P2): P1 and P2 have same the number of sides}

R is reflexive since (P1, P1) ∈ R as the same polygon has the same number of sides with
itself.

Let (P1, P2) ∈ R.

⇒ P1 and P2 have the same number of sides.

⇒ P2 and P1 have the same number of sides.

⇒ (P2, P1) ∈ R

∴R is symmetric.

Now,

Let (P1, P2), (P2, P3) ∈ R.

⇒ P1 and P2 have the same number of sides. Also, P2 and P3 have the same number of
sides.

⇒ P1 and P3 have the same number of sides.

⇒ (P1, P3) ∈ R

∴R is transitive.

Hence, R is an equivalence relation.

The elements in A related to the right-angled triangle (T) with sides 3, 4, and 5 are those
polygons which have 3 sides (since T is a polygon with 3 sides).

Hence, the set of all elements in A related to triangle T is the set of all triangles.

Question 14:
Let L be the set of all lines in XY plane and R be the relation in L defined as R =
{(L1, L2): L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines
related to the line y = 2x + 4.

Answer:

R = {(L1, L2): L1 is parallel to L2}

R is reflexive as any line L1 is parallel to itself i.e., (L1, L1) ∈ R.

Now,

Let (L1, L2) ∈ R.

⇒ L1 is parallel to L2.

⇒ L2 is parallel to L1.

⇒ (L2, L1) ∈ R

∴ R is symmetric.

Now,

Let (L1, L2), (L2, L3) ∈R.

⇒ L1 is parallel to L2. Also, L2 is parallel to L3.

⇒ L1 is parallel to L3.

∴R is transitive.

Hence, R is an equivalence relation.

The set of all lines related to the line y = 2x + 4 is the set of all lines that are parallel to the
line y = 2x + 4.

Slope of line y = 2x + 4 is m = 2

It is known that parallel lines have the same slopes.

The line parallel to the given line is of the form y = 2x + c, where c ∈R.

Hence, the set of all lines related to the given line is given by y = 2x + c, where c ∈ R.

Question 15:
Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3),
(3, 2)}. Choose the correct Answer.

a) R is reflexive and symmetric but not transitive.

b) R is reflexive and transitive but not symmetric.
c) R is symmetric and transitive but not reflexive.
d) R is an equivalence relation.

Answer:

R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}

It is seen that (a, a) ∈ R, for every a ∈{1, 2, 3, 4}.

∴ R is reflexive.

It is seen that (1, 2) ∈ R, but (2, 1) ∉ R.

∴R is not symmetric.

Also, it is observed that (a, b), (b, c) ∈ R ⇒ (a, c) ∈ R for all a, b, c ∈ {1, 2, 3, 4}.

∴ R is transitive.

Hence, R is reflexive and transitive but not symmetric.

The correct Answer is B.

Question 16:

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

a) (2, 4) ∈ R
b) (3, 8) ∈R
c) (6, 8) ∈R
d) (8, 7) ∈ R

Answer:

R = {(a, b): a = b − 2, b > 6}

Now, since b > 6, (2, 4) ∉ R

Also, as 3 ≠ 8 − 2, (3, 8) ∉ R

And, as 8 ≠ 7 − 2
 (8, 7) ∉ R

Now, consider (6, 8).

We have 8 > 6 and also, 6 = 8 − 2.

∴(6, 8) ∈ R

The correct Answer is C.

EXERCISE 1.2

Question 1:

Show that the function f: R* → R* defined by is one-one and onto, where R* is the
set of all non-zero real numbers. Is the result true, if the domain R* is replaced by N with co-
domain being same as R*?

Answer:

It is given that f: R* → R* is defined by

One-one:

∴f is one-one.

Onto:

It is clear that for y∈ R*, there exists such that

∴f is onto.
Thus, the given function (f) is one-one and onto.

Now, consider function g: N → R*defined by

We have,

∴g is one-one.

Further, it is clear that g is not onto as for 1.2 ∈R* there does not exit any x in N such

that g(x) = .

Hence, function g is one-one but not onto.

Question 2:

Check the injectivity and surjectivity of the following functions:

(i) f: N → N given by f(x) = x2

(ii) f: Z → Z given by f(x) = x2

(iii) f: R → R given by f(x) = x2

(iv) f: N → N given by f(x) = x3

(v) f: Z → Z given by f(x) = x3

Answer:

(i) f: N → N is given by,

f(x) = x2

It is seen that for x, y ∈N, f(x) = f(y) ⇒ x2 = y2 ⇒ x = y.

∴f is injective.

Now, 2 ∈ N. But, there does not exist any x in N such that f(x) = x2 = 2.
∴ f is not surjective.

Hence, function f is injective but not surjective.

(ii) f: Z → Z is given by,

f(x) = x2

It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.

∴ f is not injective.

Now,−2 ∈ Z. But, there does not exist any element x ∈Z such that f(x) = x2 = −2.

∴ f is not surjective.

Hence, function f is neither injective nor surjective.

(iii) f: R → R is given by,

f(x) = x2

It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.

∴ f is not injective.

Now,−2 ∈ R. But, there does not exist any element x ∈ R such that f(x) = x2 = −2.

∴ f is not surjective.

Hence, function f is neither injective nor surjective.

(iv) f: N → N given by,

f(x) = x3

It is seen that for x, y ∈N, f(x) = f(y) ⇒ x3 = y3 ⇒ x = y.

∴f is injective.

Now, 2 ∈ N. But, there does not exist any element x in domain N such that f(x) = x3 = 2.

∴ f is not surjective

Hence, function f is injective but not surjective.

(v) f: Z → Z is given by,

f(x) = x3

It is seen that for x, y ∈ Z, f(x) = f(y) ⇒ x3 = y3 ⇒ x = y.

∴ f is injective.

Now, 2 ∈ Z. But, there does not exist any element x in domain Z such that f(x) = x3 = 2.

∴ f is not surjective.

Hence, function f is injective but not surjective.

Question 3:

Prove that the Greatest Integer Function f: R → R given by f(x) = [x], is neither one-once nor
onto, where [x] denotes the greatest integer less than or equal to x.

Answer:

f: R → R is given by,

f(x) = [x]

It is seen that f(1.2) = [1.2] = 1, f(1.9) = [1.9] = 1.

∴ f(1.2) = f(1.9), but 1.2 ≠ 1.9.

∴ f is not one-one.

Now, consider 0.7 ∈ R.

It is known that f(x) = [x] is always an integer. Thus, there does not exist any
element x ∈ R such that f(x) = 0.7.

∴ f is not onto.

Hence, the greatest integer function is neither one-one nor onto.

Question 4:

Show that the Modulus Function f: R → R given by , is neither one-one nor onto,
where is x, if x is positive or 0 and is − x, if x is negative.

Answer:

f: R → R is given by,
It is seen that .

∴f(−1) = f(1), but −1 ≠ 1.

∴ f is not one-one.

Now, consider −1 ∈ R.

It is known that f(x) = is always non-negative. Thus, there does not exist any
element x in domain R such that f(x) = = −1.

∴ f is not onto.

Hence, the modulus function is neither one-one nor onto.

Question 5:

Show that the Signum Function f: R → R, given by

is neither one-one nor onto.

Answer:

f: R → R is given by,

It is seen that f(1) = f(2) = 1, but 1 ≠ 2.

∴f is not one-one.

Now, as f(x) takes only 3 values (1, 0, or −1) for the element −2 in co-domain R, there does
not exist any x in domain R such that f(x) = −2.
∴ f is not onto.

Hence, the signum function is neither one-one nor onto.

Question 6:

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.
Show that f is one-one.

Answer:

It is given that A = {1, 2, 3}, B = {4, 5, 6, 7}.

f: A → B is defined as f = {(1, 4), (2, 5), (3, 6)}.

∴ f (1) = 4, f (2) = 5, f (3) = 6

It is seen that the images of distinct elements of A under f are distinct.

Hence, function f is one-one.

Question 7:

In each of the following cases, state whether the function is one-one, onto or bijective.
Justify your Answer.

(i) f: R → R defined by f(x) = 3 − 4x

(ii) f: R → R defined by f(x) = 1 + x2

Answer:

(i) f: R → R is defined as f(x) = 3 − 4x.

∴ f is one-one.

For any real number (y) in R, there exists in R such that

∴f is onto.

Hence, f is bijective.

(ii) f: R → R is defined as

∴ does not imply that

For instance,

∴ f is not one-one.

Consider an element −2 in co-domain R.

It is seen that is positive for all x ∈ R.

Thus, there does not exist any x in domain R such that f(x) = −2.

∴ f is not onto.

Hence, f is neither one-one nor onto.

Question 8:

Let A and B be sets. Show that f: A × B → B × A such that (a, b) = (b, a) is bijective function.

Answer:

f: A × B → B × A is defined as f(a, b) = (b, a).

 .

∴ f is one-one.

Now, let (b, a) ∈ B × A be any element.

Then, there exists (a, b) ∈A × B such that f(a, b) = (b, a). [By definition of f]

∴ f is onto.

Hence, f is bijective.

Question 9:

Let f: N → N be defined by

State whether the function f is bijective. Justify your Answer.

Answer:

f: N → N is defined as

It can be observed that:

∴ f is not one-one.

Consider a natural number (n) in co-domain N.

Case I: n is odd

∴n = 2r + 1 for some r ∈ N. Then, there exists 4r + 1∈N such that

Case II: n is even

∴n = 2r for some r ∈ N. Then,there exists 4r ∈N such that .

∴ f is onto.

Hence, f is not a bijective function.

Question 10:

Let A = R − {3} and B = R − {1}. Consider the function f: A → B defined by

. Is f one-one and onto? Justify your Answer.

Answer:

A = R − {3}, B = R − {1}

f: A → B is defined as .

∴ f is one-one.
Let y ∈B = R − {1}. Then, y ≠ 1.

The function f is onto if there exists x ∈A such that f(x) = y.

Now,

Thus, for any y ∈ B, there exists such that

Hence, function f is one-one and onto.

Question 11:

Let f: R → R be defined as f(x) = x4. Choose the correct Answer.

(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

Answer:

f: R → R is defined as

Let x, y ∈ R such that f(x) = f(y).

∴ does not imply that .

For instance,

∴ f is not one-one.

Consider an element 2 in co-domain R. It is clear that there does not exist any x in
domain R such that f(x) = 2.

∴ f is not onto.

Hence, function f is neither one-one nor onto.

The correct Answer is D.

Question 12:

Let f: R → R be defined as f(x) = 3x. Choose the correct Answer.

(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

Answer:

f: R → R is defined as f(x) = 3x.

Let x, y ∈ R such that f(x) = f(y).

⇒ 3x = 3y

⇒x=y

∴f is one-one.
Also, for any real number (y) in co-domain R, there exists in R such that

∴f is onto.

Hence, function f is one-one and onto.

The correct Answer is A.

Miscellaneous Exercise

Question 1:

Show that function f: R → {x ∈ R: −1 < x < 1} defined by f(x) = , x ∈R is one-one and

onto function.

Answer:

It is given that f: R → {x ∈ R: −1 < x < 1} is defined as f(x) = , x ∈R.

Suppose f(x) = f(y), where x, y ∈ R.

It can be observed that if x is positive and y is negative, then we have:

Since x is positive and y is negative:

x>y⇒x−y>0

But, 2xy is negative.

Then, .

Thus, the case of x being positive and y being negative can be ruled out.
Under a similar argument, x being negative and y being positive can also be ruled out

x and y have to be either positive or negative.

When x and y are both positive, we have:

When x and y are both negative, we have:

∴ f is one-one.

Now, let y ∈ R such that −1 < y < 1.

If x is negative, then there exists such that

If x is positive, then there exists such that

∴ f is onto.

Hence, f is one-one and onto.

Question 2:

Show that the function f: R → R given by f(x) = x3 is injective.

Answer:

f: R → R is given as f(x) = x3.

Suppose f(x) = f(y), where x, y ∈ R.

⇒ x3 = y3 … (1)

Now, we need to show that x = y.

Suppose x ≠ y, their cubes will also not be equal.

x3 ≠ y3

However, this will be a contradiction to (1).

∴x=y

Hence, f is injective.

Question 3:

Given a non empty set X, consider P(X) which is the set of all subsets of X.

Define the relation R in P(X) as follows:

For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)?

Justify you Answer:

Answer:

Since every set is a subset of itself, ARA for all A ∈ P(X).

∴R is reflexive.

Let ARB ⇒ A ⊂ B.

This cannot be implied to B ⊂ A.

For instance, if A = {1, 2} and B = {1, 2, 3}, then it cannot be implied that B is related to A.

∴ R is not symmetric.

Further, if ARB and BRC, then A ⊂ B and B ⊂ C.

⇒A⊂C

⇒ ARC
∴ R is transitive.

Hence, R is not an equivalence relation since it is not symmetric.

Question 4:

Find the number of all onto functions from the set {1,2,3,....,n} to itself.

Answer:

Taking set {1, 2, 3}

Since f is onto,all elements of{1, 2, 3} have unique pre-image.

Total no. of one-one function = 3 × 2 × 1 = 6

eg:-Since f is onto,all elements of {1, 2, 3} have unique pre-image.

total no. of onto functions = n × n – 1 × n – 2 × 2 × 1 = n!

Question 11:

Let S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.

(i) F = {(a, 3), (b, 2), (c, 1)} (ii) F = {(a, 2), (b, 1), (c, 1)}

Answer:

S = {a, b, c}, T = {1, 2, 3}

(i) F: S → T is defined as:

F = {(a, 3), (b, 2), (c, 1)}

⇒ F (a) = 3, F (b) = 2, F(c) = 1

Therefore, F−1: T → S is given by

F−1 = {(3, a), (2, b), (1, c)}.

(ii) F: S → T is defined as:

F = {(a, 2), (b, 1), (c, 1)}

Since F (b) = F (c) = 1, F is not one-one.

Hence, F is not invertible i.e., F−1 does not exist.

Question 5:

Let A = {−1, 0, 1, 2}, B = {−4, −2, 0, 2} and f, g: A → B be functions defined by f(x) = x2 − x, x ∈

A and . Are f and g equal?

Justify your Answer.

(Hint: One may note that two function f: A → B and g: A → B such that f(a) = g(a)
&mnForE;a ∈A, are called equal functions).

Answer:

It is given that A = {−1, 0, 1, 2}, B = {−4, −2, 0, 2}.

Also, it is given that f, g: A → B are defined by f(x) = x2 − x, x ∈ A and

It is observed that:
Hence, the functions f and g are equal.

Question 6:

Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive
and symmetric but not transitive is

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

Answer:

The given set is A = {1, 2, 3}.

The smallest relation containing (1, 2) and (1, 3) which is reflexive and symmetric, but not
transitive is given by:

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

This is because relation R is reflexive as (1, 1), (2, 2), (3, 3) ∈ R.

Relation R is symmetric since (1, 2), (2, 1) ∈R and (1, 3), (3, 1) ∈R.
But relation R is not transitive as (3, 1), (1, 2) ∈ R, but (3, 2) ∉ R.

Now, if we add any two pairs (3, 2) and (2, 3) (or both) to relation R, then relation R will
become transitive.

Hence, the total number of desired relations is one.

The correct Answer is A.

Question 7:

Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is

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

Answer:

It is given that A = {1, 2, 3}.

The smallest equivalence relation containing (1, 2) is given by,

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

Now, we are left with only four pairs i.e., (2, 3), (3, 2), (1, 3), and (3, 1).

If we odd any one pair [say (2, 3)] to R1, then for symmetry we must add (3, 2). Also, for
transitivity we are required to add (1, 3) and (3, 1).

Hence, the only equivalence relation (bigger than R1) is the universal relation.

This shows that the total number of equivalence relations containing (1, 2) is two.

The correct Answer is B.

Question 18:

Let f: R → R be the Signum Function defined as

and g: R → R be the Greatest Integer Function given by g(x) = [x], where [x] is greatest
integer less than or equal to x. Then does fog and gof coincide in (0, 1]?

Answer:
It is given that,

f: R → R is defined as

Also, g: R → R is defined as g(x) = [x], where [x] is the greatest integer less than or equal
to x.

Now, let x ∈ (0, 1].

Then, we have:

[x] = 1 if x = 1 and [x] = 0 if 0 < x < 1.

Thus, when x ∈ (0, 1), we have fog(x) = 0and gof (x) = 1.

Hence, fog and gof do not coincide in (0, 1].

Question 19:

Number of binary operations on the set {a, b} are

(A) 10 (B) 16 (C) 20 (D) 8

Answer:

A binary operation * on {a, b} is a function from {a, b} × {a, b} → {a, b}

i.e., * is a function from {(a, a), (a, b), (b, a), (b, b)} → {a, b}.

Hence, the total number of binary operations on the set {a, b} is 24 i.e., 16.

The correct Answer is B.

Page 1
Class 12th mathematics

01 RELATIONS AND FUNCTIONS

MIND MAP
CLICK TO DOWNLOAD MORE CHAPTERS
Dear Teachers and Students,

Join School of Educators' exclusive WhatsApp, Telegram, and Signal groups for FREE access
to a vast range of educational resources designed to help you achieve 100/100 in exams!
Separate groups for teachers and students are available, packed with valuable content to
boost your performance.

Additionally, benefit from expert tips, practical advice, and study hacks designed to enhance
performance in both CBSE exams and competitive entrance tests.

Don’t miss out—join today and take the first step toward academic excellence!

Join the Teachers and Students

Group by Clicking the Link Below
JOIN OUR
WHATSAPP
GROUPS
FOR FREE EDUCATIONAL
RESOURCES
JOIN SCHOOL OF EDUCATORS WHATSAPP GROUPS
FOR FREE EDUCATIONAL RESOURCES
We are thrilled to introduce the School of Educators WhatsApp Group, a
platform designed exclusively for educators to enhance your teaching & Learning
experience and learning outcomes. Here are some of the key benefits you can
expect from joining our group:

BENEFITS OF SOE WHATSAPP GROUPS

Abundance of Content: Members gain access to an extensive repository of

educational materials tailored to their class level. This includes various formats such
as PDFs, Word files, PowerPoint presentations, lesson plans, worksheets, practical
tips, viva questions, reference books, smart content, curriculum details, syllabus,
marking schemes, exam patterns, and blueprints. This rich assortment of resources
enhances teaching and learning experiences.

Immediate Doubt Resolution: The group facilitates quick clarification of doubts.

Members can seek assistance by sending messages, and experts promptly respond
to queries. This real-time interaction fosters a supportive learning environment
where educators and students can exchange knowledge and address concerns
effectively.

Access to Previous Years' Question Papers and Topper Answers: The group
provides access to previous years' question papers (PYQ) and exemplary answer
scripts of toppers. This resource is invaluable for exam preparation, allowing
individuals to familiarize themselves with the exam format, gain insights into scoring
techniques, and enhance their performance in assessments.
 Free and Unlimited Resources: Members enjoy the benefit of accessing an array of
educational resources without any cost restrictions. Whether its study materials,
teaching aids, or assessment tools, the group offers an abundance of resources
tailored to individual needs. This accessibility ensures that educators and students
have ample support in their academic endeavors without financial constraints.

Instant Access to Educational Content: SOE WhatsApp groups are a platform where
teachers can access a wide range of educational content instantly. This includes study
materials, notes, sample papers, reference materials, and relevant links shared by
group members and moderators.

Timely Updates and Reminders: SOE WhatsApp groups serve as a source of timely
updates and reminders about important dates, exam schedules, syllabus changes, and
academic events. Teachers can stay informed and well-prepared for upcoming
assessments and activities.

Interactive Learning Environment: Teachers can engage in discussions, ask questions,

and seek clarifications within the group, creating an interactive learning environment.
This fosters collaboration, peer learning, and knowledge sharing among group
members, enhancing understanding and retention of concepts.

Access to Expert Guidance: SOE WhatsApp groups are moderated by subject matter
experts, teachers, or experienced educators can benefit from their guidance,
expertise, and insights on various academic topics, exam strategies, and study
techniques.

Join the School of Educators WhatsApp Group today and unlock a world of resources,
support, and collaboration to take your teaching to new heights. To join, simply click
on the group links provided below or send a message to +91-95208-77777 expressing
your interest.

Together, let's empower ourselves & Our Students and

inspire the next generation of learners.

Best Regards,
Team
School of Educators
 Join School of Educators WhatsApp Groups

You will get Pre- Board Papers PDF, Word file, PPT, Lesson Plan, Worksheet, practical
tips and Viva questions, reference books, smart content, curriculum, syllabus,
marking scheme, toppers answer scripts, revised exam pattern, revised syllabus,
Blue Print etc. here . Join Your Subject / Class WhatsApp Group.

Kindergarten to Class XII (For Teachers Only)

Class 1 Class 2 Class 3

Class 4 Class 5 Class 6

Class 7 Class 8 Class 9

Class 10 Class 11 (Science) Class 11 (Humanities)

Class 11 (Commerce) Class 12 (Science) Class 12 (Humanities)

Class 12 (Commerce) Kindergarten

Subject Wise Secondary and Senior Secondary Groups
(IX & X For Teachers Only)
Secondary Groups (IX & X)

SST Mathematics Science

English Hindi-A IT Code-402

Hindi-B Artificial Intelligence

Senior Secondary Groups (XI & XII For Teachers Only)

Physics Chemistry English

Mathematics Biology Accountancy

Economics BST History

 Geography Sociology Hindi Elective

Hindi Core Home Science Sanskrit

Psychology Political Science Painting

Vocal Music Comp. Science IP

Physical Education APP. Mathematics Legal Studies

Entrepreneurship French IT

Artificial Intelligence

Other Important Groups (For Teachers & Principal’s)

Principal’s Group Teachers Jobs IIT/NEET

 Join School of Educators WhatsApp Groups

You will get Pre- Board Papers PDF, Word file, PPT, Lesson Plan, Worksheet, practical
tips and Viva questions, reference books, smart content, curriculum, syllabus,
marking scheme, toppers answer scripts, revised exam pattern, revised syllabus,
Blue Print etc. here . Join Your Subject / Class WhatsApp Group.

Kindergarten to Class XII (For Students Only)

Class 1 Class 2 Class 3

Class 4 Class 5 Class 6

Class 7 Class 8 Class 9

Class 10 Class 11 (Science) Class 11 (Humanities)

Class 11 (Commerce) Class 12 (Science) Class 12 (Humanities)

Class 12 (Commerce) Artificial Intelligence

(VI TO VIII)
Subject Wise Secondary and Senior Secondary Groups
(IX & X For Students Only)
Secondary Groups (IX & X)

SST Mathematics Science

English Hindi IT Code

Artificial Intelligence

Senior Secondary Groups (XI & XII For Students Only)

Physics Chemistry English

Mathematics Biology Accountancy

Economics BST History

 Geography Sociology Hindi Elective

Hindi Core Home Science Sanskrit

Psychology Political Science Painting

Music Comp. Science IP

Physical Education APP. Mathematics Legal Studies

Entrepreneurship French IT

AI IIT/NEET CUET
Groups Rules & Regulations:
To maximize the benefits of these WhatsApp groups, follow these guidelines:

1. Share your valuable resources with the group.

2. Help your fellow educators by answering their queries.
3. Watch and engage with shared videos in the group.
4. Distribute WhatsApp group resources among your students.
5. Encourage your colleagues to join these groups.

Additional notes:
1. Avoid posting messages between 9 PM and 7 AM.
2. After sharing resources with students, consider deleting outdated data if necessary.
3. It's a NO Nuisance groups, single nuisance and you will be removed.
No introductions.
No greetings or wish messages.
No personal chats or messages.
No spam. Or voice calls
Share and seek learning resources only.

Please only share and request learning resources. For assistance,

contact the helpline via WhatsApp: +91-95208-77777.
 Join Premium WhatsApp Groups
Ultimate Educational Resources!!

Join our premium groups and just Rs. 1000 and gain access to all our exclusive
materials for the entire academic year. Whether you're a student in Class IX, X, XI, or
XII, or a teacher for these grades, Artham Resources provides the ultimate tools to
enhance learning. Pay now to delve into a world of premium educational content!

Click here for more details

Class 9 Class 10 Class 11

Class 12

📣 Don't Miss Out! Elevate your academic journey with top-notch study materials and secure
your path to top scores! Revolutionize your study routine and reach your academic goals with
our comprehensive resources. Join now and set yourself up for success! 📚🌟

Best Wishes,

Team
School of Educators & Artham Resources
 SKILL MODULES BEING OFFERED IN
MIDDLE SCHOOL

Artificial Intelligence Beauty & Wellness Design Thinking & Financial Literacy
Innovation

Handicrafts Information Technology Marketing/Commercial Mass Media - Being Media

Application Literate

Data Science (Class VIII Augmented Reality /

Travel & Tourism Coding
only) Virtual Reality

Digital Citizenship Life Cycle of Medicine & Things you should know What to do when Doctor
Vaccine about keeping Medicines is not around
at home

Humanity & Covid-19 Blue Pottery Pottery Block Printing

 Food Food Preservation Baking Herbal Heritage

Khadi Mask Making Mass Media Making of a Graphic

Novel

Kashmiri Embroidery Satellites

Rockets
Embroidery

Application of Photography
Satellites
SKILL SUBJECTS AT SECONDARY LEVEL (CLASSES IX – X)

Retail Information Technology Automotive

Security

Introduction To Financial Introduction To Tourism Beauty & Wellness Agriculture

Markets

Food Production Front Office Operations Banking & Insurance Marketing & Sales

Health Care Apparel Multi Media Multi Skill Foundation

Course

Artificial Intelligence
Physical Activity Trainer Electronics & Hardware
Data Science
(NEW)

Foundation Skills For Sciences Design Thinking & Innovation (NEW)

(Pharmaceutical & Biotechnology)(NEW)
 SKILL SUBJECTS AT SR. SEC. LEVEL
(CLASSES XI – XII)

Retail InformationTechnology Web Application Automotive

Financial Markets Management Tourism Beauty & Wellness Agriculture

Food Production Front Office Operations Banking Marketing

Health Care Insurance Horticulture Typography & Comp.

Application

Geospatial Technology Electrical Technology Electronic Technology Multi-Media

 Taxation Cost Accounting Office Procedures & Shorthand (English)
Practices

Shorthand (Hindi) Air-Conditioning & Medical Diagnostics Textile Design

Refrigeration

Salesmanship Business Food Nutrition &

Design
Administration Dietetics

Mass Media Studies Library & Information Fashion Studies Applied Mathematics
Science

Yoga Early Childhood Care & Artificial Intelligence Data Science

Education

Physical Activity Land Transportation Electronics & Design Thinking &

Trainer(new) Associate (NEW) Hardware (NEW) Innovation (NEW)
 Join School of Educators Signal Groups

You will get Pre- Board Papers PDF, Word file, PPT, Lesson Plan, Worksheet, practical
tips and Viva questions, reference books, smart content, curriculum, syllabus,
marking scheme, toppers answer scripts, revised exam pattern, revised syllabus,
Blue Print etc. here . Join Your Subject / Class signal Group.

Kindergarten to Class XII

Class 2 Class 3
Class 1

Class 5 Class 6
Class 4

Class 7 Class 8 Class 9

Class 10 Class 11 (Science) Class 11 (Humanities)

Class 11 (Commerce) Class 12 (Science) Class 12 (Humanities)

Class 12 (Commerce) Kindergarten Artifical intelligence

 Subject Wise Secondary and Senior Secondary
Groups IX & X

Secondary Groups (IX & X)

SST Mathematics Science

Hindi-B
English Hindi-A

IT Artifical intelligence
IT Code-402

Senior Secondary Groups XI & XII

Physics Chemistry English

Biology Accountancy
Mathematics

BST History
Economics
 Geography Sociology Hindi Elective

Hindi Core Home Science Sanskrit

Psychology Political Science Painting

IP
Vocal Music Comp. Science

Physical Education APP. Mathematics Legal Studies

IIT/NEET
Entrepreneurship French

Artifical intelligence CUET

 Join School of Educators CBSE Telegram Groups

Kindergarten

All classes Class 1 Class 2

Class 3 Class 4 Class 5

Class 6 Class 7 Class 8

Class 9 Class 10 Class 11 (Sci)

Class 11 (Com) Class 11 (Hum) Class 12 (Sci)

Class 12 (Com) Class 12 (Hum) JEE/NEET

CUET NDA, OLYMPIAD, NTSE Principal Professional Group

Teachers Professional Group Project File Group

Join School of Educators ICSE Telegram Groups

Kindergarten Class 1 Class 2

Class 3 Class 4 Class 5

Class 6 Class 7 Class 8

Class 9 Class 10 Class 11 (Sci)

Class 11 (Com) Class 11 (Hum) Class 12 (Sci)

Class 12 (Com) Class 12 (Hum)