Cong Thuc Mae101

SUMMARY
1. Even function: f(-x)=f(x);

Old function: f(-x)=-f(x)
2. Line y=ax+b (a: the slope of the line)
Two lines are parallel (their slopes are equal)
Two lines are orthogonal/perpendicular (the product of their

slopes is -1)
3. Transformations of functions:
 The graph y = f(x) + c (c>0) is obtained by shifting the graph y = f(x) c units upward.
 The graph y = f(x) – c (c>0) is obtained by shifting the graph y = f(x) c units downward.
 The graph y = f(x - c) (c>0) is obtained by shifting the graph y = f(x) c units to the right.
 The graph y = f(x + c) (c>0) is obtained by shifting the graph y = f(x) c units to the left.
 The graph y = cf(x) (c>1) is obtained by stretching the graph y = f(x) vertically by a factor of c.
 The graph y=cf(x) (0<c<1) is obtained by compressing the graph y = f(x) vertically by a factor of
c.
 The graph y = f(cx) (c > 1) is obtained by compressing the graph y = f(x) horizontally by a factor
of c.
 The graph y=f(cx) (0 < c < 1) is obtained by stretching the graph of y = f(x) horizontally by a
factor of c.
 The graph y = -f(x) is obtained by reflecting the graph of y = f(x) about the x-axis.
 The graph y = f(-x) is obtained by reflecting the graph of y = f(x) about the y-axis.
4. Limit
A function f is continuous at a number a if lim f ( x)  f ( a)

x a
exists (giới hạn trái=giới hạn phải)
5. has a vertical asymptote at if or .

has a vertical asymptote at if .
has a horizontal asymptote at if or
6. Limit laws
1.lim  f ( x)  g ( x)  lim f ( x)  lim g ( x) f ( x) lim f ( x)

x a x a x a
5.lim  xa if lim g ( x)  0
xa g ( x) lim g ( x) x a
xa
3.lim cf ( x)  c lim f ( x)
x a x a n
6.lim  f ( x)   lim f ( x) 
n
4.lim  f ( x) g ( x)  lim f ( x)  lim g ( x) x a  x a 

x a x a x a
7. Differentiation rule
8. The equation of tangent line of graph at point is

( is the slope of the tangent)
The equation of normal line of graph at point is
9. Estimate the value of a function at a point:
Linear approximation of at is (linear approximation
is the tangent line)
10. A function f has a local maximum (or relative maximum) at c if f(c) ≥ f(x) when x is near c.
Similarly, f has a local minimum ( or relative minimum) at c if f(c) ≤ f(x) when x is near c.
11. c is called a critical point of if or is undefined.
12. Mean value theorem: If f is continuous on the closed interval [a, b] and f is differentiable on the
open interval (a, b), then there is a number c in (a, b) such that
f (b)  f (a)
f '(c) 
ba
13. Suppose f” is continuous near c. If f’(c) = 0 and f”(c) > 0, then f has a local minimum at c.
If f’(c) = 0 and f”(c) < 0, then f has a local maximum at c.
14. has an inflection point at if and change signs at
15. Newton’s method to approximate the solution of :
f ( xn )
xn 1  xn 
f '( xn )
16. Integration rules
17. Mean value theorem for integrals (Average value of a function)

If f is continuous on [a, b], then there exists a number c in [a, b] such that
1 b
b  a a
f (c)  f ave  f ( x) dx
18. Integration by part
 f ( x) g '( x) dx  f ( x) g ( x)   g ( x) f '( x) dx
19. Numerical integration: From a to b divide n parts:
Left endpoint method: b
 f ( x)dx  x[ f ( x )  f ( x )  ...  f ( x

a
0 1 n 1 )]
Right endpoint method: b
 f ( x)dx  x[ f ( x )  f ( x )  ...  f ( x )]

a
1 2 n
Midpoint method:
b
 f ( x)dx  x[ f ( x )  f ( x
a
1 2 )  ...  f ( x n )]
Trapezoidal method:
x
∫  [ f ( x0 )  2 f ( x1 )  ...  2 f ( xn 1 )  f ( xn )]
2
Simpson’s method:
x x
b
 f ( x)dx 
a
3
[ f ( x0 )  4 f ( x1 )  f ( x2 )]  ...  [ f ( xn  2 )  4 f ( xn 1 )  f ( xn )]
3
20. Matrix
If then A is symmetric.
If AB=BA then we say A commutes with B and B commutes with A.
Let A be a square matrix. Then A is invertible .
Interchange two rows or interchange two columns, detA changes sign.
Multiply one row (or column) by a nonzero number k, detA is increased by k times.
Add a multiple of one row (or column) to another row (or column), detA doesn’t change.
If A is an invertible matrix then
Theorem: Suppose a system of m equations in n variables AX=B is consistent, and the rank of the
augmented matrix is r.
1. The set of solutions involves exactly n-r parameters.
2. If r < n, the system has infinitely many solutions.
3. If r = n, the system has a unique solution.
Theorem: For homogenous systems: AX=0
1. Every homogeneous system has at least one solution (0,0,…,0), called trivial solution (nghiệm tầm
thường)
2. If a homogeneous system of linear equations has nontrivial solution (nghiệm không tầm thường) then
it has infinite family of solutions (vô số nghiệm)
3. If a homogeneous system of linear equations has more variables than equations, then it has infinitely
many nontrivial solutions.
Theorem: Assume that A is an matrix. Then
A is invertible
A can be carried to by elementary row operations.
The homogeneous system AX=0 has only the trivial solution X=0.
The system AX=B has unique solution for every choice of column B.
21. Vector
Equation for the line passing through the point and parallel to the vector ⃗ is
Equation for the plane passing through the point and orthogonal to vector ⃗⃗ is
Projection of ⃗⃗ into ⃗ :
Note: Subspaces of are lines passing through the origin or planes passing through the origin.

Cong Thuc Mae101

Uploaded by

Copyright:

Available Formats

Cong Thuc Mae101

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cong Thuc Mae101

Uploaded by

Copyright:

Available Formats

SUMMARY

1. Even function: f(-x)=f(x);

Two lines are parallel (their slopes are equal)

Two lines are orthogonal/perpendicular (the product of their

A function f is continuous at a number a if lim f ( x)  f ( a)

exists (giới hạn trái=giới hạn phải)

5. has a vertical asymptote at if or .

1.lim  f ( x)  g ( x)  lim f ( x)  lim g ( x) f ( x) lim f ( x)

4.lim  f ( x) g ( x)  lim f ( x)  lim g ( x) x a  x a 

8. The equation of tangent line of graph at point is

16. Integration rules

17. Mean value theorem for integrals (Average value of a function)

Left endpoint method: b

 f ( x)dx  x[ f ( x )  f ( x )  ...  f ( x

Right endpoint method: b

 f ( x)dx  x[ f ( x )  f ( x )  ...  f ( x )]

Let A be a square matrix. Then A is invertible .

Interchange two rows or interchange two columns, detA changes sign.

1. The set of solutions involves exactly n-r parameters.

2. If r < n, the system has infinitely many solutions.

3. If r = n, the system has a unique solution.

Theorem: For homogenous systems: AX=0

Theorem: Assume that A is an matrix. Then

A can be carried to by elementary row operations.

You might also like