Connect Harsh sir @

http://vdnt.in/HARSHPRIYAM

https://t.me/harshpriyam

priyam_harsh
JEE 2023
 JEE 2023
JEE Hinglish

Suresh Mahawar (Suri) Arvind Kalia Mohit Ryan

Physics Maths Chemistry

● 11+ Years of teaching experience ● 10+ years of experience ● 11+ years of teaching experience
● Taught hundreds 15000+ students ● Best teacher awardee at National ● Mentored and taught 10000+
offline and online so far Tcon 2018, 2019 students in IIT/ NEET/ JEE
● 100+ IIT selections ● Produced 10000+ IIT/ NIT/
● 600+ IIT selections
● B.Tech, IIT Bombay NEET/AIIMS/ OLYMPIADS selections
● M.Sc., IIT Delhi
 JEE English
JEE 2023

Shimon Joseph Shreyas Hebbare Harsh Maheshwari

Maths Physics Chemistry

● 6+ years Teaching Experience. ● 9+ years JEE & 3+ years of corporate ● 4+ years of teaching experience
● Mentored more than 10,000+ teaching experience ● Taught and mentored 5000+
students. ● Taught & mentored 10,000+ students students for JEE and NEET
● Produced AIR - 38,41 in JEE ● Produced top 100 AIRs in JEE and ● CSIR-UGC NET Qualified in
Advanced. many more Chemistry
● KVPY Scholar, JEE Main State ● Got 100+ of selections in IITs, NITs, ● 300+ JEE and 450+ NEET
Topper. IIITs, BITs selections
● B.tech, IIT Madras ● B.Tech, NIT Nagpur ● M.SC., NIT Warangal
 JEE 2023
Features
PRO LITE Recorded
(at other tuition/ LIVE PRO LIVE ONLINE
(at other tuition/
LIVE OFFLINE
(at other tuition/
(at Vedantu) coaching institutes) (at Vedantu) coaching institutes) coaching institutes)

Scheduled Yes NO Yes NO Yes

Class Recording Yes Yes Yes Maybe NO

In Class Doubt Yes NO Yes NO NO

In Class Feedback Yes NO Yes Maybe NO

In Class Interaction Yes NO Yes Maybe Yes

Class Notes Yes NO Yes Maybe NO

Assignments Yes Maybe Yes Maybe Yes

Fortnightly Tests Yes Maybe Yes Maybe Yes

Revision Yes Maybe Yes Maybe NO

Test Series Yes Maybe Yes Maybe NO
JEE 2023

Vedantu Results
Results 2019 - 2020 2021
3,350 students cleared 1,500+ IIT selections in
Cleared JEE-Mains
JEE-Mains JEE Advanced 2021
52 Students scored 1,100+ Medical Selections
Cleared NEET-UG
under-50k Rank in NEET-UG in NEET-UG 2021
Achieved >90% in 319 students score 171 Students scored above
CBSE Board 10th above 90% in CBSE 10th 90% in CBSE 10th
Achieved >90% in 271 students score 157 Students scored above
CBSE Board 12th above 90% in CBSE 12th 90% in CBSE 12th
JEE 2023
VIP - Process

Course Purchase Learning Progress JEE 2023

Tests 1, 2 and 3

Mandatory Requirement
Attendance - 75%
Assigned Tests - 75%

If Score/Rank in JEE 2023 is less than the Score/Rank in Learning Progress Test - 1,
then we will REFUND the complete Course Fee
 JEE 2023
VIP - Process
Class VIP - Evaluation Target Exam Duration

Learning Progress Tests (Rank Predictor JEE-2023) 1 Academic

12th JEE Main 2023
conducted within 30 days of enrolment Year*

Academic Year(s) is/are defined as per Vedantu Academic Curriculum

What is a Learning Progress Test? How will my child be accurately assessed?
Learning Progress Test (LPT) is a multiple-choice exam designed to assess a student’s learning levels. The
Learning Progress Tests will be conducted at the start, middle and end of the academic journey. These tests are
vetted by Vedantu Master Teachers to accurately capture the student’s current and potential learning levels.
These tests will be served to the student during multiple stages of the academic year thus helping our team of
Master Teachers, Class Teachers and Student Academic Mentors to track progress and plan any special
interventions as and when required.

Is there a minimum eligibility criteria for a student to request a refund under VIP?
Yes, a student to remain covered under VIP must have attended 75% of the scheduled live classes and must have
completed 75% of the assigned tests.
 JEE 2023

