0% found this document useful (0 votes)
26 views18 pages

Mathematics Handbook for First-Year B.E.

The document is a handbook for first-year B.E. students covering essential mathematics topics including trigonometry, calculus, differential equations, numerical methods, vector calculus, Laplace transforms, number theory, and statistics. Each section outlines fundamental concepts, formulas, and methods relevant to the respective topics. It serves as a comprehensive resource for foundational mathematical knowledge required in engineering studies.

Uploaded by

vikas.16rv
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views18 pages

Mathematics Handbook for First-Year B.E.

The document is a handbook for first-year B.E. students covering essential mathematics topics including trigonometry, calculus, differential equations, numerical methods, vector calculus, Laplace transforms, number theory, and statistics. Each section outlines fundamental concepts, formulas, and methods relevant to the respective topics. It serves as a comprehensive resource for foundational mathematical knowledge required in engineering studies.

Uploaded by

vikas.16rv
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

HANDBOOK OF MATHEMATICS

FOR
FIRST YEAR B.E. PROGRAM

1
2
CONTENTS

TRIGONOMETRY............................................................................................................................................ 5

BASIC CALCULUS ........................................................................................................................................... 6

DIFFERENTIAL CALCULUS .............................................................................................................................. 8

PARTIAL DIFFERENTIATION ........................................................................................................................... 8

MULTIPLE INTEGRAL ..................................................................................................................................... 9

ORDINARY DIFFERENTIAL EQUATIONS ....................................................................................................... 10

PARTIAL DIFFERENTIAL EQUATIONS ........................................................................................................... 11

NUMERICAL METHODS ............................................................................................................................... 12

VECTOR CALCULUS...................................................................................................................................... 14

LAPLACE TRANSFORMS ............................................................................................................................... 16

NUMBER THEORY........................................................................................................................................ 17

STATISTICS................................................................................................................................................... 17

3
4
TRIGONOMETRY
1. Basic Functions
 

 
 

2. Identities
  ( )  ( )

 ( )  ( )

 ( )  ( )

   ( )
 
 ( )
 
 ( )

 ( ) 


 ( )

 ( )

 

 

 

 

 

5
BASIC CALCULUS
1. Differentiation


| |√

| |√

| |√

| |√

6
2. Rules of differentiation

 ( )
 ( ) ( )

3. Integration

( ) ( )
√ √

( ) ( )

( ) ( )

* √

( )+

∫[ [∫ ] ]

7
DIFFERENTIAL CALCULUS

1. Transformations for polar coordinates to Cartesian coordinates: .


2. Transformations for Cartesian coordinates to polar coordinates: √
( ) .

3. The angle between the radius vector and tangent for a polar curve :
4. The radius of curvature:
[ ]
 Cartesian curve :
[ ]
 Parametric curve :
[ ]
 Polar curve :

[ ( ) ] [ ( ) ]
5. Centre of curvature: ̅ and ̅
6. Taylor series expansion:

7. Maclaurin series expansion:

PARTIAL DIFFERENTIATION

1. Let be a function of two variables and .


 The first order partial derivative of with respect to , denoted by or or or
or is defined as provided the limit exists.
 The first order partial derivative of z with respect to y, denoted by or or zy or fy or q is
defined as provided the limit exists.
2. Notations of second order partial derivatives:
 ( ) or or or or r  ( ) or or or s
 ( ) or or or or t  ( ) or or or s

8
3. Total differential: Let be a differentiable function of two variables, x and y then
total differential (or exact differential) is defined by .
4. Total derivative: Further, if , where , , then total derivative of is
given by .
( )
5. Differentiation of implicit functions: For , .

6. Differentiation of composite functions (chain rule):


Let be function of and and that and are functions of and then,
and .

7. Jacobian: If and are functions of variables and , then the determinant | | is


called the Jacobian of , with respect to , and denoted by .
8. If , are functions of , and , are functions of , , then .

MULTIPLE INTEGRAL

1. Area of a region ∬
2. Volume of a Solid ∭

3. Change of variables: From Cartesian plane to

 uv-plane ∬ ∬ ( )| |
 polar coordinates ∬ ∬

