APPENDIX: FORMULAE AND RULES

POINTS AND LINES

MIDPOINT x1 + x2 y1 + y2 DISTANCE (x1  x2)2 + (y1  y2)2
 2 , 2 

SLOPE y2  y1 LINE THROUGH y  y1 = m(x  x1)
x2  x 1 (x1, y1) WITH
SLOPE m
PARALLEL m1 = m2 PERPENDICULAR m1 m2 =  1
LINES LINES

DIFFERENTIATION
SUM RULE d(u + v) du dv DIFFERENCE d(u  v) du dv
dx = dx + dx RULE dx = dx  dx
PRODUCT d(uv) dv du QUOTIENT RULE du dv
=u. + v . v dx  u dx
RULE dx dx dx d(u/v)
dx = v2
CONSTANT d(ku) du POWER RULE dxn
=k = nxn1
FACTOR dx dx dx
RULE
CHAIN dy dy . du INVERSE dx . dy
RULE dx = du dx FUNCTIONS dy dx = 1
d x 1 d(1/x) 1 d(ex) d(log x) 1
=  x2 x
=
dx 2 x dx dx = e dx = x
FUNDAMENTAL df(x) dx x2 x3 x4 xn
 ex = 1 + x + 2! + 3! + 4! + … + n! + …
THEOREM OF = f(x)
CALCULUS dx

INTEGRATION
SUM RULE [f(x) CONSTANT kf(x) dx = kf(x)
 + g(x)] dx =   dx
FACTOR RULE
f(x) dx + 
 g(x) dx

If f(x)
 dx = F(x) f(ax + b) dx = 1 F(ax + b). b
b
 
a a f(x) dx = [F(x)] a = F[b]  F[a]
1 ex x Area between curves:
x n
 dx) = n + 1 x
n+1 1 dx = log x + c  dx = e + c
x b(top y  bottom y)dx
 a
if n  1

173
 STATIONARY POINTS AND OPTIMISATION
dy z z
Optimising y = (x): Put dx = 0. Optimising z = f(x, y): Put = = 0.
x y

LAGRANGE Optimize z = f(x, y) Let F(x, y, ) = f(x, y)  (x, y) and

MULTIPLIERS subject to constraint F F 
(x, y) = 0. = = 0
solve x y 
(x, y) = 0 
FIRST DERIVATIVE TEST SECOND DERIVATIVE TEST
y < 0 y = 0 y > 0
Local MIN Local MAX Local MAX TEST Local MIN
Inflection FAILS

DIFFERENTIAL EQUATIONS
GROWTH/DECAY SECOND ORDER LINEAR
dx d2x dx
dt = kx a dt2 + b dt + cx = 0
SOLN: x = Aekt SOLN: x = Aert + Best where r, s are
where A is an arbitrary constant distinct solutions to a2 + b + c = 0 and
A, B are arbitrary constants.

NUMERICAL METHODS
NEWTON’S METHOD y0
x1 = x0  becomes new x0
to solve y = f(x) = 0 y0
b
y dx using n strips of equal width h
NUMERICAL INTEGRATION 
a
TRAPEZIUM h
RULE 2 [First + Last + 2(Sum of others)].
CUBIC FIT RULE h2 b
TRAPEZIUM RULE + 12 [y] a
SIMPSON’S RULE h
even number of strips 3 [first + last + 2(sum of other evens) + 4(sum of odds)]

174