MATHEMATICS FORMULAS CLASS XII

BASED ON BOOK - 1

Relations and Functions

(1) Relation: Let A and B be two sets. Then a relation R from set A to set B is a subset of A  B .
(2) Types of Relations:
2a. Empty Relation: A relation R on a set A is said to an empty relation iff R =  i.e.

( a, b )  R a, b  A i.e. no element of A will be related to any other element of A with the help of

the relation R.
2b. Universal Relation: A relation R on a set A is said to be a universal relation iff

om
R = A  A i.e. ( a, b )  R, a,b  A i.e. each element of A is related to every other element of A with

.c
the help of the relation R.

hs
(3) A relation R on A is:

3a. Reflexive Relation if

( a , a ) R for all a  A at
m
( a , b ) R  ( b , a )  R all a , b  A
aj

3b. Symmetric Relation if

aj

3c. Transitive Relation if

( a , b ) R , ( b , c )  R  ( a , c )  R all a , b , c  A
itb

(4) A relation R in a set A is said to be an Equivalence Relation if R is reflexive, symmetric and

m

transitive.
.a

(5) Equivalence Class

w

Let R be an equivalence relation on a set A and let a  A . Then, we define the equivalence class of
w

a as  a  = b A, b is related to a = b A :( b, a )  R

w

(6) Number of reflexive relations defined on a set of n elements = 2n( n−1)

n( n+1)
2
Number of symmetric relations defined on a set of n elements = 2

n( n−1)
2
Number of reflexive and symmetric relations defined on a set of n elements = 2

Number of transitive relations defined on a set having 0,1,2,3 and 4 elements are 1,2,13,171

and, 3394 respectively.

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 1

Number of equivalence relations (is the Bell Number Bn ) defined on a set having 0,1, 2 and 3

elements are 1,2, 5 and 15 respectively.

(7) Function: Let A and B be two non-empty sets. Then a function ‘ f ’ from set A to set B is a
rule which associates elements of set A to elements of set B such that:
(a) All elements of set A are associated to elements in set .
(b) An element of set A is associated to a unique element in set B .
(8) Vertical Line Test: A curve in a plane represents the graph of a real function if and only if no
vertical line intersects it more than once.
(9) Types of functions:
9a. One-One Function (or Injective Function): A function y = f ( x ) is said to be one –

om
one iff different pre-images have different images or if images are same then the

.c
pre-images are also same.
i.e. f ( x1 ) = f ( x2 )  x1 = x2 or x1  x2  f ( x1 )  f ( x2 )

hs
at
9b. Many-One Function: A function in which at least two pre-images have same image is
m
called as many-one function.
aj
aj

9c. Into Function: A Function is said to be an ‘into’ function if there is at least one element
itb

in the co-domain of the function such that it has no pre-image in domain.

m

9d. Onto Function (or Surjective Function): A function is said to be onto function if each
.a

element of co-domain has a pre-image in its domain. Alternately, A function ‘f’ will be called an
onto function iff R f = co-domain ( f )
w
w

9e. Bijective Function: A function which is one – one and onto both is called as bijective
w

function.
(10) Horizontal Line Test: f is one-one function if no line parallel to x-axis meets the graph in
more than one point.
(11) Let A be any finite set having n elements. Then,

11a. Number of one-one functions from A to A are n !

11b. Number of onto functions from A to A are n !

11c. Number of bijective functions from A to A are n !

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 2

(12) If A and B are finite sets containing m and n elements, then

12a. Total number of relations from the set A to set B is 2mn .

2
12b. Total number of relations on the set A is 2 m .

12c. Total number of functions from the set A to set B is n m .

12d. Total number of one-one functions from the set A to set B is n Pm if n  m , otherwise 0.

n
12e. Total number of onto functions from set A to set B is  (−1)
r =1
n−r n
Cr r m if m  n ,

otherwise 0.

om
Here, if n ( A) = m and n ( B ) = 2 , then the total number of onto functions from set A to

.c
set B is 2m − 2 .

hs
And, if n ( A) = m and n ( B ) = 3 , then the total number of onto functions from set A to
at
m
set B is 3m − 3.2m + 3 .
aj

12f. Total number of bijective functions from the set A to set B is m! , if m = n , otherwise 0.
aj
itb

(13) Identity Function: A function ‘I’ on a set A is said to be an identity function iff I : A → A ,
m

I ( x) = x .
.a