4. Mass of two-dimenssional object with surface density : ∬


5. The center of gravity: ∬ and ∬
6. Mass of a solid with density : ∭
7. The center of gravity: ∭ ∭ and

9
ORDINARY DIFFERENTIAL EQUATIONS

1. Auxiliary/Characteristic Equation: The equation is known as the Auxiliary


equation of .
2. Solution of a Homogeneous ODE with constant coefficients: For the differential
equation , if and are the roots of auxiliary equation,
then solution is given by following cases

 If roots are real and distinct, then .


 If are real, then .
 If roots are complex say , then .
3. Non-homogeneous Linear ODE with constant coefficients: The general solution of
is given by , where is the solution of the associated
homogeneous equation and is called the particular integral.

4. Rules for finding particular integral:

 If , then , provided .
 If then provided .
[ ]
 If , then

= , provided

 If , , provided

 If , then [ ] . Expanding the right hand side


as a binomial series, the particular integral can be obtained. The following series
expansions are useful:

 If , then

10
5. Cauchy-Euler equation: The linear ODE of the form
, where are constants, is known as
‘Cauchy-Euler’ or equidimensional equation.
This equation can be reduced to ODE with constant coefficients by changing the independent
variable as follows –

Take , then ,
,

where
6. Wronskian: For two functions and , the Wronkian is defined by
| |

7. Method of Variation of Parameters:


For the second order ODE of the form . Let
be solution of the equation with , the general solution is given by

, where and , and

| |

PARTIAL DIFFERENTIAL EQUATIONS


1. Lagrange’s linear equation: The first order linear partial differential equation of the
form , where , and are functions of is known as
Lagrange’s Linear equation.
2. Subsidiary/Auxiliary Equation: The equation is known as the subsidiary/
auxiliary equation of as Lagrange’s Linear equation .

3. One-Dimensional Wave Equation: , where the phase speed, is


the tension, and density of the string.
4. One-Dimensional Heat Equation: , where the thermal diffusivity,
thermal conductivity, s specific heat and ρ density of the material of the body.
5. Two-Dimensional Laplace equation:

11
NUMERICAL METHODS
1. Forward difference:
 –

2. Backward difference:
 – –

3. Relation between forward and backward difference:
4. , where is a polynomial of
degree .
5. Newton-Gregory Forward Interpolation Formula:
= + ......
where
6. Newton-Gregory Backward Interpolation Formula:
......
where
7. Lagrange’s Interpolation Formula:

8. Numerical Differentiation:
9. ( ) = * +

10. ( ) = * +

11. ( ) * +

12. ( ) = * +

13. ( ) * +

14. ( ) = * +

12
15. ( ) = * +

16. ( ) = * +

17. Regula - Falsi method:

18. Newton Raphson Method:


19. Runge - Kutta fourth order method:

where, , ( ), ( ),

20. Milne’s Predictor Formula:

[ ]

21. Milne’s Corrector Formula:


[ ];

22. Newton – Cote’s Quadrature formula:

( ( ) )

23. Simpson’s 1/3rd rule:

( )

24. Simpson’s 3/8th rule:

( )

25. Weddle’s rule:

13
VECTOR CALCULUS

1. For ⃗ ̂ ̂ ̂ and ⃗⃗ ̂ ̂ ̂
 ⃗ ⃗⃗ | ⃗|| ⃗⃗ | ,
̂ ̂ ̂
 ⃗ ⃗⃗ | ⃗|| ⃗⃗| ̂ | |

2. Vector Differential Operator: ̂ ̂ ̂.

3. Gradient of a scalar point function: ̂ ̂ ̂.

4. Divergence of a vector point function: ⃗ , where ⃗ ̂ ̂ ̂.

̂ ̂ ̂
5. Curl of vector function: ⃗ | |, where ⃗ ̂ ̂ ̂.

6. Laplacian of a scalar field:


7. Cylindrical coordinate system: , ,
8. Spherical coordinate system: ,
9. Expression for gradient:
 In cylindrical polar coordinates:

 In spherical polar coordinates: ̂ ̂ ̂


10. Expression for divergence:
 In cylindrical polar coordinates: ( ⃗) * +,
