Chapter 02

Inverse Trigonometry Functions

1. Invertible Function
 A one – one onto function is called an invertible function.
2. Inverse of a function
 Let f : X Y be a one – one onto function. Then for each y Y, there
exists a unique element x X such that f(x) = y.
 Domain (f-1 ) = range (f) and range (f-1 ) = domain (f)
3.

Function Domain Range (Principal Value)

1. y = x [-1, 1] 0 1

2. y = x [-1, 1] [0, ]

3. y = x R . /

4. y = x R (0, )
5. y = x R – [-1, 1] [0, ] – 2 3
6. y = x R – (-1, 1) 0 1 – {0}
4.

(i) ( ) 0 1

(ii) ( ) , -

(iii) ( ) . /

(iv) ( ) ( )

(v) ( ) , -– 2 3

(vi) ( ) 0 1 – {0}

5.

(i) . / ( )

(ii) . / ( )

(iii) . / ( )

6.
(i) ( ) , -
(ii) ( )
(iii) ( ) | |
7.
(i) ( ) , -
(ii) ( ) | |
(iii) ( )
8.

(i) x+ x= , -

(ii) x+ x= R

(iii) x+ x= | |

9.

(i) x+ y= . /

(ii) x– y= . /

10.

(i) 2 x= . /,| |

(ii) 2 x= . /, | |

(iii) 2 x= . / | |

11. . / . / . / . / . /
. /
12.
S. No. Expression Substitution
1. 1- x = sin or cos
2. x = a sin or a cos
3. 1+ x = tan or cot
4. x = a tan or a cot
5. x = cos 2

6. x = a cos 2

7. x = tan
 Chapter 3 - Matrices
Matrix
• It is an ordered rectangular array of collection of numbers or functions
arranged in rows and columns is called matrix.
• The numbers or functions are known as the elements or entries of the matrix.

• E.g. 0 1

Row and Column of a Matrix

• The horizontal arrangement of elements or entries are said to form the row of
a matrix.
• The vertical arrangement of elements or entries are said to form the Column
of a matrix.

• E.g.0 1 , This matrix has two rows and two columns.

Order of Matrix
• It tells us about the number of rows and columns of a matrix.
• It is represented by a  b means a matrix has ‘a’ rows and ‘b’ columns.

• For example: [ ], there are 3 rows and 3 columns therefore the order

of matrix A is 3  3.
Types of Matrices
(1) Row Matrix: A matrix containing only one row is known as row matrix.
 For E.g. , -
 The order of row matrix is 1  n.
(2) Column Matrix: A matrix containing only one column is known as
column matrix.

 For E.g. [ ]

 The order of column matrix is m  1.

(3) Square Matrix: The number of rows and numbers of columns are equal in
this matrix.

 For E.g. [ ]

 The order of square matrix is always n  n, where ‘n’ can be any natural
number.
(4) Diagonal Matrix: If the diagonal elements are non-zero and all the non-
diagonal elements of a matrix are zero, then such type of matrix is known as
Diagonal Matrix.

 For E.g. [ ]

(5) Scalar Matrix: It is a type of diagonal matrix in which all diagonal

elements are equal.

 For E.g. 0 1 [ ]etc.

(6) Identity Matrix: It is a type of diagonal matrix in which all diagonal

elements are equal to 1.

 For E.g.0 1 [ ]

 It is denoted by I.
(7) Zero Matrix: In it all the elements are zero and this is also known as null
matrix.

 For E.g. [0], 0 1 [ ] etc.

 It is denoted by O.
(8) Rectangular Matrix: A matrix with dimensions m x n where the number
of rows (m) is different from the number of columns (n).

 For E.g. 0 1

(9) Horizontal Matrix: A matrix where the number of rows is less than the
number of columns.

 For E.g. 0 1

(10) Vertical Matrix: A matrix where the number of rows greater than the
number of columns.

 For E.g. [ ]

(11) Unit Matrix (Identity Matrix): A diagonal matrix A = [aij]n is called a

unit matrix if all the diagonal elements aij are equal to 1 when i = j.
 It is denoted by I.

 [1], 0 1, [ ]
Equality of Matrices:
 Two matrices are equal iff (if and only if) the order of both the matrices
are equal and the element of one matrix is equal to the corresponding
element of another matrix.
 For E.g. A = 0 1 and B = 0 1

All the elements of matrix A are equal to the corresponding elements of

matrix B and the order of both matrices is the same as 2  2. Hence, A = B.
Operations in Matrices
(1) Addition of Matrices:
 Addition of two matrices can be done only when they have the same
order.
 Addition can be done by adding the corresponding entries of the two
matrices.
 For e.g. A = 0 1 and B = 0 1

C=A+B

=0 1+0 1

=0 1

Multiplication of a Matrix by a scalar:

 When a matrix is multiplied by a scalar, then each element of the matrix