(14) Equal Functions: A function f will be equal to another function g iff

w

(i) D f = Dg and (ii) f ( x ) = g ( x )  x  D f ( or Dg )

w
w

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 3

 Inverse Trigonometry
(1) Inverse Function Domain Range
  
sin −1  −1 , 1  − 2 , 2 
cos −1  −1 , 1 0 ,  
  
tan −1 R − , 
 2 2
  
cos ec −1 R − ( −1 , 1)  − 2 , 2  − 0

sec −1 R − ( −1 , 1) 0 ,   −  
2
cot −1 R (0 ,  )

om
(2) sin −1 ( − x ) = − sin −1 ( x ) for all x   −1 , 1
(3) cos −1 ( − x ) =  − cos −1 ( x ) for all x   −1 , 1

.c
( − x ) = − tan ( x )
−1 −1
for all x  R

hs
(4) tan
(5) cos ec −1 ( − x ) = − cos ec −1 ( x ) for all x 1 at
(6) sec −1 ( − x ) =  − sec −1 ( x ) for all x 1
m
(7) cot −1 ( − x ) =  − cot −1 ( x ) for all x  R
aj
aj

1
(8)sin −1   = cos ec −1 ( x ) ; for all x 1
itb

 x
1
(9) cos −1   = sec−1 ( x )
m

; for all x 1
x
.a

−1  1 
 cot −1 ( x ) , for x  0
(10) tan   = 
w

 x  − + cot ( x )
−1
, for x  0
w


w

(11)sin −1 x + cos −1 x = ;for all x   −1 , 1

2

(12) tan −1 x + cot −1 x = ;for all x  R
2

(13)sec−1 x + cosec−1 x = ;for all x 1
2

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 4

 (
(14) 2sin −1 x = sin −1 2 x 1 − x 2 ) ; if −
1
2
x
1
2
( )
(15) 2 cos −1 x = cos −1 2 x 2 − 1 ; if 0  x  1

 −1  x + y 
 tan   , if xy  1
  1 − xy 
 x+ y

(16) tan x + tan y =   + tan −1 
−1 −1
 , if x  0, y  0 and xy  1
  1 − xy 
  
− + tan −1  x + y  , if x  0, y  0 and xy  1
  1 − xy 

 −1  x − y 
 tan   , if xy  −1
  1 + xy 

om
 x− y

(17) tan x − tan y =   + tan −1 
−1 −1
 , if x  0, y  0 and xy  − 1
  1 + xy 

.c
  
− + tan −1  x − y 

hs
, if x  0, y  0 and xy  − 1
  1 + xy 

 −1  2 x 
at
m
 sin  2 
, − 1 x  1
 1 + x 
aj


−1  −1  1 − x 2 
aj

(18) 2 tan x = cos  2 

, 0  x 
 1+ x 
itb

  
 tan −1  2 x 2  , − 1 x 1
m

 1 − x 
.a

(19) Some useful substitutions

w

Expression Substitution
w

a 2 + x2 x = a tan  or a cot 
w

1 + x2 x = tan  or cot 
a2 − x2 x = a sin  or a cos 
1− x 2
x = sin  or cos 
x −a
2 2
x = a sec  or a cosec 
x −1
2
x = sec  or cosec 
a−x a+x 
; 
a+x a−x 
 x = a cos 2
a−x a+x 
;
a+x a−x 

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 5

 Ch 3 Matrices
(1) A matrix in which number of rows is equal to number of columns, say n is known as square
matrix of order n .
(2) Properties of Transpose of a Matrix:

( ) (ii ) ( A + B ) = AT + BT
T T
(i) AT =A

(iii ) ( kA) = kAT (iv) ( AB ) = BT AT

T T

(v) ( ABC ) = C T BT AT
T

(3) A square matrix A =  aij  is called a symmetric matrix, if aij = a ji for all i , j  AT = A .

(4) A square matrix A = aij  is called a skew-symmetric matrix, if

aij = − a ji for all i , j  AT = − A

om
(5) All main diagonal elements of a skew-symmetric matrix are zero.

.c
(6) Every square matrix can be uniquely expressed as the sum of symmetric and skew-symmetric

hs
matrix.
at
m
Ch-4 Determinants
aj

(1) A square matrix A is a singular matrix if A = 0

aj
itb

(2) For any square matrix A, the |A| satisfy following properties.
2a. |AB| = |A| B|
m

2b. If we interchange any two rows (or columns), then sign of determinant changes.
.a