VIP Refund Policy

Course Type Duration 2023 end 2024 End 2025 End 2026 End 2027 End
School Prep / Foundation 1 Yr 100%
School Prep / Foundation 2 Yr 50% 50%
School Prep / Foundation 3 Yr 33% 33% 34%
School Prep / Foundation 4 Yr 25% 25% 25% 25.00%
School Prep / Foundation 5 Yr 20% 20% 20% 20% 20%
JEE/NEET 1 Yr 100%
JEE/NEET 2 Yr 100%

Refund Policy - Within 7 days of the JEE-Main 2023 results being declared - If a student, even after meeting
the minimum eligible criteria, doesn't see improvement in his / her actual JEE rank as compared to his/her rank
predicted by the initial Learning Progress Test which was conducted at the start of the course
XXXXX
 JEE 2023

Full- Syllabus Revision with Students will get Vedantu’s

258 Interactive Sessions Tatva Textbook PDFs

Improve Your Conceptual

Access till JEE Mains 2023
Understanding with 258 Assignments

12th Class Syllabus - 2nd May - November 2022

11th & 12th Revision - December 2022 - JEE Mains 2023

Pricing 8,100/-
Relations and
functions One
Shot

By Harsh Sir
Types of Relations
 Empty Relation

A relation R in a set A is called empty

relation, if no element of A is related to any
element of A,
i.e., R = ϕ ⊂ A × A.
 Universal Relation

A Relation R in a set A is called universal

relation, if each element of A is related to
every element of A,
i.e., R = A × A.
QUESTION
Q. Let A be the set of all students of a
boys school. Show that the relation R in
A given by R = {(a, b) : a is sister of b} is
the empty relation and R’ = {(a, b} : the
difference between heights of a and b is
less than 3 meters} is the universal
relation.
Q. Let A be the set of all students of a
boys school. Show that the relation R in
A given by R = {(a, b) : a is sister of b} is
the empty relation and R’ = {(a, b} : the
difference between heights of a and b is
less than 3 meters} is the universal
relation.
Q. Let A be the set of all students of a
boys school. Show that the relation R in
A given by R = {(a, b) : a is sister of b} is
the empty relation and R’ = {(a, b} : the
difference between heights of a and b is
less than 3 meters} is the universal
relation.
SOLUTION
Since the school is boys school, no student of
the school can be sister of any student of the
school. Hence, R = ϕ, showing that R is the
empty relation. It is also obvious that the
difference between heights of any two
students of the school has to be less than 3
meters. This shows that R’ = A × A is the
universal relation.
Equivalence Relation
 Equivalence Relation

● A relation R in a set A is called