where ⃗ ̂ ̂ ̂
 In spherical polar coordinates:
( ⃗) * +,

where ⃗ ̂ ̂ ̂
11. Expression for Laplacian:
 In cylindrical polar coordinates:

 In spherical polar coordinates:

14
12. Expression for Curl:
̂ ̂ ̂
 In cylindrical polar coordinates: ⃗ | |,

where ⃗ ̂ ̂ ̂
̂ ̂ ̂
 In spherical polar coordinates: ⃗ | |,

where ⃗ ̂ ̂ ̂
13. Green’s Theorem: If is a closed region in XY-plane, bounded by a simply closed
curve and if and , , are continuous functions at
every point in , then

∮ ∬( )

14. Stokes Theorem: If be an open surface bounded by a simple closed curve and ⃗ be
any vector point function having continuous first order partial derivatives, then

∮⃗ ⃗ ∬ ⃗ ̂ ∬ ⃗ ⃗

where ̂ is the outward drawn unit normal at any point to .


15. Gauss Divergence Theorem: If is the volume bounded by a closed surface and ⃗ is
a vector point function having continuous derivatives, then

∬⃗ ̂ ∭ ⃗

where ̂ is the outward unit normal drawn to .

15
LAPLACE TRANSFORMS
1. Gamma function
 

 

  ( ) √

2. Beta Function
  mn

 m,n

sin m- 

 m,n

3. Laplace transform of : { }
4. Transform of elementary functions:
 ( ) | |

  | |
 
e  as
 [ ] , where is Heaviside unit step function
s
5. Properties of Laplace transform:
 [ ] [ ]
[ ].
1 s
 If [ ] then [ ] F   , where a is a positive constant.
a a
 Let a be any real constant then [ ]
 If [ ]   dn
then L t n f (t )  (1) n n F (s), n  1, 2, 3,...
ds

 f (t ) 
 If [ ] , then L    F ( s)ds.
 t  s
 If [ ] then L{ f (t )}  s L{ f (t )}  s
n n n1
f (0)  s n2 f (0)  .......  f n1 (0)
 If [ ] , then

16
T
1
 ST 
 Let be a periodic function of period then L{ f (t )}  e  st f (t )dt.
1 e 0

 If { } then [ ]
 be a continuous function at , then , where
is unit impulse function.
6. Inverse Laplace transform of using Convolution theorem: If [ ] and
[ ] , then [ ] .

NUMBER THEORY

1. The number of all positive divisors of a, denoted by , where

2. The sum of all positive divisors of a, denoted by ,

( )( ) ( )

3. Euler's theorem: if , then


4. If is a prime number, then
5. If is a prime number and , then
6. If the integer has the prime factorization, , then

( )( ) ( )

7. Cipher text: , where is the message.


8. Decryption: where is the private key.

STATISTICS

1. Moments for ungrouped data:


 The moment about origin: ∑ , where
are observations
 The central moment: ∑ ̄ where = , ̄ is mean
2. Moments for grouped data:
 The moment about origin: ∑ , where observations
are the mid points of the class-intervals and are their
corresponding frequencies and N ∑i
 The central moment: ∑ ̄

17
 The moment about any point A: ∑
3. Relation between raw (Moments about origin or any point) and Central Moments:
 = r
C1 r- + rC2 r- ,r , ,3…
 + rC1 r-
+ rC2 r-

4. Measures of Kurtosis:


5. Measures of Skewness: Karl Pearson’s coefficient of Skewness: , where

6. Fitting of a straight line: for the data


The normal equations for estimating the values of a and are
∑ a ∑ ,
∑ ∑ ∑ .
7. Fitting of a second-degree equation (quadratic):
The normal equations for estimating the values of are
∑ ∑ ∑ ,
∑ ∑ ∑ ∑ ,
∑ ∑ ∑ ∑ .
8. Correlation Coefficient (Karl Pearson correlation coefficient):
∑ ̄ ̄ ∑ ∑ ̅
 , where variance of the series,

variance of the y series,


∑ ∑
 → Mean of the series → mean of the y series.
∑ xy ∑ ∑

√{ ∑ ∑ }{ ∑ ∑ }


