Revision Notes: Track
Revision Notes: Track
Revision Notes: Track
Revision Notes
BRUSH UP your concept in Fast Track Mode
Both the empty relation and the universal relation are Types of Function
sometimes called trivial relations.
1. One-one (Injective) Function
3. Reflexive Relation
A function f : A → B is said to be one-one, if f ( x1 ) = f ( x2 )
A relation R defined on set A is said to be reflexive, if ⇒ x1 = x2 or x1 ≠ x2 ⇒ f ( x1 ) ≠ f ( x2 )
( x, x ) ∈ R, ∀ x ∈ A.
where, x1, x2 ∈ A
4. Symmetric Relation
2. Many-one Function
A relation R defined on set A is said to be symmetric, if
( x, y ) ∈ R ⇒ ( y, x ) ∈ R, ∀ x, y ∈ A A function f : A → B is said to be many-one, if two or
more than two elements in A have the same image in B,
5. Transitive Relation i . e ., if x1 ≠ x2 , then f ( x1 ) = f ( x2 ).
A relation R defined on set A is said to be transitive, if
3. Onto (Surjective) Function
( x, y ) ∈ R and ( y, z ) ∈ R ⇒ ( x, z ) ∈ R, ∀ x, y, z ∈ A
A function f : A → B is said to be onto, if every element in
6. Equivalence Relation B has its pre-image in A, i.e., if for each y ∈ B, there exists
A relation R on a set A is called an equivalence relation, if an element x ∈ A, such that f ( x ) = y.
it is reflexive, symmetric and transitive.
1
Fast Track Revision Notes Mathematics-XII
1
sin−1 x ≠ sin−1
1
sin−1 x ≠ (sin x)−1 (sin x)−1 ≠
x sin x
Domain, Range and Principal Values of Inverse Trigonometric Functions
Function Domain Range Principal value branch
−1
sin x [–1, 1] − π , π π π
− ≤ y≤ , where y = sin−1 x
2 2 2 2
cos −1 x [–1, 1] [0, π ] 0 ≤ y ≤ π, where y = cos −1 x
tan−1 x − π, π π π
R
− < y< , where y = tan−1 x
2 2 2 2
2
Fast Track Revision Notes Mathematics-XII
Angle (θ) π π π π
0° = 0 30 ° = 45 ° = 60 ° = 90 ° =
Ratio 6 4 3 2
sin θ 0 1 1 3 1
2 2 2
cos θ 1 3 1 1 0
2 2 2
tan θ 0 1 1 3 ∞
3
3
Fast Track Revision Notes Mathematics-XII
Matrices
Matrix If m = n, then matrix is a square matrix.
A matrix is an ordered rectangular array of numbers or A matrix is denoted by the symbol [ ].
functions. The number or functions are called the elements i.e., [A] = [aij] m × n
or the entries of the matrix.
We shall consider only those matrices whose elements are
real number or function taking real values.
Order of Matrix
A matrix of order m × n is of the form Types of Matrices
a11 a12 a13 K a1n (i) Row matrix A matrix having only one row and many
a a22 a23 K a2 n columns, is called a row matrix.
A = 21
K K K K K (ii) Column matrix A matrix having only one column and
a am3 K amn
m1 am2 many rows, is called a column matrix.
Its element in the ith row and jth column is aij.
4
Fast Track Revision Notes Mathematics-XII
(iii) Zero matrix or null matrix If all the elements of a matrix Properties of Multiplication of Matrices
are zero, then it is called a zero or null matrix. It is denoted (i) Associative law ( AB)C = A(BC )
by symbol O.
(ii) Existence of multiplicative identity
(iv) Square matrix A matrix in which number of rows and
A ⋅ I = A = I ⋅ A, I is called multiplicative identity.
number of columns are equal, is called a square matrix.
(iii) Distributive law A(B + C ) = AB + AC
(v) Diagonal matrix A square matrix is said to be a diagonal
matrix, if all the elements lying outside the diagonal
elements are zero. Transpose of a Matrix
(vi) Scalar matrix A diagonal matrix in which all principal The matrix obtained by interchanging the rows and
diagonal elements are equal, is called a scalar matrix. columns of a given matrix A, is callled transpose of a
matrix. It is denoted by A′ or AT .
(vii) Unit matrix or identity matrix A square matrix having 1
(one) on its principal diagonal and 0 (zero) elsewhere, is Properties of Transpose of Matrices
called an identity matrix. It is denoted by symbol I. (i) ( A + B)′ = A′ + B′ (ii) (kA)′ = kA′
(viii) Equality of Matrix Two matrices are said to be equal, if (iii) ( AB)′ = B′ A′ (iv) ( A′ )′ = A
their order is same and their corresponding elements are
also equal.
Symmetric and Skew-Symmetric Matrix
A square matirx A is callled symmetric, if A′ = A.
Addition of Matrices
A square matrix A is called skew-symmetric, if A′ = − A.
Let A and B be two matrices each of order m × n. Then, the
sum of matrices A + B is defined, if matrices A and B are of Properties of Symmetric and
same order. Skew-symmetric Matrix
If A = [aij ]m × n , B = [aij ]m × n (i) For any square matrix A with real number entries,
Then, A + B = [aij + bij ]m × n A + A′ is a symmetric matrix and A − A′ is a
skew-symmetric matrix.
Properties of Addition of Matrices (ii) Any square matrix can be expressed as the sum of
If A, B and C are three matrices of same order m × n, then symmetric and a skew-symmetric matrix.
(i) Commutative law A + B = B + A 1 1
i.e., A = ( A + A′ ) + ( A − A′ )
(ii) Associative law ( A + B) + C = A + (B + C ) 2 2
(iii) Existence of additive identity A zero matrix (O) of order (iii) The principal diagonal elements of a
m × n (same as of A), is additive identity, if skew-symmetric matrix are always zero.
A+ O = A=O + A
(iv) Existence of additive inverse If A is a square matrix, Elementary Operations of a Matrix
then the matrix (− A), is additive inverse, if There are six operations (transformations) on a matrix,
A + ( − A) = O = ( − A) + A three of which are due to rows and three due to
columns, which are known as elementary operations or
If A and B are not of same order, then A + B is not defined.
transformations.
(i) The interchange of any two rows or two
Difference of Matrices columns Symbolically, the interchange of ith and
If A = [aij ], B = [bij ] are two matrices of the same order m × n, jth rows is denoted by Ri ↔ R j and interchange of
then difference, A − B is defined as a matrix D = [d ij ], where ith and jth columns is denoted by Ci ↔ C j.
d ij = aij − bij, ∀i , j .
(ii) The multiplication of the elements of any row
or column by a non-zero number Symbolically,
Multiplication of a Matrix by a Scalar the multiplication of each element of the ith row
Let A = [aij ]m × n be a matrix and k be any scalar. Then, the by k, where k ≠ 0 is denoted by Ri → kRi. The
matrix obtained by multiplying each element of A by k is called corresponding column operation is denoted by
the scalar multiple of A by k, i.e., kA = [kaij ]m × n . Ci → kCi.
(i) k( A + B) = kA + kB (ii) (k + l )A = kA + lA (iii) The addition to the elements of any row or
column, the corresponding elements of any
Multiplication of Matrices other row or column multiplied by any
Let A = [aij ]m × n and B = [bij ]n × p be two matrices such that the non-zero number Symbolically, the addition to
number of columns of A is equal to the number of rows of B, the elements of ith row, the corresponding
then multiplication of A and B is denoted by AB, is given by elements of jth row multiplied by k is denoted by
n
Ri → Ri + kR j.
c ij = ∑ aik bkj The corresponding column operation is denoted
k =1
by Ci → Ci + kC j.
where, c ij is the element of matrix C and C = AB.
5
Fast Track Revision Notes Mathematics-XII
Determinants
Determinant Minors and Cofactors
Every square matrix A is associated with a number, called its Minors Minor of an element aij of a matrix is the
determinant and it is denoted by det(A) or A. determinant obtained by deleting i th row and jth
column. It is denoted by Mij.
Expansion of Determinant of Order (2×2) a11 a12 a13
a11 a12 If A = a21 a22 a23 , then
= a11 a22 − a12 a21
a21 a22 a31 a32 a33
(i) If the rows and columns of a determinant are Cofactor If Mij is the minor of an element aij, then the
interchanged, then the value of the determinant does not cofactor of aij is denoted by Cij or Aij and defined as
change. follows
(ii) If any two rows (columns) of a determinant are Aij = Cij = (− 1)i + j Mij
interchanged, then sign of determinant changes.
(iii) If any two rows (columns) of a determinant are identical, Cofactors of A are Cij = (− 1)i + j Mij
then the value of the determinant is zero. where, i = 1, 2, 3 and j = 1, 2, 3.
(iv) If each element of a row (column) is multiplied by a
non-zero number k, then the value of the determinant is If elements of a row (column) are multiplied with
cofactors of any other row (column), then their sum is
multiplied by k. By this property, we can take out any
zero.
common factor from any one row or any one column of a
determinant.
(v) If A is a n × n matrix, then| kA| = k n |⋅ A|.
Area of Triangle
Let A( x1, y1 ), B( x2 , y2 ) and C( x3 , y3 ) be the vertices of a
(vi) If each element of any row (column) of a determinant is
∆ABC. Then, its area is given by
added k times the corresponding element of another row
(column), then the value of the determinant remains x1 y1 1
1
unchanged. ∆= x2 y2 1
2
(vii) If some or all elements of a row (column) of a determinant x3 y3 1
are expressed as sum of two (more) terms, then the
1
determinant can be expressed as sum of two (more) = ⋅ x1( y2 − y3 ) + x2 ( y3 − y1 ) + x3 ( y1 − y2 )
determinants. 2
6
Fast Track Revision Notes Mathematics-XII
(i) Since, area is positive quantity. So, we always take the Properties of Inverse of a Square Matrix (A)
absolute value of the determinant.
(i) ( A−1 )−1 = A (ii) ( AB)−1 = B −1 A−1
(ii) If area is given, use both positive and negative values
of the determinant for calculation. (iii) ( AT )−1 = ( A−1 )T (iv) (kA)−1 = kA−1
(v) adj ( A−1 ) = (adj A)−1
Condition of Collinearity
Three points A( x1, y1 ), B( x2 , y2 ) and C( x3 , y3 ) are A is said to be singular, if| A|= 0.
collinear, when ∆ = 0.
x1 y1 1
i . e ., x 2 y2 1 = 0 System of Linear Equations
x3 y3 1 Let the system of equations be
a1 x + b1 y + c1 z = d1,
a2 x + b2 y + c 2 z = d 2
Adjoint of a Matrix and a3 x + b3 y + c 3 z = d 3
The adjoint of a square matrix A is defined as the transpose Then, this system of equations can be written as AX = B
of the matrix formed by cofactors. a1 b1 c1 x d1
Let A = [ aij ] be a square matrix of order n, then adjoint of A,
where, A = a2 b2 c 2 , X = y and B = d 2
i . e ., adj A = CT , where C = [Cij ] is the cofactor matrix of A.
a3 b3 c 3 z d 3
Properties of Adjoint of Square Matrix A system of equations is consistent or inconsistent
If A and B are square matrices of order n, then according as its solution exists or not.
(i) A(adj A) = | A| In = (adj A)A (i) For a square matrix A in matrix equation AX = B
(ii) adj ( AT ) = (adj A)T (a) | A| ≠ 0, then system of equations is consistent and
has unique solution.
(iii) | adj A| = | A|n − 1, if| A| ≠ 0
(b) | A| = 0 and (adj A) B ≠ O, then there exists no
2
(iv) |adj [adj ( A)]| = | A|( n −1) ' if| A| ≠ 0 solution, i . e ., inconsistent.
(c) | A| = 0 and (adj A) B = O, then system of equations
(v) (adj AB) = (adj B) (adj A)
is consistent and has an infinite number of
solutions.
Inverse of a Matrix 0
(ii) When B = 0 , in such cases, we have
A square matrix A has inverse, if and only if A is a
non-singular (| A| ≠ 0 ) matrix. The inverse of A is denoted 0
by A−1 i.e., (a) | A| ≠ 0 ⇒ System has only trivial solution
1 i.e., x = 0, y = 0 and z = 0
A− 1 = (adj A),| A| ≠ 0
| A| (b) | A| = 0 ⇒ System has infinitely many solutions.
7
Fast Track Revision Notes Mathematics-XII
(ix)
d
(cot x ) = − cosec 2 x (iii) log a mn = n log a m
dx
(iv) log a a = 1; a > 0 and a ≠ 1
d
(x) (e x ) = e x (v) log a m = log b m + log a b; a > 0, b > 0, a ≠ 1, b ≠ 1 and
dx
m>0
d
(xi) (a x ) = a x loge a, a > 0 (vi) log a m × log m a = 1 ; a > 0, m > 0, a ≠ 1 and m ≠ 1
dx
d 1 1
(xii) (loge x ) = , x > 0 (vii) log bm a = log b a ; a > 0, b > 0 and b ≠ 1
dx x m
d 1 log m a
(xiii) (log a x ) = , a > 0, a ≠ 1 (viii) log b a = ; a > 0, b > 0, b ≠ 1, m > 0 and m ≠ 1
dx x loge a log m b
m
d 1 (ix) alog a = m; a > 0, m > 0, a ≠ 1
(xiv) (sin −1 x ) = , −1 < x < 1
dx 1 − x2
8
Fast Track Revision Notes Mathematics-XII
Application of Derivatives
Rate of Change of Quantities (iii) Area of a trapezium =
1
(Sum of parallel sides)
2
If y = f ( x ) is a function, where y is dependent variable and x
dy × Perpendicular distance between them
is independent variable. Then, [or f ′ ( x )] represents the
dx (iv) Area of a circle = πr 2
dy
rate of change of y w.r.t. x and [or f ′ ( x0 )] and circumference of a circle
dx x = x
0
= 2πr, where r is the radius of circle.
represents the rate of change of y w.r.t. x at x = x0 .
∆y 4
(i) Average rate of change of y w.r.t. x = (v) Volume of sphere = πr 3 and surface area = 4πr 2
∆x 3
dy where, r is the radius of sphere.
(ii) Instantaneous rate of change of y w.r.t. x = (vi) Total surface area of a right circular cylinder
dx
dy dy / dt dx = 2 πrh + 2 πr 2
(iii) Related rate of change = = , if ≠0
dx dx / dt dt Curved surface area of right circular cylinder
= 2πrh
dy dy
Here, is positive, if y increases as x increases and is and volume = πr 2 h
dx dx
negative, if y decreases as x increases. where, r is the radius and h is the height of the cylinder.
1
Marginal Cost (vii) Volume of a right circular cone = πr 2 h,
3
Marginal cost represents the instantaneous rate of change Curved surface area = πrl
of the total cost at any level of output. If C( x ) represents the and total surface area = πr 2 + πrl
cost function for x units produced, then marginal cost, where, r is the radius, h is the height and l is the slant
d
denoted by MC, is given by MC = {C( x )}. height of the cone.
dx
(viii) Volume of a parallelopiped = xyz
Marginal Revenue and surface area = 2( xy + yz + zx )
where, x,y and z are the dimensions of parallelopiped.
Marginal revenue represents the rate of change of total
(ix) Volume of a cube = x 3 and surface area = 6 x 2
revenue with respect to the number of items sold at an
where, x is the side of the cube.
instant. If R( x ) represents the revenue function for x units
3
sold, then marginal revenue, denoted by MR, is given by (x) Area of an equilateral triangle = (Side) 2 .
d 4
MR = { R( x )}.
dx
Increasing and Decreasing
Total cost = Fixed cost + Variable cost
i.e., C ( x) = f(c ) + v( x)
Functions
(i) Increasing functions Let I be an open interval
Some Useful Results contained in the domain of a real valued function f.
(i) Area of a square = x 2 and perimeter = 4x Then, f is said to be
where, x is the side of the square. (a) increasing on I, if x1 < x2
9
Fast Track Revision Notes Mathematics-XII
(ii) Decreasing functions Let I be an open interval (a) If m1m2 = − 1, then tangents are perpendicular to each
contained in the domain of a real valued function f. other. In this case, we say that the curves intersect
Then, f is said to be each other orthogonally.
This also happens, when m1 = 0 and m2 = ∞.
(a) decreasing on I, if x1 < x2 (b) If m1 = m2 , then tangents are parallel to each other.
⇒ f ( x1 ) ≥ f ( x2 ), ∀ x1, x2 ∈ I (c) If φ = 0, then curves touch each other.
Let y = f1( x ) and y = f2 ( x ) be the two curves and φ be the A monotonic function in an interval l, means that f is either
angle between their tangents at the point of their intersection increasing or decreasing in l.
P ( x1, y1 ).
m − m2
Then, tan φ = 1
1 + m1m2
Critical Point
A point c in the domain of a function f at which either
dy
where, m1 = for y = f1( x ) f ′ (c ) = 0 or f is not differentiable, is called a critical point
dx
( x1, y1 ) of f. Note that, if f is continuous at c and f′ (c) = 0, then
dy there exists a h > 0 such that f is differentiable in the
and m2 = for y = f2 ( x ). interval (c − h, c + h).
dx
( x1, y1 )
10
Fast Track Revision Notes Mathematics-XII
Integrals
Indefinite Integral (xv) ∫
1
dx = − cos −1 x + C
Let F( x ) and f ( x ) be two functions connected together, such 1− x 2
d 1
[F( x )] = f ( x ), then F( x ) is called integral of f ( x ) or dx = cos − 1 x + C
that
dx (xvi) ∫ 1 + x2
indefinite integral or anti-derivative.
dx
Thus, ∫ f ( x )dx = F( x ) + C (xvii) ∫ 1+ = tan − 1 x + C
x2
where, C is an arbitrary constant.
1
(xviii) ∫ dx = − cot − 1 x + C
Important Results 1+ x 2
x n +1 dx
= sec − 1 x + C
(i) ∫ x ndx =
(n + 1 )
+ C, n ≠ − 1 (xix) ∫ x x2 − 1
1 1 −1
(ii) ∫ x
dx = log| x| + C, x ≠ 0 (xx) ∫ x x2 − 1
dx = − cosec x+C
∫e dx = e x + C
x
(iii)
ax
Properties of Indefinite Integral
∫ a dx = +C
x
(iv) (i) The process of differentiation and integration are
log a
inverse of each other.
(v) ∫ sin x dx = − cos x + C d
dx ∫
i.e., f ( x )dx = f ( x ) and ∫ f ′( x )dx = f ( x ) + C
(vi) ∫ cos x dx = sin x + C where, C is any arbitrary constant.
(vii) ∫ tan x dx = log|sec x| + C (ii) ∫ { f ( x ) ± g ( x )} dx = ∫ f ( x )dx ± ∫ g ( x )dx
(viii) ∫ cot x dx = log|sin x| + C (iii) ∫ K f ( x )dx = K ∫ f ( x )dx
11
Fast Track Revision Notes Mathematics-XII
2. px ± q A B 3. x −a2 2
x = a sec θ or a cosec θ
+
(x ± a)2 (x ± a) (x ± a)2
4. a+ x a−x x = a cos 2 θ
or
3. px2 ± qx ± r A
+
B
+
C
a−x a+ x
(x ± a) (x ± b)2 (x ± a) (x ± b) (x ± b)2
5. x −α x = α cos 2 θ + β sin2 θ
4. px2 ± qx ± r A Bx + C or (x − α) (x − β)
+ 2 , where β−x
(x ± a) (x2 ± bx ± c) (x ± a) x ± bx ± c
x2 ± bx ± c cannot be factorised
further. Integration of Irrational and Trigonometric
Functions
Integration by Parts
Integral Substitution
Let u and v be two differentiable functions of a single
variable x, then the integral of the product of two x 2
Let x2 = y and proceed for
functions is
(i)
∫ (x2 + a2 ) (x2 + b2 ) dx partial fraction of
d
∫ uv dx = u ∫ v dx − ∫ u ∫ v dx dx y
I II dx ( y + a2 ) ( y + b2 )
If two functions are of different types, then consider the dx x
1st function (i.e., u) which comes first in word ILATE, (ii) ∫ a ± b cos x Put cos x =
1 − tan2
2 , then
where x
1 + tan2
I : Inverse trigonometric function e.g., sin −1 x 2
x
L : Logarithmic function e.g., log x put tan = t
2
A : Algebraic function e.g., 1, x, x 2
T : Trigonometic function e.g., sin x, cos x dx x
E : Exponential function e.g., e x
(iii) ∫ a ± b sin x Put sin x =
2 tan
2 , then
x
1 + tan2
2
Some Important Integrals x
put tan = t
dx 1 x−a 2
(i) ∫ ( x 2 − a2 ) = 2 a log x + a + C dx Put a = r cos θ and b = r sin θ
(iv) ∫ a sin x + b cos x
dx 1 a+ x
(ii) ∫ (a2 − x 2 ) = 2 a log a − x +C
a sin x + b cos x + c Put a sin x + b cos x + c
(v) ∫ p sin x + q cos x
dx
=A
d
(p sin x + q cos x)
dx
(iii) ∫ (x − a )
2 2
= log| x + x 2 − a2| + C dx
+ B (p sin x + q cos x)
a2 dx Put px + q = t
− log x + x 2 − a2 + C
(viii) ∫ (ax2 + bx + c) px + q
2
x dx 1
(vii) ∫ x 2 + a2 dx =
2
x 2 + a2 (ix) ∫
(px + q)( ax2 + bx + c )
Put px + q =
t
a2
+ log x + x 2 + a2 + C dx 1
2 (x) ∫ Put x =
t
(px + q) ax + b
2 2
12
Fast Track Revision Notes Mathematics-XII
where, nh = b − a
(iv) ∫a f ( x )dx = ∫a f ( x )dx + ∫c f ( x )dx, where a < c < b.
b b
a
(ix) ∫ f ( x )dx = 2 ∫0 f ( x )dx, if f (− x ) = f ( x ), even
a
−a 0, if f (− x ) = − f ( x ), odd
Application of Integrals
1. The area enclosed by the curve y = f ( x ), the X-axis and 3. If the curve y = f ( x ) lies below the X-axis, then area
the ordinates at x = a and x = b, is given by ∫ | y| dx.
b
bounded by the curve y = f ( x ), X-axis and the ordinates
a
b
at x = a and x = b, is given by ∫a ydx .
Y
Y
f(x) B
y= x=a x=b
A
X′ X
x=a y x=b O
X′ O X
L dx M y = f (x)
Y′ Y′
4. Generally, it may happen that some position of the curve
2. The area enclosed by the curve x = f ( y ), the Y-axis and is above X-axis and some is below the X-axis which is
d shown in the figure. The area A bounded by the curve
the abscissae at y = c and y = d , is given by ∫ | x| dy. y = f ( x ), X-axis and the ordinates at x = a and x = b, is
c
given by A = | A2 | + A1.
.
Y
y=d C Y
B A1
x
dy x = f(y)
x=b
x=a
A y=c D X′ X
O
X′ X
O
Y′ A2
Y′
13
Fast Track Revision Notes Mathematics-XII
5. The area enclosed between two curves, y1 = f ( x ) and 7. Area bounded by the two curves, y = f ( x ) and y = g( x )
y2 = g ( x ) and the ordinates at x = a and x = b, is given between the ordinates at x = a and x = b, is given by
c b
∫ f ( x )dx + ∫ g( x ) dx.
b
by ∫a y2 − y1 dx. a c
Y Y
)
g (x
y=
y=
f (x
y2 = g(x)
)
y1 = f(x)
X′ X
O x=a x=b X′ X
O x=a x=c x=b
Y′
Y′
x2 = g(y)
Differential Equations
Differential Equation Particular Solution of a Differential
An equation containing an independent variable, dependent Equation
variable and derivative of dependent variable with respect to The solution obtained from the general solution given
independent variable, is called a differential equation. The particular values to the arbitrary constants, is called a
derivates are denoted by the symbols particular solution of the differential equation.
dy d 2 y d ny
, 2 ,...., n or y′ , y′ ′, ..., y′ ′ ′ ... n or y1, y2 ,..., yn Formation of a Differential Equation
dx dx dx
An equation with independent, dependent variables
Order of a Differential Equation involving some arbitrary constants is given, then a
The order of the highest derivative occurring in the differential differential equation is obtained as follows
equation, is called order. (i) Differentiate the given equation with respect to the
independent variable (say x) as many times as the
Degree of a Differential Equation
number of arbitrary constants in it.
The power of the highest order derivative in the differential
(ii) Eliminate the arbitrary constants.
equation, is called degree.
(iii) The obtained equation is the required differential
equation.
Solution of a Differential Equation
A relation between the dependent and independent variables The order of a differential equation representing a family
which, when substituted in the differential equation reduces it of curves is same as the number of arbitrary constants
to an identity, is called a solution. present in the equations corresponding to the family of
curves.
General Solution of a
Differential Equation Equation in Variable Separable Form
If the equation can be reduced into the form
A solution of a differential equation which contains as many
arbitrary constants as the order of the differential equation, is f ( x )dx + g( y ) dy = 0,
called the general solution or primitive solution of the we say that the variables have been separated.
differential equation. Then, ∫ f ( x ) dx + ∫ g( y ) dy = C
14
Fast Track Revision Notes Mathematics-XII
Vector Algebra
Vector Like Vectors
A quantity that has magnitude as well as direction, is called The vectors which have same direction are called like
a vector. vectors.
→
Since, the length is never negative, so the notation | a | < 0 Unlike Vectors
has no meaning. The vectors which have opposite directions are called
unlike vectors.
Scalar
A quantity that has magnitude only, is called scalar.
Equal Vectors
Two vectors are equal, if they have same magnitude and
Magnitude of a Vector direction.
→ →
If a = a $i + b $j + c k$ , then | a | = a2 + b2 + c 2 Negative of a Vector
A vector whose magnitude is same as that of given vector
Free Vector but the direction is opposite is called negative vector of the
If the initial point of a vector is not specified, then it is called → → →
a free vector. given vector. e.g., Let AB be a vector, then − AB or BA is a
negative vector.
Type of Vectors Coplanar Vectors
Zero or Null Vector A system of vectors is said to be coplanar, if their supports
are parallel to same plane.
A vector whose magnitude is zero i . e ., whose initial and
final points coincide, is called a null vector or zero vector.
Addition of Vectors
Unit Vector → →
If OA = a
A vector whose magnitude is one unit. The unit vector in
→ → →
the direction of a is represented by a. $ The unit vectors and AB = b,
along X-axis, Y-axis and Z-axis are represented by $i , $j and k$ , → → → → →
then a + b = OA + AB = OB
respectively.
B
Coinitial Vectors
Two or more vectors having the same initial point are called
coinitial vectors. b
Collinear Vectors O A
a
The vectors which have same support are called collinear
vectors.
15
Fast Track Revision Notes Mathematics-XII
16
Fast Track Revision Notes Mathematics-XII
17
Fast Track Revision Notes Mathematics-XII
Three-Dimensional Geometry
Direction Cosines and (iii) Angle between two lines If θ is the angle between
→ → → → → →
Direction Ratios two lines
→ →
r =a +tb and r = c + s d, then
18
Fast Track Revision Notes Mathematics-XII
(vi) The shortest distance between the lines (vi) Distance of a point from a plane Distance of a
x − x1 y − y1 z − z1 point P( x1, y1, z1 ) from a plane ax + by + cz + d = 0 is
= = given by
a1 b1 c1
x − x 2 y − y 2 z − z2 | ax1 + by1 + cz1 + d|
and = = is p=
a2 b2 c2 a2 + b2 + c 2
x2 − x1 y2 − y1 z2 − z1 (vii) Angle between two planes The angle between two
planes is the angle between their normals.
a1 b1 c1
If θ is the angle between the planes
a2 b2 c2
a1 x + b1 y + c1 z + d1 = 0
1 2 − b2c1 ) + (c1a2 − c 2 a1 )
2 2
(bc
and a2 x + b2 y + c 2 z + d 2 = 0, then
+ (a1b2 − a2 b1 )2
a1a2 + b1b2 + c1c 2
cos θ =
a12 + b12 + c12 a22 + b22 + c 22
19
Fast Track Revision Notes Mathematics-XII
(iii) Equation of plane passing through three non-collinear (vii) Distance of a point from a plane The
points The equation of plane passing through three →
→ → →
perpendicular distance of a point a from the
non-collinear points a , b and c is → → →
plane r ⋅ n = d, where n is normal to the plane, is
→ → → → → →
( r − a ) ⋅ [( b − a ) × ( c − a )] = 0 → →
a ⋅n −d
(iv) Plane passing through the intersection of two given
planes The equation of plane passing through the →
→ → → → n
intersection of two planes r ⋅ n1 = d1 and r ⋅ n 2 = d 2 is
→ → →
r ⋅ ( n 1 + λ n 2 ) = d1 + λ d 2 . (viii) The length of the perpendicular from origin O to
→ → → → → → → → d
(v) Two lines r = a 1 + λ b 1 and r = a 2 + λ b 2 are coplanar, if the plane r ⋅ n = d is .
→
→ → → → | n|
and only if (a 2 − a 1 ) ⋅ (b 1 × b 2 ) = 0.
→ → →
→ → → → (ix) The angle θ between line r = a + λ b and plane
(vi) Angle between the planes r ⋅ n 1 = p1 and r ⋅ n 2 = p2 is given
→ →
n1⋅ n 2 → →
by cos θ = . → → b⋅ n
→ → r ⋅ n = d is cos θ =
| n 1|| n 2| → →
b n
→ → →
Two planes are perpendicular to each other, if n 1 ⋅ n 2 = 0
→ → →
→ →
and parallel, if n1 × n2 = 0 . b ⋅n
and sin φ = , where φ = 90 °− θ.
→ →
b ⋅ n
Linear Programming
Linear Programming Problem 5. Solution
A linear programming problem is one that is concerned with A set of values of the variables which satisfy the
finding the optimal value (maximum or minimum value) of a linear constraints of given linear function (objective function)
function (called objective function) of several variables (say x and of several variable, subject to the conditions that the
y called decision variable), subject to the conditions that the variables are non-negative is called a solution of the
variables are non-negative and satisfy a set of linear inequalities linear programming problem.
(called linear constraints). 6. Feasible Solution
Any solution to the given linear programming
Some Terms Related to LPP problem which also satisfies the non-negative
1. Constraints restrictions of the problem is called a feasible
The linear inequations or inequalities or restrictions on the solution. Any point outside the feasible region is
variables of a linear programming problem are called constraints. called an infeasible solution.
The conditions x ≥ 0, y ≥ 0 are called non-negative restrictions.
7. Feasible Region
2. Optimisation Problem The set of all feasible solutions constitutes a region
A problem which seeks to maximise or minimise a linear function which is called the feasible region. Each point in this
subject to certain constraints determined by a set of linear region represents a feasible choice. The region other
inequalities is called an optimisation problem. Linear than feasible region is called an infeasible region.
programming problems are special type of optimisation
8. Bounded Region
problems.
A feasible region of a system of linear inequalities is
3. Objective Function said to be bounded, if it can be enclosed within a
A linear function of two or more variables which has to be circle. Otherwise, it is said to be unbounded region.
maximised or minimised under the given restrictions in the form 9. Optimal Solution
of linear inequations (or linear constraints) is called the A feasible solution at which the objective function has
objective function.The variables used in the objective function optimal value is called the optimal solution of the
are called decision variables. linear programming problem.
4. Optimal Values 10. Optimisation Technique
The maximum or minimum value of an objective function is
The process of obtaining the optimal solution is
known as its optimal value.
called optimisation technique.
20
Fast Track Revision Notes Mathematics-XII
Probability
Some Basic Definitions Complement of an Event
Let some A be an event in a sample space S, then
1. Experiment
complement of A is the set of all sample points of
An operation which results in some well-defined outcomes, is
the space other than the sample point in A and it
called an experiment.
is denoted by A′ or A.
2. Random Experiment i . e ., A′ = { n : n ∈ S , n ∉ A}
An experiment in which total outcomes are known in advance but
occurrence of specific outcome can be told only after completion
of the experiment, is known as a random experiment. Some Basic Terms
3. Trial Coin
When a random experiment is repeated under identical A coin has two sides, head and tail. If an event
conditions and it does not give the same result each time but consists of more than one coin, then coins are
may result in one of the several possible outcomes, then such considered as distinct, if not otherwise stated.
experiment is called a trial.
(i) Sample space of one coin= { H, T }
4. Sample Space (ii) Sample space of two coins
The set of all possible outcomes of a random experiment is = {(H, T ), (T, H ), ( H, H ), (T, T )}
called its sample space. It is usually denoted by S.
(iii) Sample space of three coins
5. Discrete Sample Space = {( H, H, H ), ( H, H, T ), ( H, T, H ), (T, H, H ),
A sample space is called a discrete sample space, if S is a finite ( H, T, T ), (T, H, T ), (T, T, H ), (T, T, T )}
set.
Die
Event A die has six faces marked 1, 2, 3, 4, 5 and 6. If we
have more than one die, then all dice are
A subset of the sample space associated with a random
considered as distinct, if not otherwise stated.
experiment is called an event or case.
(i) Sample space of a die = {1, 2, 3, 4, 5, 6}
Type of Events (ii) Sample space of two dice
Equally Likely Events (1, 1), (1, 2 ), (1, 3), (1, 4), (1, 5), (1, 6)
The given events are said to be equally likely, if none of them is (2, 1), (2, 2 ), (2, 3), (2, 4), (2, 5), (2, 6)
expected to occur in preference to the other.
(3, 1), (3, 2 ), (3, 3), (3, 4), (3, 5), (3, 6)
Mutually Exclusive Events
=
A set of events is said to be mutually exclusive, if the happening of (4, 1), (4, 2 ), (4, 3), (4, 4), (4, 5), (4, 6)
one excludes the happening of the other i.e., if A and B are
mutually exclusive, then ( A ∩ B) = φ. (5, 1), (5, 2 ), (5, 3), (5, 4), (5, 5), (5, 6)
Exhaustive Events (6, 1), (6, 2 ), (6, 3), (6, 4), (6, 5), (6, 6)
A set of events is said to be exhaustive, if the performance of the
experiment always results in the occurrence of atleast one of
them.
If E1, E2 ,… , En are exhaustive events, then E1 ∪ E2 ∪…∪ En = S .
21
Fast Track Revision Notes Mathematics-XII
22
Fast Track Revision Notes Mathematics-XII
A set of events E1, E2 , ..., En is said to represent a partition called expectation of X, i.e., E( X ) = ∑ xi pi.
of the sample space S, if it satisfies the following i =1
conditions nn
2
23