is multiplied by the scalar quantity and a new matrix is obtained.
 For E.g. A = 0 1

2A = 2 0 1
  
=0 1
 
=0 1

Negative of a Matrix:
 Multiplying a matrix by −1 gives negative of that matrix.
 For E.g. A = 0 1
 Negative of Matrix A is – A.
A = -1  A

= -1  0 1

=0 1

Difference of Matrices:
 Two matrices can be subtracted only when they have same order.
 Subtraction can be done by subtracting the corresponding entries of the
two matrices.
 For e.g. A = 0 1 and B = 0 1

C=A-B

=0 1-0 1

=0 1
Properties of Matrix Addition
1. Commutative Law: Matrix addition is commutative
i.e., A + B = B + A.
2. Associative Law: Matrix addition is associative
i.e., (A + B) + C = A + (B + C).
3. Existence of Additive Identity: Zero matrix O is the additive identity of a
matrix because adding a matrix with zero matrix leaves it unchanged
i.e. X + O = O + X = X.
4. Existence of Additive Inverse: Additive inverse of a matrix is a matrix
which on adding with another matrix yield 0
i.e., X + (-X) = (-X) + X = 0
Multiplication of Matrices:
 Multiplication of two matrices A and B is defined when the number of
columns of A is equal to the number of rows of B.
 Entries in rows are multiplied by corresponding entries in columns i.e.,
entries in the first row are multiplied by entries in the first column and
similarly for other entries.
 E.g. A = 0 1 and B = 0 1

AB = 0 10 1
( ) ( ) ( ) ( ) ( ) ( )
=[ ]
( ) ( ) ( ) ( ) ( ) ( )
=0 1
Properties of Matrix Multiplication
1. Non-Commutative Law: Matrix multiplication is not commutative i.e., AB
 BA but not in the case of a diagonal matrix.
2. Associative Law: Matrix multiplication follow associative law i.e., A(BC)
= (AB)C
3. Distributive Law: Matrix multiplication follow distributive law i.e.,
a. A(B + C) = AB + AC
b. (A + B)C = AC + BC
4. Existence of Multiplicative Identity: Identity matrix I is the multiplicative
identity of a matrix because multiplying a matrix with I leaves it unchanged
i.e. AI = IA = A.
Transpose of a Matrix:
 It is the matrix obtained by interchanging the rows and columns of the
original matrix.
 It is denoted by P' or PT if the original matrix is P.
 For E.g. P = 0 1 , P' or PT = 0 1

Properties of Transpose of Matrix

1. (A) = A
2. (kA) = kA (Where k is any constant)
3. (A + B) = A + B
4. (AB) = B A
Special Types of Matrices
Symmetric Matrices: It is a square matrix in which the original matrix is
equal to its transpose. (P = PT)

For E.g. P = [ ]

Transpose of Matrix P, PT = [ ]

since P = PT
Therefore, it is a Symmetric Matrix.
Skew-Symmetric Matrices: It is a square matrix in which the original matrix
is equal to the negative of its transpose. (P = - PT) For E.g. P =

[ ]

Transpose of Matrix P, PT = [ ]

= (-1) [ ]

PT = - P
Therefore, it is a Skew-Symmetric Matrix.
 Chapter 04 : Determinants
Points to be Remember
 To every square matrix of order n, a number can be associated which is
called determinant of the square matrix i.e. determinant represents a
value.
 For matrix A, |A| is read as determinant of A. (Not modulus of A).
The determinants of non - square matrices are not defined i.e. in each
determinant
Number of rows = Number of Columns
 A matrix is an arrangement of numbers and so it has no fixed value, while
each determinant has a fixed value.
 Determinant of a square matrix A = 0 1 is given by

| |=| | = a11 a22 – a12 a21

 Determinant of a square matrix of order 3, A = [ ] is given

by

| |=| |

= a11 | | – a12 | | + a13 | |

 If A and B are square matrices of same order, then

|AB| = |A| |B|.
  If the coordinates of the vertices of a triangle are (x1, y1), (x2, y2), (x3, y3)

then area of triangle = | | ||

Remark : If area is given, use both +ve and –ve values of determinant for
calculation.
 Three points (x1, y1), (x2, y2), (x3, y3) are collinear, if

| |=0

 Equation of a line joining the points (x1, y1) and (x2, y2) is

| |=0

Minors
 Minor of an element aij of a determinant is the determinant obtained by
deleting its ith row and jth column in which element aij lies.
 Minor of an element aij is denoted by Mij.

Cofactors
Cofactor of an element aij , denoted by Aij is defined by
Aij = (–1)i + j Mij , where Mij is minor of aij.

Adjoint of a matrix
 The adjoint of a square matrix A = [aij]n × n is defined as the transpose of
the matrix [Aij]n × n, where Aij is the cofactor of the element aij i.e. adj A =
[Aji] n × n
 Adjoint of the matrix A is denoted by adj A.