(i) Reflexive, if (a, a) ∈ R, for every a ∈ A
(ii) Symmetric, if (a1, a2) ∈ R implies that
(a2, a1) ∈ R, for all a1, a2 ∈ A.
(iii) Transitive, if (a1, a2) ∈ R and (a2, a3) ∈
R implies that (a1, a3) ∈ R, for all a1, a2, a3 ∈
A.
● A relation R in a set A is said to be an
equivalence relation if R is reflexive,
symmetric and transitive.
QUESTION
Q. Show that relation R in the set {1, 2, 3}
given by R = {(1, 1), (2, 2), (3, 3), (1, 2),
(2, 3)} is reflexive but neither symmetric
nor transitive.
Q. Show that relation R in the set {1, 2, 3}
given by R = {(1, 1), (2, 2), (3, 3), (1, 2),
(2, 3)} is reflexive but neither symmetric
nor transitive.
Q. Show that relation R in the set {1, 2, 3}
given by R = {(1, 1), (2, 2), (3, 3), (1, 2),
(2, 3)} is reflexive but neither symmetric
nor transitive.
SOLUTION
R is reflexive, since (1, 1), (2, 2) and (3, 3) lie
in R. Also, R is not symmetric, as (1, 2) ∈ R
but (2, 1) ∉ R.
Similarly, R is not transitive, as (1, 2) ∈ R and
(2, 3) ∈ R but (1, 3) ∉ R.
QUESTION
Q. Determine whether the following
relation is reflexive, symmetric and
transitive:
Relation R in the set Z of all integers
defined as R = {(x, y) : x - y is an integer}
Q. Determine whether the following
relation is reflexive, symmetric and
transitive:
Relation R in the set Z of all integers
defined as R = {(x, y) : x - y is an integer}
Q. Determine whether the following
relation is reflexive, symmetric and
transitive:
Relation R in the set Z of all integers
defined as R = {(x, y) : x - y is an integer}
SOLUTION
R = {(x, y) : x - y is an integer} in set Z of all
integers.
Now, (x, x), say (1, 1) = x - y = 1 - 1 = 0 ∈ Z ⇒
R is reflexive.
(x, y) ∈ R and (y, x) ∈ R,
i.e., x - y and y - x are integers ⇒ R is
symmetric.
(x, y) ∈ R and (y, z) ∈ R, then (x, z) ∈ R
i.e., x - y and y - z and x - z are integers.
(x, z) ∈ R ⇒ R is transitive
Therefore, R is reflexive, symmetric and
transitive.
QUESTION
Q. 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.
Q. 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.
Q. 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.
SOLUTION
R = {(a, b) : a ≤ b2}, Relation R is defined as
the set of real numbers.
(a, a) ∈ R then a ≤ a2, which is false. R is not
reflexive.
(a, b) = (b, a) ∈ R then a ≤ b2 and b ≤ a2, it is
false statement. R is not symmetric.
Now, a ≤ b2 and b ≤ c2, then a ≤ c2, which is
false. R is not transitive
Therefore, R is neither reflexive, nor
symmetric and nor transitive.
QUESTION
Q. Show that the relation R in R defined as
R = {(a, b) : a ≤ b}, is reflexive and
transitive but not symmetric.
Q. Show that the relation R in R defined as
R = {(a, b) : a ≤ b}, is reflexive and
transitive but not symmetric.
Q. Show that the relation R in R defined as
R = {(a, b) : a ≤ b}, is reflexive and
transitive but not symmetric.
SOLUTION
a ≤ a : which is true, (a, a) ∈ R, So R is
reflexive.
a ≤ b but b ≤ a (false): (a, b) ∈ R but (b, a) ∉ R,
So is not symmetric.
Again, a ≤ b and b ≤ c then a ≤ c : (a, b) ∈ R,
and (b, c) and (a, c) ∈ R, So R is transitive.
Therefore, R is reflexive and transitive but
not symmetric.
QUESTION
Q. 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.
Q. 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.
Q. 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.
SOLUTION
Books x and x have same number of pages.
(x, x) ∈ R. R is reflexive.
If (x, y) ∈ R and (y, x) ∈ R, so R is symmetric.
Because, books x and y have same number of
pages and Books y and x have same number
of pages.
Again, (x, y) ∈ R and (y, z) ∈ R and (x, z) ∈
R.
R is transitive.
Therefore, R is an equivalence relation.
QUESTION
Q. Show that the relation R in the set
A = {1, 2, 3, 4, 5} given by
R = {(a, b) : |a - b| is even}, 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}
Q. Show that the relation R in the set
A = {1, 2, 3, 4, 5} given by
R = {(a, b) : |a - b| is even}, 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}
Q. Show that the relation R in the set
A = {1, 2, 3, 4, 5} given by
R = {(a, b) : |a - b| is even}, 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}
SOLUTION
A = {1, 2, 3, 4, 5} and R = {(a, b) : |a - b| is
even}
We get, R = {(1, 3), (1, 5), (3, 5), (2, 4)}
For (a, a), |a - b| = |a - a| = 0 is even.
Therefore, R is reflexive.
If |a - b| is even, then |b - a| is also even, R is
symmetric.
Again, if |a - b| and |b - c| is even then |a - c|
is also even, R is transitive.
Therefore, R is an equivalence relation.
SOLUTION
(b) We have to show that, Elements of
{1, 3, 5} are related to each other.
|1 - 3| = 2
|3 - 5| = 2
|1 - 5| = 4
All are even numbers.
Elements of {1, 3, 5} are related to each other.
Similarly, |2 - 4| = 2 (even number),
elements of (2, 4) are related to each other.
Hence no element of {1, 3, 5} is related to any
element of {2, 4}.
QUESTION
Q. 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?
Q. 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?
Q. 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?
SOLUTION
Case I:
R = {(P1, P2 ) : P1 and P2 have same number of
sides}
Check for reflexive:
P1 and P1 have same number of sides, So R is
reflexive.
Check for symmetric:
P1 and P2 have same number of sides then P2
and P1 have same number of sides, so
(P1, P2) ∈ R and (P2, P1) ∈ R
R is symmetric.
SOLUTION
Check for transitive:
Again, P1 and P2 have same number of sides,
and P2 and P3 have same number of sides,
then also P1 and P3 have same number of
sides.
So (P1, P2) ∈ R and (P2, P3) ∈ R and (P1, P3) ∈
R
R is transitive.
Therefore, R is an equivalent relation.
Since 3, 4, 5 are the sides of a triangle, the
triangle is right angled triangle. Therefore,
the set A is the set of right angled triangle.
QUESTION
Q. 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.