2c. If any two rows or any two columns are identical or proportional, then value of determinant
w

is zero.
w
w

2d. If we multiply each element of a row or a column of a determinant by constant k, then value
of determinant is multiplied by k.
2e. Multiplying a determinant by k means multiply elements of only one row (or one column)
by k.

(3) Let A =  aij  be a square matrix. The Minor M ij of an element aij of A is the determinant of the

matrix obtained by deleting i th row and j th column of A . Minor of an element of a square matrix of

order n ( n  2 ) is a determinant of order ( n − 1) .

(4) The Cofactor Aij of an element aij of a square matrix A =  aij  is defined as Aij = ( −1)
i+ j
M ij .

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 6

(5) A =Sum of product of elements (of any row or column) with their corresponding cofactors.

(6) If elements of a row (or column) are multiplied with cofactors of any other row (or column),

then their sum is zero.

 a11 a12 a13 

a A +a A +a A = A
For Example, If A =  a21 a22 a23  , then 11 11 12 12 13 13
and, a11 A21 + a12 A22 + a13 A23 = 0
 a31 a32 a33 

(7) Adjoint of a matrix A is the transpose of a cofactor matrix.

(8) If A and B are square matrices of the same order n , then:

(a) A ( adj A) = A I n = ( adj A ) A (b) adj ( AB ) = ( adj B )( adj A)

om
(c) adj ( A) = ( adj A)
n −1
(d) adj A = A
T T

.c
( n −1)2
(e) adj ( adj A) = A n−2
A (f) adj ( adj A ) = A

hs
1
(h) ( adjA) = adjA−1 =
−1
(g) adj ( kA) = k n −1 ( adjA) , k  R at .A
A
m
(9) A square matrix A of order n is invertible if there exists a square matrix B of the same order
aj

such that AB = I n = BA . We write, A−1 = B .

aj
itb

(10) Properties of inverse of a matrix:

(a) Every invertible matrix possesses a unique inverse.
m

( b ) ( A−1 )
−1 1
(c) ( AB ) = B−1 A−1
−1
.a

=A (d) A−1 =
A
w

( e ) ( AT ) ( )
w

−1 1 1
adj ( A) ( k . A)
T −1
= A−1 (f) A−1 = (g) = . A−1 ; k  0
w

A k

(11) Let A ( x1 , y1 ) , B ( x2 , y2 ) and C ( x3 , y3 ) be any three points in XY-plane. Then, area of triangle

x1 y1 1
1
ABC is given by  = x2 y2 1 .
2
x3 y3 1

(12) A system AX = B of n linear equations has a unique solution given by X = A−1 B , if A  0 .

(13) If A = 0 and ( adjA) B = 0 , then the system is consistent and has infinitely many solutions.

But if A = 0 and ( adjA) B  0 , then the system is inconsistent.

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 7

 Ch – 5 Continuity and Differentiability
(1) Limits
xn − an tan x
lim = na n −1 ; lim
sin x
=1 ; lim =1
x→ a x−a x→ 0 x
x→ 0 x

ex − 1 ax − 1 log (1 + x )
lim =1 ; lim = log e a ; lim =1
x→ 0 x x→ 0 x x→ 0 x
(2) A function f ( x) is continuous at x = a if lim f ( x) = f (a) i.e. lim− f ( x) = lim+ f ( x) = f (a) . (3)
x →a x →a x →a

Following functions are continuous everywhere:

(a) Constant function (b) Identity function (c) Polynomial function
(d) Modulus function (e) Exponential function (f) Sine & Cosine functions

om
(4) Following functions are continuous in their domains:
(a) Logarithmic function (b) Rational function

.c
(c) Tan, Cot, Sec & Cosec functions (d) all inverse trigonometric functions

hs
1
(5) If f is continuous function then f and are continuous in their domains.
f at
f ( x) − f (a)
m
(6) A function f ( x) is differentiable at x = a if lim exists finitely i.e.
x→a x−a
aj
aj

f ( a + h) − f ( a ) f ( a − h) − f ( a )
lim = lim .
−h
itb

h →0 h h →0
m

(7) Every differentiable function is continuous but, converse is not true.

.a

(8) Following functions are differentiable everywhere/their defined domain:

w

(a) Polynomial function (b) exponential function (c) constant function

w

(d) Logarithmic function (e) trigonometric & inverse trigonometric functions

w