9. Regression line of on : ̅ , where ∑
∑ xy ∑ ∑
∑ ∑

10. Regression line of on : where ∑
∑ ∑ ∑
∑ ∑

18

Common questions

Powered by AI

Simpson's 1/3rd rule approximates the integral of a function by using parabolas to model segments of the function, requiring an even number of intervals (or odd number of points). For a given function segment, this rule improves accuracy by providing a cubic approximation rather than the linear approximation used in the trapezoidal rule. It calculates the area under the curve using a weighted sum of function values at endpoints and midpoints, reducing error significantly when estimating definite integrals .

The transformation from Cartesian to polar coordinates involves changing variables from (x, y) to (r, θ). The Jacobian of this transformation is the determinant |J| = r, which accounts for the stretching and compression of the area element when transforming between these coordinate systems. This Jacobian is essential when substituting into a double integral when moving from Cartesian to polar coordinates .

The Wronskian is important because it helps determine whether a set of solutions is linearly independent. It is constructed from a matrix of solution functions and their derivatives. If the Wronskian is non-zero at some point in the interval of interest, the solutions are linearly independent, which means they form a fundamental set of solutions to the differential equation. Linearly independent solutions span the solution space of the differential equation, indicating that all possible solutions can be expressed as linear combinations of them .

Central moments for ungrouped data (∑(xi - x̄)^n) and grouped data (∑fi(xi - x̄)^n) quantify the distribution's deviation from the mean. The second central moment is the variance, which indicates spread. Higher moments relate to shape characteristics: the third indicates skewness, quantifying asymmetries, while the fourth moment (kurtosis) indicates peakedness relative to a normal distribution. Recognizing skewness helps determine whether data lean towards higher or lower values, vital for modeling or hypothesis testing .

Forward and backward difference methods are used to estimate derivatives and interpolate functions at discrete data points. Forward difference allows for approximation using forward points, while backward difference uses backward points. These differences form the foundation for Newton-Gregory forward and backward interpolation formulas, which use polynomial approximations to estimate function values at unknown points, enhancing the analysis of discrete datasets .

Green's Theorem relates a line integral around a simple closed curve C to a double integral over the region D it encloses by converting the circulation around the curve into a sum of curls over the region. The formula ∮C (P dx + Q dy) = ∬D (∂Q/∂x - ∂P/∂y) dA links the line integral of a vector field along a close curve to the double integral of a related scalar field (curl) over the plane. This provides a powerful tool for converting an otherwise challenging line integral into a simpler double integral .

The Cauchy-Euler equation differs from standard linear differential equations because its coefficients are not constant but are instead powers of the independent variable. It has the form x^2y'' + axy' + by = 0. The transformation t = ln(x) is used to convert it into a linear differential equation with constant coefficients by changing variables accordingly: x becomes e^t, transforming the equation into one where typical methods for constant coefficient linear equations apply .

Euler's theorem states that for any integer a where gcd(a, n) = 1, a^(φ(n)) ≡ 1 (mod n), where φ(n) is Euler's totient function. Fermat's theorem, a specific instance, asserts that if p is prime and gcd(a, p) = 1, then a^(p-1) ≡ 1 (mod p). These theorems underpin RSA encryption, where they secure cryptographic keys by ensuring that, given a prime modulus, certain operations over encrypted data will decrypt correctly, keeping the communication secure .

The method of variation of parameters is used to find a particular solution to a non-homogeneous second-order differential equation of the form y'' + p(x)y' + q(x)y = g(x). This method involves constructing a general solution as a linear combination of two linearly independent solutions to the corresponding homogeneous equation, plus a particular solution. The functions multiplying this combination are determined by substituting them into the original equation and solving a system of equations for the unknowns. This method is especially useful when the method of undetermined coefficients fails .

The Laplace transform is significant because it converts differential equations into algebraic equations, making them easier to solve. One key property is the linearity property: L{af(t) + bg(t)} = aL{f(t)} + bL{g(t)}. This property simplifies the process of solving linear combinations of functions. The transform also eases problems with initial conditions by converting differential operators into polynomial multiplication in the 's' domain, immediately incorporating initial values in the resulting algebraic equation .

You might also like