R is reflexive and symmetric

A but not transitive

R is reflexive and transitive but

B not symmetric

R is symmetric and transitive

C but not reflexive

D R is an equivalence relation
Q. 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.
Q. 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.
SOLUTION
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)}.
Step 1: (1, 1), (2, 2), (3, 3), (4, 4) ∈ R.
R is reflexive.
Step 2: (1, 2) ∈ R but (2, 1) ∉ R.
R is not symmetric.
Step 3: Consider any set of points.
(1, 3) ∈ R and (3, 2) ∈ R then (1, 2) ∈ R.
So R is transitive.
Q. 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.

R is reflexive and symmetric

A but not transitive

R is reflexive and transitive but

B not symmetric

R is symmetric and transitive

C but not reflexive

D R is an equivalence relation
QUESTION
Q. 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.
Q. 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.
Q. 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.
QUESTION
Q. 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
Q. Let A = {1, 2, 3}. Then number of
relations containing (1, 2) and (1, 3)
which are reflexive and symmetric but
not transitive is
Q. Let A = {1, 2, 3}. Then number of
relations containing (1, 2) and (1, 3)
which are reflexive and symmetric but
not transitive is
SOLUTION

A = {1, 2, 3}
Relation containing (1, 2) and (1, 3)
For symmetricity, (1, 2), (2, 1), (1, 3) and
(3, 1) must be included.
For reflexivity, (1, 1), (2, 2), (3, 3) must be
included.
⇒ Only one set is there R = {(1, 1), (1, 2),
(1, 3), (2, 2), (2, 1), (3, 3), (3, 1)}
⇒ Answer is 1.
QUESTION
Q. 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
QUESTION
Q. 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
Q. If a relation R on the set {1, 2, 3} be
defined by R = {(1, 2)}, then R is
Q. If a relation R on the set {1, 2, 3} be
defined by R = {(1, 2)}, then R is
SOLUTION

R on the set {1, 2, 3} be defined by

R = {(1, 2)}
Hence, it’s clear that R is not reflexive,
transitive and symmetric.
QUESTION
Q. 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
QUESTION
Q. 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 equivalence relation.
Q. 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 equivalence relation.
Q. 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 equivalence 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.
SOLUTION
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.
QUESTION
Q. 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)|.
Q. 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)|.
Q. 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.
SOLUTION
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.
Therefore, R is an equivalence relation.
And the equivalent class [(2, 5) = (1, 4),
(2, 5), (3, 6), (4, 7), (5, 8), (6, 9)] under
relation R.
Types of Function
 Injective (one-one) function

A function f : X ➝ Y is defined to be
one-one (or injective), if the images of
distinct elements of X under f are distinct,
i.e., for every, x1, x2 ∈ X, f(x1) = f(x2)
implies x1 = x2. Otherwise, f is called
many-one.
 Surjective (onto) function

A function f : X ➝ Y is said to be onto (or

surjective), if every element of Y is the
image of some element of X under f,
i.e., for every y ∈ Y, there exists an element
x in X such that f(x) = y.
 Remark

f : X ➝ Y is onto if and only if Range of f = Y.

 Bijective function

A function f : X ➝ Y is said to be one-one