(9) The sum, difference, product, quotient and composition of two differentiable functions is
differentiable.
(10) Some Standard Derivatives:

(i )
dx
( )
d n
x = n x n −1 (ii )
d
dx
( loge x ) =
1
x
(iii )
d x
dx
( )
e = ex

(iv)
dx
( )
d x
a = a x log e a (v )
d
dx
( sin x ) = cos x (vii)
d
dx
( cos x ) = − sin x
d d d
(viii ) ( tan x ) = sec2 x (ix) ( cot x ) = − cos ec 2 x ( x) (sec x ) = sec x tan x
dx dx dx
d
( xi) ( cos ecx ) = − cos ecx cot x
dx

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 8

( xii )
d
dx
( )
sin −1 x =
1
1 − x2
( xiii )
d
dx
( )
cos −1 x = −
1
1 − x2
( xiv)
d
dx
( )
tan −1 x =
1
1 + x2

( xv)
d
dx
( )
cot −1 x = −
1
1 + x2
( xvi )
d
dx
( )
sec −1 x =
x
1
x2 − 1
( xvii )
d
dx
( )
cosec −1 x = −
x
1
x2 − 1

(11) Chain rule:

dz dz dy
If z = f ( y ) and y = g ( x ) , then = .
dx dy dx

(12) Product Rule

dy du dv
y = uv then = v+u
dx dx dx

(13) Quotient Rule

om
du dv
u dy dx
v−u

.c
If y = then = dx
v dx v2

hs
(14) For a function in the parametric form, say y = f ( t ) , x = g ( t ) we have:

 dy 
at
m
dy  dt  d 2 y d  dy 
= and 2 =  
aj

dx  dx  dx dt  dx 
 
aj

 dt 
itb

Ch 6 Applications of Derivatives
m

Increasing and Decreasing Function

.a

(1) A function f is said to be:

w

1a. Increasing on ( a , b ) if x1  x2 in ( a , b )  f ( x1 )  f ( x2 ) for all x1 , x2  ( a , b ) .

w

Alternatively, f ' ( x )  0 for each x in ( a , b )

w

1b. Decreasing on ( a , b ) if x1  x2 in ( a , b )  f ( x1 )  f ( x2 ) for all x1 , x2  ( a , b ) .

Alternatively, f ' ( x )  0 for each x in ( a , b )

1c. Strictly increasing on ( a , b ) if x1  x2 in ( a , b )  f ( x1 )  f ( x2 ) for all x1 , x2  ( a , b )

. Alternatively, f ' ( x )  0 for each x in ( a , b ) .

1d. Strictly decreasing on ( a , b ) if x1  x2 in ( a , b )  f ( x1 )  f ( x2 ) for all x1 , x2  ( a , b )

. Alternatively, f ' ( x )  0 for each x in ( a , b )

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 9

(2) A function f is monotonic on ( a , b ) if it is strictly increasing or strictly decreasing on ( a , b ) .

(3) A point c in the domain of a function f at which either f ' ( c ) = 0 or f is not differentiable is

called a critical point.

Maxima and Minima

(4) First Derivative Test
Given a curve y = f(x),
(a) For the stationary point at x = a,
dy
(i) if changes sign from negative to positive as x increases through a, the point S is a
dx
minimum point,

om
dy
(ii) if changes sign from positive to negative as x increases through a, the point S is a

.c
dx

hs
maximum point,
dy at
(iii) if does not change sign as x increase through a, the point S is a point of inflexion.
dx
m
(b) A stationary point is called a turning point if it is either a maximum point or a minimum point.
aj

(5) Second Derivative Test

aj

Given a curve y = f(x),

itb

dy d2y
 0 at x = a  S(a, f(a)) is a turning point.
m

(a) = 0 and
dx dx 2
.a

d2y d2y
w

(i) If 2 > 0, then S is a minimum point. (ii) If 2 < 0, then S is a maximum point.
dx dx
w

dy d2y
w

(b) = 0 and 2 = 0 at x = a, go back to First Derivative Test.

dx dx
(6) Working rule for finding absolute maxima and/or absolute minima:
Step1: Find all critical points of f in the given interval.
Step 2: Take end points of the interval.
Step 3: At all these points (listed in step 1 and 2), calculate the values of f .
Step 4: Identify the maximum and minimum values of f out of values calculated in step 3.

Dr. Amit Bajaj | www.amitbajajmaths.com | amitbajajcrpf@gmail.com Page 10