Points to be remember
(i) For every square matrix A, we have
A (adj A) = (adj A) A = | | I
(ii) Singular Matrix : If | | = 0.
(iii) Non - Singular Matrix : If | | 0.
(iv) (AB)-1 = B-1 A-1
(v) (A’)-1 = (A-1)’
(vi) If A and B are non-singular matrices of the same order then
(adj AB) = (adj A) (adj B)
(vii) If A is a non-singular square matrix of order n then | | = | |n – 1
(viii) If A is a non-singular square matrix of order n then
adj (adj A) = | |n – 2 A

(ix) | ( )| = | |( )

(x) A-1 = | | adj A

Solving a System of Linear Equations by Martrix Method

(i) Consistent System of Equations
If it has one or more solution.
(ii) Inconsistent System of Equations
If it has no solution.
Consider the system of equations
a1 x + b1 y + c1 z = d1
a 2 x + b2 y + c2 z = d2
a 3 x + b3 y + c3 z = d3

Let A = [ ] , X = [ ] and B = [ ]

then the given system can be written as

[ ] [ ]= [ ]

AX=B
Case 1: When | | 0, then the system has a unique solution.
Case 2: When | | = 0 and (adj A) B = O, then the system has infinitely many
solution.
Case 3: When | | = 0 and (adj A) B O, then the system has no solution.
 Chapter 05 : Continuity And Differentiability
Continuity At A Point
A real function f(x) is said to be continuous at a point ‘a’ of its domain
if LHL = RHL = f(a) = finite value.
LHL = ( )
RHL = ( )
If f(x) is not continuous at point ‘a’ then it is called point of
discontinuity.
Algebra of Continuous Function
1. Every constant function is continuous.
2. The identity function is continuous.
3. If f(x) and g(x) be continuous functions then
(a) f(x) + g(x) is continuous.
(b) f(x) - g(x) is continuous.
(c) k f(x) is continuous.
(d) f(x) g(x) is continuous.
( )
(e) is continuous at those points where g(x) 0.
( )

4. Every polynomial function is continuous.

5. The exponential function is continuous.
6. The logarithmic function is continuous.
Differentiability
Let f(x) be a real function and ‘a’ be any real number. Then we define
(i) Right-hand Derivative
( ) ( )
Rf’(a) =

(ii) Left-hand Derivative

( ) ( )
Lf’(a) =

A function f(x) is said to be differentiable at x = a, if Rf’(a) = Lf’(a).

A common value of Rf’(a) and Lf’(a) is denoted by f’(a) and it is known
as derivative of f(x) at x = a.
Derivative of some functions

1. ( ) , where c = constant

2. ( )

3. ( ( )) ( )

4. ( ( )) ( )

5. ( )

6. ( )

7. ( )
8. ( )

9. ( )

10. * ( ) ( )+ ( ) ( )

11. * ( ) ( )+ ( ) ( ) ( ) ( ) (Product Rule)

( ) ( ) ( ) ( ) ( )
12. . / (Quotient Rule)
( ) , ( )-

13. ( )

14. ( )

15. ( )

16. ( )

17. ( )

18. ( )

19. Let y = f(x) and t = g(x) then (Chain Rule)

20. ( )
√

21. ( )
√

22. ( )
23. ( )

24. ( )
| |√

25. ( )
| |√

⁄
26. Let x = f(t) and y = g(t) then , where t = parameter.
⁄

27. (i) ( )

(ii) . / ( )

28. Logarithmic Differentiation

( ) ( )
If ( )
Taking log on both sides, we get
( )
= ( )
= ( ) ( )
Now differentiate using product rule.
Properties of Logarithmic functions
1. Let ‘a’ be a real number such that a > . If ax = b, we define
.
2. (i) Common logarithm :
(ii) Natural logarithm:
3.
4.

5.

6.
7. ( )

8.

9.

10.

11.
Chapter 07 Integrals
1. ∫
2. ∫

3. ∫

4. ∫

5. ∫ | |

6. ∫ | |

7. ∫
8. ∫
9. ∫
10. ∫
11. ∫
12. ∫
13. ∫ | | | |
14. ∫ | | | |

15. ∫ | | | . /| + c

16. ∫ | | | |

17. ∫
√

18. ∫
√

19. ∫

20. ∫

21. ∫
√

22. ∫
√

23. ∫ ( ) ( ) ( ) ∫ ( ) ∫0 ( )∫ ( ) 1

24. ∫ , ( ) ( )- ( )
25. ∫ , ( ) ( )- ( )

26. ∫ , -
27. ∫ , -

28. ∫ | |

29. ∫ . /

30. ∫ | |

31. ∫ . /
√

32. ∫ | √ |
√

33. ∫ | √ |
√

34. ∫ √ √ . /

35. ∫ √ √ | √ |

36. ∫ √ √ | √ |