and onto (or bijective), if f is both one-one
and onto.
QUESTION
Q. Show that the function f: N ➝ N, given
by f(x) = 2x, is one-one but not onto.
Q. Show that the function f: N ➝ N, given
by f(x) = 2x, is one-one but not onto.
Q. Show that the function f: N ➝ N, given
by f(x) = 2x, is one-one but not onto.
SOLUTION
The function f is one-one, for f(x1) = f(x2)
⇒ 2x1 = 2x2
⇒ x1 = x2.
Further, f is not onto, as for 1 ∈ N, there
does not exist any x in N such that
f(x) = 2x = 1.
QUESTION
Q. Show that the function f: N ➝ N, given
by f(1) = f(2) = 1 and f(x) = x - 1, for every
x > 2, is onto but not one-one.
Q. Show that the function f: N ➝ N, given
by f(1) = f(2) = 1 and f(x) = x - 1, for every
x > 2, is onto but not one-one.
Q. Show that the function f: N ➝ N, given
by f(1) = f(2) = 1 and f(x) = x - 1, for every
x > 2, is onto but not one-one.
SOLUTION
f is not one-one, as f(1) = f(2) = 1. But f is
onto, as given any y ∈ N, y ≠ 1, we can
choose x as y + 1 such that
f(y + 1) = y + 1 - 1 = y. Also for 1 ∈ N, we
have f(1) = 1.
QUESTION
Q. 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.
Q. 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.
Q. 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 = IA
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.
QUESTION
Q. Check the injectivity of f: Z ➝ Z
given by f(x) = x3
Q. Check the injectivity of f: Z ➝ Z
given by f(x) = x3
Q. Check the injectivity of f: Z ➝ Z
given by f(x) = x3
SOLUTION
For x, y ∈ Z ⇒ f(x) = f(y) which implies
x3 = y3 ⇒ x = y
Therefore f is injective.
There are many numbers of co-domain
which have no image in domain Z.
For example, 4 ∈ co-domain N, but there
does not exist any x in domain Z where
x3 = 4. f is not surjective.
Therefore, f is injective but not surjective.
QUESTION
Q. Show that the Modulus Function
f: R ➝ R, given by f(x) = |x|, is neither
one-one nor onto, where |x| is x, if x is
positive or 0 and |x| is - x, if x is
negative.
Q. Show that the Modulus Function
f: R ➝ R, given by f(x) = |x|, is neither
one-one nor onto, where |x| is x, if x is
positive or 0 and |x| is - x, if x is
negative.
Q. Show that the Modulus Function
f: R ➝ R, given by f(x) = |x|, is neither
one-one nor onto, where |x| is x, if x is
positive or 0 and |x| is - x, if x is
negative.
SOLUTION
f : R ➝ R, given by f(x) = |x|, defined as

f contains values like (-1, 1), (1, 1), (-2, 2)

(2, 2)
f(-1) = f(1), but (-1,1) is not one-one.
R contains some negative numbers which
are not images of any real number
since f(x) = |x| is always non-negative.
So f is not onto.
Hence, Modules function is neither
one-one nor onto.
QUESTION
Q. 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.
Q. 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.
Q. 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.
SOLUTION
A = {1, 2, 3}
B = {4, 5, 6, 7} and
f = {(1, 4), (2, 5), (3, 6)}
f(1) = 4, f(2) = 5 and f(3) = 6
Here, also distinct elements of A have
distinct images in B
Therefore, f is one-one.
QUESTION
Q. Let A and B be sets. Show that
f: A × B ➝ B × A such that f(a, b) = (b, a) is
bijective function.
Q. Let A and B be sets. Show that
f: A × B ➝ B × A such that f(a, b) = (b, a) is
bijective function.
Q. Let A and B be sets. Show that
f: A × B ➝ B × A such that f(a, b) = (b, a) is
bijective function.
 SOLUTION
Step 1: Check for Injective:
Let (a1, b1) and (a2, b2) ∈ A × B such that
f(a1, b1) = (a2, b2)
This implies, (b1, a1) and (b2, a2)
b1 = b2 and a1 = a2
(a1, b1) = (a2, b2) for all (a1, b1) and
(a2, b2) ∈ A × B
Therefore, f is injective.
 SOLUTION
Step 2: Check for Surjectivity:
Let (b, a) be any element of B × A. Then
a ∈ A and b ∈ B
This implies (a, b) ∈ A × B
For all (b, a) ∈ B × A, their exists
(a, b) ∈ A × B
Therefore, f: A × B ➝ B × A is bijective
function.
QUESTION Q. Let f: R ➝ R be defined as f(x) = x4..
Check weather it is onto or one-one or
both
Q. Let f: R ➝ R be defined as f(x) = x4..
Check weather it is onto or one-one or
both
Q. Let f: R ➝ R be defined as f(x) = x4..
Check weather it is onto or one-one or
both
 SOLUTION
f: R ➝ R be defined as f(x) = x4
Let x and y belongs to R such that,
f(x) = f(y)
x4 =y4 or x = ±y
f is not one-one function.

Therefore, f is not onto function.

QUESTION
Q. Let A = R - {3}, B = R - {1}. Let f: A ➝ B
be defined by
Then show that f is bijective.
Q. Let A = R - {3}, B = R - {1}. Let f: A ➝ B
be defined by
Then show that f is bijective.
Q. Let A = R - {3}, B = R - {1}. Let f: A ➝ B
be defined by
Then show that f is bijective.
SOLUTION
SOLUTION
Composition of Functions
 Composition of Functions

Let f: A ➝ B and g: B ➝ C be two functions.

Then the composition of f and g, denoted
by gof, is defined as the function gof: A ➝ C
given by
gof(x) = g(f(x)), ∀ x ∈ A.
QUESTION
Q.
Q.
Q.
SOLUTION
QUESTION
Q. Let f : {1, 2, 3} ➝ {a, b, c} be one-one
and onto function given by f(1) = a,
f(2) = b and f(3) = c. Show that there
exists a function g : {a, b, c} ➝ {1, 2, 3}
such that gof = IX and fog = IY, where,
X = {1, 2, 3} and Y = {a, b, c}.
Q. Let f : {1, 2, 3} ➝ {a, b, c} be one-one
and onto function given by f(1) = a,
f(2) = b and f(3) = c. Show that there
exists a function g : {a, b, c} ➝ {1, 2, 3}
such that gof = IX and fog = IY, where,
X = {1, 2, 3} and Y = {a, b, c}.
Q. Let f : {1, 2, 3} ➝ {a, b, c} be one-one
and onto function given by f(1) = a,
f(2) = b and f(3) = c. Show that there
exists a function g : {a, b, c} ➝ {1, 2, 3}
such that gof = IX and fog = IY, where,
X = {1, 2, 3} and Y = {a, b, c}.
SOLUTION
Consider g : {a, b, c} ➝ {1, 2, 3} as g(a) = 1,
g(b) = 2 and g(c) = 3. It is easy to verify that
the composite gof = IX is the identity
function on X and the composite fog = IY is
the identity function on Y.
QUESTION
Q. Let f : {1, 3, 4} ➝ {1, 2, 5} and
g : {1, 2, 5} ➝ {1, 3} be given by f = {(1, 2),
(3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}.
Write down gof.
Q. Let f : {1, 3, 4} ➝ {1, 2, 5} and
g : {1, 2, 5} ➝ {1, 3} be given by f = {(1, 2),
(3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}.
Write down gof.
Q. Let f : {1, 3, 4} ➝ {1, 2, 5} and
g : {1, 2, 5} ➝ {1, 3} be given by f = {(1, 2),
(3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}.
Write down gof.
SOLUTION
Given function,
f : {1, 3, 4} ➝ {1, 2, 5} and
g : {1, 2, 5} ➝ {1, 3} be given by
f = {(1, 2), (3, 5), (4, 1)} and
g = {(1, 3), (2, 3), (5, 1)}
Find gof
At f(1) = 2 and g(2) = 3, gof is
gof(1) = g(f(1)) = g(2) = 3
At f(3) = 5 and g(5) = 1, gof is
gof(3) = g(f(3)) = g(5) = 1
At f(4) = 1 and g(1) = 3, gof is
gof(4) = g(f(4)) = g(1) = 3
Therefore, gof = {(1, 3), (3, 1), (4, 3)}
QUESTION
Q. Find gof and fog, if f(x) = |x| and
g(x) = |5x - 2|
Q. Find gof and fog, if f(x) = |x| and
g(x) = |5x - 2|
Q. Find gof and fog, if f(x) = |x| and
g(x) = |5x - 2|
SOLUTION
f(x) = |x| and g(x) = |5x - 2|
gof = (gof)(x) = g(f(x)) = g(|x|) = |5|x| - 2|
fog = (fog)(x) = f(g(x)) = f(|5x - 2|)
= ||5x - 2|| = |5x - 2|
 Inverse of a function

A function f : X ➝ Y is defined to be
invertible, if there exists a function
g : Y ➝ X such that gof = IX and fog = IY.
The function g is called the inverse of f and
is denoted by f-1.
QUESTION
Q. Let f : N ➝ Y be a function defined as
f(x) = 4x + 3, where, Y = {y ∈ N : y = 4x +
3 for some x ∈ N}. Show that f is
invertible. Find the inverse.
Q. Let f : N ➝ Y be a function defined as
f(x) = 4x + 3, where, Y = {y ∈ N : y = 4x +
3 for some x ∈ N}. Show that f is
invertible. Find the inverse.
Q. Let f : N ➝ Y be a function defined as
f(x) = 4x + 3, where, Y = {y ∈ N : y = 4x +
3 for some x ∈ N}. Show that f is
invertible. Find the inverse.
SOLUTION
QUESTION
Q. Consider f : N ➝ N, g : N ➝ N and
h : N ➝ R defined as f(x) = 2x,
g(y) = 3y + 4 and h(z) = sin z, ∀ x, y and z
in N. Show that ho(gof) = (hog) of.
Q. Consider f : N ➝ N, g : N ➝ N and
h : N ➝ R defined as f(x) = 2x,
g(y) = 3y + 4 and h(z) = sin z, ∀ x, y and z
in N. Show that ho(gof) = (hog) of.
Q. Consider f : N ➝ N, g : N ➝ N and
h : N ➝ R defined as f(x) = 2x,
g(y) = 3y + 4 and h(z) = sin z, ∀ x, y and z
in N. Show that ho(gof) = (hog) of.
SOLUTION
We have
ho(gof)(x) = h(gof(x)) = h(g(f(x)))
= h(g(2x)) = h(3(2x) + 4)
= h(6x + 4) = sin (6x + 4) ∀ x ∈ N,
Also, ((hog)of)(x) = (hog) (f(x))
= (hog)(2x) = h(g(2x))
= h(3(2x) + 4) = h(6x + 4)
= sin(6x + 4), ∀ x ∈ N.
This shows that ho(gof) = (hog) of.
QUESTION
Q. Show that f : [-1, 1] ➝ R, given by
is one-one. Find the
inverse of the function f : [-1, 1] ➝ Range
f.
Q. Show that f : [-1, 1] ➝ R, given by
is one-one. Find the
inverse of the function f : [-1, 1] ➝ Range
f.
Q. Show that f : [-1, 1] ➝ R, given by
is one-one. Find the
inverse of the function f : [-1, 1] ➝ Range
f.
SOLUTION
QUESTION
Q. Let f : R ➝ R be defined as
f(x) = 10x + 7. Find the function g : R ➝ R
such that g o f = f o g = IR.
Q. Let f : R ➝ R be defined as
f(x) = 10x + 7. Find the function g : R ➝ R
such that g o f = f o g = IR.
Q. Let f : R ➝ R be defined as
f(x) = 10x + 7. Find the function g : R ➝ R
such that g o f = f o g = IR.
SOLUTION
QUESTION
Q. Give examples of two functions
f : N ➝ Z and g : Z ➝ Z such that g o f is
injective but g is not injective.
Q. Give examples of two functions
f : N ➝ Z and g : Z ➝ Z such that g o f is
injective but g is not injective.
Q. Give examples of two functions
f : N ➝ Z and g : Z ➝ Z such that g o f is
injective but g is not injective.
SOLUTION
Given: two functions are
f : N ➝ Z and g : Z ➝ Z
Let us say, f(x) = x and g(x) = x
gof = (gof)(x) = f(f(x)) = g(x)
Here gof is injective but g is not.
Let us take a example to show that g is not
injective: since g(x) = |x|
g(1) = |-1| = 1 and g(1) = |1| = 1
But -1 ≠ 1
8th Jan 2020-(Shift 1)
Connect Harsh sir @

http://vdnt.in/HARSHPRIYAM

https://t.me/harshpriyam

priyam_harsh
JEE 2023
 JEE 2023
JEE Hinglish

Suresh Mahawar (Suri) Arvind Kalia Mohit Ryan

Physics Maths Chemistry

● 11+ Years of teaching experience ● 10+ years of experience ● 11+ years of teaching experience
● Taught hundreds 15000+ students ● Best teacher awardee at National ● Mentored and taught 10000+
offline and online so far Tcon 2018, 2019 students in IIT/ NEET/ JEE
● 100+ IIT selections ● Produced 10000+ IIT/ NIT/
● 600+ IIT selections
● B.Tech, IIT Bombay NEET/AIIMS/ OLYMPIADS selections
● M.Sc., IIT Delhi
 JEE English
JEE 2023

Shimon Joseph Shreyas Hebbare Harsh Maheshwari

Maths Physics Chemistry

● 6+ years Teaching Experience. ● 9+ years JEE & 3+ years of corporate ● 4+ years of teaching experience
● Mentored more than 10,000+ teaching experience ● Taught and mentored 5000+
students. ● Taught & mentored 10,000+ students students for JEE and NEET
● Produced AIR - 38,41 in JEE ● Produced top 100 AIRs in JEE and ● CSIR-UGC NET Qualified in
Advanced. many more Chemistry
● KVPY Scholar, JEE Main State ● Got 100+ of selections in IITs, NITs, ● 300+ JEE and 450+ NEET
Topper. IIITs, BITs selections
● B.tech, IIT Madras ● B.Tech, NIT Nagpur ● M.SC., NIT Warangal
 JEE 2023
Features
PRO LITE Recorded
(at other tuition/ LIVE PRO LIVE ONLINE
(at other tuition/
LIVE OFFLINE
(at other tuition/
(at Vedantu) coaching institutes) (at Vedantu) coaching institutes) coaching institutes)

Scheduled Yes NO Yes NO Yes

Class Recording Yes Yes Yes Maybe NO

In Class Doubt Yes NO Yes NO NO

In Class Feedback Yes NO Yes Maybe NO

In Class Interaction Yes NO Yes Maybe Yes

Class Notes Yes NO Yes Maybe NO

Assignments Yes Maybe Yes Maybe Yes

Fortnightly Tests Yes Maybe Yes Maybe Yes

Revision Yes Maybe Yes Maybe NO

Test Series Yes Maybe Yes Maybe NO
JEE 2023

Vedantu Results
Results 2019 - 2020 2021
3,350 students cleared 1,500+ IIT selections in
Cleared JEE-Mains
JEE-Mains JEE Advanced 2021
52 Students scored 1,100+ Medical Selections
Cleared NEET-UG
under-50k Rank in NEET-UG in NEET-UG 2021
Achieved >90% in 319 students score 171 Students scored above
CBSE Board 10th above 90% in CBSE 10th 90% in CBSE 10th
Achieved >90% in 271 students score 157 Students scored above
CBSE Board 12th above 90% in CBSE 12th 90% in CBSE 12th
JEE 2023
VIP - Process

Course Purchase Learning Progress JEE 2023

Tests 1, 2 and 3

Mandatory Requirement
Attendance - 75%
Assigned Tests - 75%

If Score/Rank in JEE 2023 is less than the Score/Rank in Learning Progress Test - 1,
then we will REFUND the complete Course Fee
 JEE 2023
VIP - Process
Class VIP - Evaluation Target Exam Duration

Learning Progress Tests (Rank Predictor JEE-2023) 1 Academic

12th JEE Main 2023
conducted within 30 days of enrolment Year*

Academic Year(s) is/are defined as per Vedantu Academic Curriculum

What is a Learning Progress Test? How will my child be accurately assessed?
Learning Progress Test (LPT) is a multiple-choice exam designed to assess a student’s learning levels. The
Learning Progress Tests will be conducted at the start, middle and end of the academic journey. These tests are
vetted by Vedantu Master Teachers to accurately capture the student’s current and potential learning levels.
These tests will be served to the student during multiple stages of the academic year thus helping our team of
Master Teachers, Class Teachers and Student Academic Mentors to track progress and plan any special
interventions as and when required.

Is there a minimum eligibility criteria for a student to request a refund under VIP?
Yes, a student to remain covered under VIP must have attended 75% of the scheduled live classes and must have
completed 75% of the assigned tests.
 JEE 2023

VIP Refund Policy

Course Type Duration 2023 end 2024 End 2025 End 2026 End 2027 End
School Prep / Foundation 1 Yr 100%
School Prep / Foundation 2 Yr 50% 50%
School Prep / Foundation 3 Yr 33% 33% 34%
School Prep / Foundation 4 Yr 25% 25% 25% 25.00%
School Prep / Foundation 5 Yr 20% 20% 20% 20% 20%
JEE/NEET 1 Yr 100%
JEE/NEET 2 Yr 100%

Refund Policy - Within 7 days of the JEE-Main 2023 results being declared - If a student, even after meeting
the minimum eligible criteria, doesn't see improvement in his / her actual JEE rank as compared to his/her rank
predicted by the initial Learning Progress Test which was conducted at the start of the course
XXXXX
 JEE 2023

Full- Syllabus Revision with Students will get Vedantu’s

258 Interactive Sessions Tatva Textbook PDFs

Improve Your Conceptual

Access till JEE Mains 2023
Understanding with 258 Assignments

12th Class Syllabus - 2nd May - November 2022

11th & 12th Revision - December 2022 - JEE Mains 2023

Pricing 8,100/-
 My name is _______________.
I amMy name is _______________.
in _____(11th/12th) grade and I want join
I am in 10th grade and I want join the
the family of ___________ (JEE/NEET).
And family of _________.
I am texting (JEE/NEET)
after watching session of Harsh
And
Priyam I am texting after watching
sir.
Abhishek sir's session.

WhatsApp your Queries

@ 89511 83703
8th Jan 2020-(Shift 1)