Arithmetic and Geometric Sequences
Arithmetic sequence
a
n
+
1
-
a
n
=
d
f
u
¨
r
a
l
l
e
n
{\ displaystyle a_ {n + 1} -a_ {n} = d \ quad \ mathrm {f {\ ddot {u}} r \; all \;} n}
a
n
=
1
2
(
a
n
-
1
+
a
n
+
1
)
{\ displaystyle a_ {n} = {\ tfrac {1} {2}} (a_ {n-1} + a_ {n + 1})}
a
n
=
a
1
+
(
n
-
1
)
d
{\ displaystyle \, a_ {n} = a_ {1} + (n-1) d}
Geometric sequence
a
n
+
1
a
n
=
q
f
u
¨
r
a
l
l
e
n
,
q
∈
R.
∖
0
{\ displaystyle {\ frac {a_ {n + 1}} {a_ {n}}} = q \ quad \ mathrm {f {\ ddot {u}} r \; all \;} n, q \ in \ mathbb {R} \ setminus 0}
a
n
=
a
n
-
1
⋅
a
n
+
1
{\ displaystyle a_ {n} = {\ sqrt {a_ {n-1} \ cdot a_ {n + 1}}}}
a
n
=
a
1
⋅
q
n
-
1
{\ displaystyle a_ {n} = a_ {1} \ cdot q ^ {n-1}}
Limit values : definition (consequences)
The sequence is called zero sequence if there is a number for each , so that for all subsequent members with a higher number, the following applies:
(
a
n
)
{\ displaystyle (a_ {n})}
ϵ
>
0
{\ displaystyle \ epsilon> 0}
n
0
{\ displaystyle n_ {0}}
n
>
n
0
{\ displaystyle n> n_ {0}}
|
a
n
|
<
ϵ
{\ displaystyle \, | a_ {n} | <\ epsilon}
A sequence has the limit value a if the sequence has the limit value 0.
(
a
n
)
{\ displaystyle (a_ {n})}
(
a
n
-
a
)
{\ displaystyle (a_ {n} -a)}
Sequences without a limit value are called divergent.
A sequence is called restricted if there is a number such that applies to all .
K
>
0
{\ displaystyle K> 0}
|
f
n
|
<
K
{\ displaystyle | f_ {n} | <K}
n
∈
N
{\ displaystyle n \ in \ mathbb {N}}
Limit sets (consequences)
If the sequence has the limit value a and the sequence has the limit value b, then:
(
a
n
)
{\ displaystyle (a_ {n})}
(
b
n
)
{\ displaystyle (b_ {n})}
lim
n
→
∞
(
a
n
±
b
n
)
=
a
±
b
{\ displaystyle \ lim _ {n \ to \ infty} (a_ {n} \ pm b_ {n}) = a \ pm b}
lim
n
→
∞
(
a
n
⋅
b
n
)
=
a
⋅
b
{\ displaystyle \ lim _ {n \ to \ infty} (a_ {n} \ cdot b_ {n}) = a \ cdot b}
lim
n
→
∞
a
n
b
n
=
a
b
b
≠
0
{\ displaystyle \ lim _ {n \ to \ infty} {\ frac {a_ {n}} {b_ {n}}} = {\ frac {a} {b}} \ qquad b \ not = 0}
Functions (formal properties)
[Definition, properties, limit sets analogous]
Be
f
(
x
)
=
u
(
x
)
v
(
x
)
.
{\ displaystyle f (x) = {\ frac {u (x)} {v (x)}}.}
Requirements:
There is a passage so and are either zero or determined diverge
a
{\ displaystyle a}
u
(
a
)
{\ displaystyle u (a)}
v
(
a
)
{\ displaystyle v (a)}
u
{\ displaystyle u}
and are differentiable in a neighborhood of
v
{\ displaystyle v}
a
{\ displaystyle a}
The limit exists.
lim
x
→
a
u
′
(
x
)
v
′
(
x
)
{\ displaystyle \ lim _ {x \ to a} {\ frac {u '(x)} {v' (x)}}}
Then:
lim
x
→
a
u
(
x
)
v
(
x
)
=
lim
x
→
a
u
′
(
x
)
v
′
(
x
)
{\ displaystyle \ lim _ {x \ to a} {\ frac {u (x)} {v (x)}} = \ lim _ {x \ to a} {\ frac {u '(x)} {v '(x)}}}
Unilateral limits
The function has for the limit when it (however small) to each one are such that for all values from the domain of satisfying the condition , also suffice applies.
f
:
X
→
R.
{\ displaystyle f \ colon X \ to \ mathbb {R} \;}
x
→
p
+
{\ displaystyle x \ to p +}
L.
{\ displaystyle L \;}
ε
>
0
{\ displaystyle \ varepsilon> 0 \;}
δ
>
0
{\ displaystyle \ delta> 0 \;}
x
{\ displaystyle x \;}
X
{\ displaystyle X \;}
f
{\ displaystyle f \;}
0
<
x
-
p
<
δ
{\ displaystyle 0 <xp <\ delta \;}
|
f
(
x
)
-
L.
|
<
ε
{\ displaystyle | f (x) -L | <\ varepsilon \;}
In this case the limit is called convergent .
lim
x
→
p
+
f
(
x
)
: =
L.
{\ displaystyle \ lim _ {x \ to p +} f (x): = L}
A function is called continuous at one point if the limit of for against exists and matches the function value
f
{\ displaystyle f}
x
0
{\ displaystyle x_ {0}}
f
{\ displaystyle f}
x
{\ displaystyle x}
x
0
{\ displaystyle x_ {0}}
f
(
x
0
)
{\ displaystyle f (x_ {0})}
f
(
x
0
)
=
lim
H
→
0
f
(
x
0
+
H
)
=
lim
H
→
0
f
(
x
0
-
H
)
=
lim
x
→
x
0
f
(
x
)
{\ displaystyle f (x_ {0}) = \ lim _ {h \ to 0} f (x_ {0} + h) = \ lim _ {h \ to 0} f (x_ {0} -h) = \ lim _ {x \ to x_ {0}} f (x)}
Epsilon-delta criterion : is continuous at if, at any one exists, such that for all of the following applies: .
f
:
D.
→
R.
{\ displaystyle f \ colon D \ to \ mathbb {R}}
x
0
∈
D.
{\ displaystyle x_ {0} \ in D}
ε
>
0
{\ displaystyle \ varepsilon> 0}
δ
>
0
{\ displaystyle \ delta> 0}
x
∈
D.
{\ displaystyle x \ in D}
|
x
-
x
0
|
<
δ
{\ displaystyle | x-x_ {0} | <\ delta}
|
f
(
x
)
-
f
(
x
0
)
|
<
ε
{\ displaystyle | f (x) -f (x_ {0}) | <\ varepsilon}
Sequence criterion : is continuous in if, for every sequence with elements that converges against , also converges against .
f
:
D.
→
R.
{\ displaystyle f \ colon D \ to \ mathbb {R}}
x
0
∈
D.
{\ displaystyle x_ {0} \ in D}
(
x
k
)
k
∈
N
{\ displaystyle (x_ {k}) _ {k \ in \ mathbb {N}}}
x
k
∈
D.
{\ displaystyle x_ {k} \ in D}
x
0
{\ displaystyle x_ {0}}
f
(
x
k
)
{\ displaystyle f (x_ {k})}
f
(
x
0
)
{\ displaystyle f (x_ {0})}
Basics
Intermediate value theorem
A function continuous in the interval ( ) takes every function value between and at least once.
[
a
,
b
]
{\ displaystyle [a, b]}
a
<
b
{\ displaystyle a <b}
f
{\ displaystyle f}
f
(
a
)
{\ displaystyle f (a)}
f
(
b
)
{\ displaystyle f (b)}
Special case: zero digit rate
A continuous function where and have different signs has at least one zero there.
I.
{\ displaystyle I}
f
(
a
)
{\ displaystyle f (a)}
f
(
b
)
{\ displaystyle f (b)}
Extreme value theorem
A function that is continuous in an interval always has a largest and a smallest function value there.
Mean theorem
Let it be continuous and differentiable on the closed interval ( ). Then there is at least one such that
f
:
[
a
,
b
]
→
R.
{\ displaystyle f: [a, b] \ to \ mathbb {R}}
[
a
,
b
]
{\ displaystyle [a, b]}
a
<
b
{\ displaystyle a <b}
x
0
∈
(
a
,
b
)
{\ displaystyle x_ {0} \ in (a, b)}
f
′
(
x
0
)
=
f
(
b
)
-
f
(
a
)
b
-
a
{\ displaystyle f '\ left (x_ {0} \ right) = {\ frac {f \ left (b \ right) -f \ left (a \ right)} {ba}}}
applies.
Differentiability: Definitions
A function is differentiable at one point in its domain if the limit value
f
{\ displaystyle f}
x
0
{\ displaystyle x_ {0}}
lim
x
→
x
0
f
(
x
)
-
f
(
x
0
)
x
-
x
0
{\ displaystyle \ lim _ {x \ rightarrow x_ {0}} {\ frac {f (x) -f (x_ {0})} {x-x_ {0}}}}
exists. This limit is called the derivative of at that point .
f
{\ displaystyle f}
x
0
{\ displaystyle x_ {0}}
Geometric: tangents
Tangent equation to in the point
f
{\ displaystyle f}
P
(
x
0
|
f
(
x
0
)
)
{\ displaystyle P (x_ {0} | f (x_ {0}))}
y
=
f
′
(
x
0
)
(
x
-
x
0
)
+
f
(
x
0
)
{\ displaystyle y = f '(x_ {0}) \! \, (x-x_ {0}) + f (x_ {0})}
Normal (vertical)
y
=
-
1
f
′
(
x
0
)
(
x
-
x
0
)
+
f
(
x
0
)
{\ displaystyle y = {\ frac {-1} {f '(x_ {0})}} (x-x_ {0}) + f (x_ {0})}
Derivation rules
Constant function
(
a
)
′
=
0
{\ displaystyle \ left (a \ right) '= 0}
Factor rule
(
a
⋅
f
)
′
=
a
⋅
f
′
{\ displaystyle (a \ cdot f) '= a \ cdot f'}
Sum rule
(
G
±
H
)
′
=
G
′
±
H
′
{\ displaystyle \ left (g \ pm h \ right) '= g' \ pm h '}
Product rule
(
G
⋅
H
)
′
=
G
′
⋅
H
+
G
⋅
H
′
{\ displaystyle (g \ cdot h) '= g' \ cdot h + g \ cdot h '}
Quotient rule
(
G
H
)
′
=
G
′
⋅
H
-
G
⋅
H
′
H
2
{\ displaystyle \ left ({\ frac {g} {h}} \ right) '= {\ frac {g' \ cdot hg \ cdot h '} {h ^ {2}}}}
Power rule
(
x
n
)
′
=
n
x
n
-
1
{\ displaystyle \ left (x ^ {n} \ right) '= nx ^ {n-1}}
Chain rule
(
G
∘
H
)
′
(
x
)
=
(
G
(
H
(
x
)
)
)
′
=
G
′
(
H
(
x
)
)
⋅
H
′
(
x
)
{\ displaystyle (g \ circ h) '(x) = (g (h (x)))' = g '(h (x)) \ cdot h' (x)}
Derivation of the power function
f
(
x
)
=
G
(
x
)
H
(
x
)
{\ displaystyle f (x) = g (x) ^ {h (x)}}
f
′
(
x
)
=
(
H
′
(
x
)
ln
(
G
(
x
)
)
+
H
(
x
)
G
′
(
x
)
G
(
x
)
)
G
(
x
)
H
(
x
)
{\ displaystyle f '(x) = \ left (h' (x) \ ln (g (x)) + h (x) {\ frac {g '(x)} {g (x)}} \ right) g (x) ^ {h (x)}}
.
Leibniz rule
The derivation of -th order for a product of two -fold differentiable functions and results from
n
{\ displaystyle n}
n
{\ displaystyle n}
f
{\ displaystyle f}
G
{\ displaystyle g}
(
f
G
)
(
n
)
=
∑
k
=
0
n
(
n
k
)
f
(
k
)
G
(
n
-
k
)
{\ displaystyle (fg) ^ {(n)} = \ sum _ {k = 0} ^ {n} {n \ choose k} f ^ {(k)} g ^ {(nk)}}
.
The expressions of the form appearing here are binomial coefficients .
(
n
k
)
{\ displaystyle {\ tbinom {n} {k}}}
Formula by Faà di Bruno
This formula enables the closed representation of the -th derivative of the composition of two -fold differentiable functions. It generalizes the chain rule to higher derivatives.
n
{\ displaystyle n}
n
{\ displaystyle n}
Deriving important functions
see table of derivative and antiderivative functions
Geometrical applications: properties of curves ( curve discussion )
Is looked at
f
:
x
↦
f
(
x
)
{\ displaystyle f \ colon x \ mapsto f (x)}
Investigation aspect
criteria
Zero
f
(
x
N
)
=
0
{\ displaystyle f (x_ {N}) = 0 \,}
Extreme value
f
′
(
x
E.
)
=
0
and
f
″
(
x
E.
)
≠
0
{\ displaystyle f '(x_ {E}) = 0 \ quad {\ text {and}} \ quad f' '(x_ {E}) \ neq 0}
minimum
f
′
(
x
E.
)
=
0
and
f
″
(
x
E.
)
>
0
{\ displaystyle f '(x_ {E}) = 0 \ quad {\ text {and}} \ quad f' '(x_ {E})> 0}
maximum
f
′
(
x
E.
)
=
0
and
f
″
(
x
E.
)
<
0
{\ displaystyle f '(x_ {E}) = 0 \ quad {\ text {and}} \ quad f' '(x_ {E}) <0}
Turning point
f
″
(
x
W.
)
=
0
and
f
‴
(
x
W.
)
≠
0
{\ displaystyle f '' (x_ {W}) = 0 \ quad {\ text {and}} \ quad f '' '(x_ {W}) \ neq 0}
Saddle point
f
′
(
x
W.
)
=
0
and
f
″
(
x
W.
)
=
0
and
f
‴
(
x
W.
)
≠
0
{\ displaystyle f '(x_ {W}) = 0 \ quad {\ text {and}} \ quad f' '(x_ {W}) = 0 \ quad {\ text {and}} \ quad f' '' (x_ {W}) \ neq 0}
Behavior in infinity
lim
x
→
∞
f
(
x
)
and
lim
x
→
-
∞
f
(
x
)
{\ displaystyle \ lim _ {x \ to \ infty} f (x) \ quad {\ text {and}} \ quad \ lim _ {x \ to - \ infty} f (x)}
symmetry
Axis symmetry to the coordinate axis ("straight")
f
(
x
)
=
f
(
-
x
)
{\ displaystyle f (x) = f (-x) \,}
Point symmetry to the origin of coordinates ("odd")
-
f
(
x
)
=
f
(
-
x
)
{\ displaystyle -f (x) = f (-x) \,}
monotony
monotonically increasing or strictly monotonically increasing
f
′
(
x
)
≥
0
or.
f
′
(
x
)
>
0
{\ displaystyle f '(x) \ geq 0 \ quad {\ text {or}} \ quad f' (x)> 0 \,}
falling monotonically or strictly falling monotonically
f
′
(
x
)
≤
0
and
f
′
(
x
)
<
0
{\ displaystyle f '(x) \ leq 0 \ quad {\ text {and}} \ quad f' (x) <0}
curvature
Left curve / convex arch (open at the top)
f
″
(
x
)
≥
0
{\ displaystyle f '' (x) \ geq 0 \,}
Right curve / concave arch (open at the bottom)
f
″
(
x
)
≤
0
{\ displaystyle f '' (x) \ leq 0 \,}
periodicity
f
(
x
+
p
)
=
f
(
x
)
{\ displaystyle f (x + p) = f (x) \,}
Function term:
f
(
x
)
=
a
z
x
z
+
a
z
-
1
x
z
-
1
+
⋯
+
a
1
x
+
a
0
b
n
x
n
+
b
n
-
1
x
n
-
1
+
⋯
+
b
1
x
+
b
0
=
P
z
(
x
)
Q
n
(
x
)
{\ displaystyle f (x) = {\ frac {a_ {z} x ^ {z} + a_ {z-1} x ^ {z-1} + \ cdots + a_ {1} x + a_ {0}} {b_ {n} x ^ {n} + b_ {n-1} x ^ {n-1} + \ cdots + b_ {1} x + b_ {0}}} = {\ frac {P_ {z} ( x)} {Q_ {n} (x)}}}
Classification
If the denominator polynomial is of degree 0 (i.e. n = 0 and b 0 ≠ 0) and is not the zero polynomial , one speaks of an entirely rational or a polynomial function .
Q
n
{\ displaystyle Q_ {n}}
P
z
{\ displaystyle P_ {z}}
If n > 0, it is a fractional-rational function .
If n > 0 and z < n , then it is a really fractional-rational function .
If n > 0 and z ≥ n , then it is an incorrect fractional rational function . It can be divided into a fully rational function and a truly fractional-rational function using polynomial division .
Domain of definition
D.
=
R.
∖
{
x
0
∣
Q
n
(
x
0
)
=
0
}
{\ displaystyle \ mathbb {D} = \ mathbb {R} \ setminus \ lbrace x_ {0} \ mid Q_ {n} (x_ {0}) = 0 \ rbrace}
Asymptotic behavior: For strives
x
→
∞
{\ displaystyle x \ to \ infty}
f
(
x
)
{\ displaystyle f (x)}
[if ] against , where so-called denotes the sign function.
z
>
n
{\ displaystyle z> n}
so-called
(
a
z
)
⋅
so-called
(
b
n
)
⋅
∞
{\ displaystyle \ operatorname {sgn} (a_ {z}) \ cdot \ operatorname {sgn} (b_ {n}) \ cdot \ infty}
[if ] against
z
=
n
{\ displaystyle z = n}
a
z
b
n
{\ displaystyle {\ tfrac {a_ {z}} {b_ {n}}}}
[if ] against 0 (the x-axis)
z
<
n
{\ displaystyle z <n}
symmetry
If and are both even or both odd, then is even (symmetrical to the y-axis).
P
z
{\ displaystyle P_ {z}}
Q
n
{\ displaystyle Q_ {n}}
f
{\ displaystyle f}
Is even and odd, then is odd (point symmetrical to the origin); The same applies when is odd and even.
P
z
{\ displaystyle P_ {z}}
Q
n
{\ displaystyle Q_ {n}}
f
{\ displaystyle f}
P
z
{\ displaystyle P_ {z}}
Q
n
{\ displaystyle Q_ {n}}
Pole: means pole of , if
x
p
{\ displaystyle x_ {p}}
f
{\ displaystyle f}
Q
n
(
x
p
)
=
0
and
P
z
(
x
p
)
≠
0.
{\ displaystyle Q_ {n} (x_ {p}) = 0 \ quad {\ text {and}} \ quad P_ {z} (x_ {p}) \ neq 0.}
Asymptotes: Using polynomial division of by one obtains with polynomials and , where the degree of is smaller than that of . The asymptotic behavior of is thus determined by the completely rational function :
p
{\ displaystyle p}
q
{\ displaystyle q}
p
=
G
⋅
q
+
r
{\ displaystyle p = g \ cdot q + r}
G
{\ displaystyle g}
r
{\ displaystyle r}
r
{\ displaystyle r}
q
{\ displaystyle q}
f
=
p
q
=
G
+
r
q
{\ displaystyle f = {\ tfrac {p} {q}} = g + {\ tfrac {r} {q}}}
G
{\ displaystyle g}
[
z
<
n
]
{\ displaystyle [z <n] \,}
x-axis is asymptote:
G
(
x
)
=
0
{\ displaystyle g (x) = 0}
[
z
=
n
]
{\ displaystyle [z = n] \,}
horizontal asymptote:
G
(
x
)
=
a
z
b
n
{\ displaystyle g (x) = {\ frac {a_ {z}} {b_ {n}}}}
[
z
=
n
+
1
]
{\ displaystyle [z = n + 1] \,}
oblique asymptote:
G
(
x
)
=
m
x
+
c
;
m
≠
0
{\ displaystyle g (x) = mx + c \ ,; m \ neq 0}
[
z
>
n
+
1
]
{\ displaystyle [z> n + 1] \,}
completely rational approximation function
Area calculation
The area between the x-axis and the graph of the function f (x) in the interval from a to b is
∫
a
b
f
(
x
)
d
x
,
if
f
(
x
)
≥
0
∀
x
∈
[
a
,
b
]
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x, \ qquad {\ text {if}} f (x) \ geq 0 \ forall x \ in [a, b] }
-
∫
a
b
f
(
x
)
d
x
,
if
f
(
x
)
≤
0
∀
x
∈
[
a
,
b
]
{\ displaystyle - \ int _ {a} ^ {b} f (x) \ mathrm {d} x, \ qquad {\ text {if}} f (x) \ leq 0 \ forall x \ in [a, b ]}
Otherwise the interval must be broken down into such sub-intervals by determining the zeros.
Properties of the definite integral
∫
a
b
f
(
x
)
d
x
=
-
∫
b
a
f
(
x
)
d
x
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x = - \ int _ {b} ^ {a} f (x) \ mathrm {d} x}
∫
a
a
f
(
x
)
d
x
=
0
{\ displaystyle \ int _ {a} ^ {a} f (x) \ mathrm {d} x = 0}
∫
a
c
f
(
x
)
d
x
=
∫
a
b
f
(
x
)
d
x
+
∫
b
c
f
(
x
)
d
x
,
a
<
b
<
c
{\ displaystyle \ int _ {a} ^ {c} f (x) \ mathrm {d} x = \ int _ {a} ^ {b} f (x) \ mathrm {d} x + \ int _ {b} ^ {c} f (x) \ mathrm {d} x, \ qquad a <b <c}
∫
a
b
k
⋅
f
(
x
)
d
x
=
k
⋅
∫
a
b
f
(
x
)
d
x
{\ displaystyle \ int _ {a} ^ {b} k \ cdot f (x) \ mathrm {d} x = k \ cdot \ int _ {a} ^ {b} f (x) \ mathrm {d} x }
∫
a
b
(
f
(
x
)
+
G
(
x
)
)
d
x
=
∫
a
b
f
(
x
)
d
x
+
∫
a
b
G
(
x
)
d
x
{\ displaystyle \ int _ {a} ^ {b} (f (x) + g (x)) \, \ mathrm {d} x = \ int _ {a} ^ {b} f (x) \ mathrm { d} x + \ int _ {a} ^ {b} g (x) \ mathrm {d} x}
Integral function
F.
a
(
x
)
=
∫
a
x
f
(
t
)
d
t
{\ displaystyle F_ {a} (x) = \ int \ limits _ {a} ^ {x} f (t) \ mathrm {d} t}
Law of infinitesimal calculus
F.
a
(
x
)
′
=
f
(
x
)
{\ displaystyle F_ {a} (x) '= f (x) \,}
Indefinite integral
Every function is called an antiderivative of if holds for all x of the domain
F.
{\ displaystyle F}
f
{\ displaystyle f}
F.
′
(
x
)
=
f
(
x
)
{\ displaystyle F '(x) = f (x) \,}
This is what the expression means
∫
f
(
x
)
d
x
{\ displaystyle \ int f (x) \ mathrm {d} x}
integration
If F is any antiderivative of f , then we have
∫
a
b
f
(
x
)
d
x
=
F.
(
b
)
-
F.
(
a
)
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x = F (b) -F (a)}
Special antiderivatives
The antiderivatives of are
f
(
x
)
=
x
n
{\ displaystyle f (x) = x ^ {n}}
F.
(
x
)
=
x
n
+
1
n
+
1
+
c
,
n
≠
-
1
{\ displaystyle F (x) = {\ frac {x ^ {n + 1}} {n + 1}} + c, \ qquad n \ not = -1}
For everything else, see the table of derivative and antiderivatives
Integration methods
Product, partial or partial integration
indefinite
∫
f
(
x
)
G
′
(
x
)
d
x
=
f
(
x
)
⋅
G
(
x
)
-
∫
f
′
(
x
)
⋅
G
(
x
)
d
x
{\ displaystyle \ int f (x) g '(x) \ mathrm {d} x = f (x) \ cdot g (x) - \ int f' (x) \ cdot g (x) \ mathrm {d} x}
∫
f
(
x
)
⋅
G
(
x
)
d
x
=
f
(
x
)
⋅
G
(
x
)
-
∫
f
′
(
x
)
⋅
G
(
x
)
d
x
{\ displaystyle \ int f (x) \ cdot g (x) \ mathrm {d} x = f (x) \ cdot G (x) - \ int f '(x) \ cdot G (x) \ mathrm {d } x}
certainly
∫
a
b
f
(
x
)
⋅
G
′
(
x
)
d
x
=
[
f
(
x
)
⋅
G
(
x
)
]
a
b
-
∫
a
b
f
′
(
x
)
⋅
G
(
x
)
d
x
{\ displaystyle \ int _ {a} ^ {b} f (x) \ cdot g '(x) \ mathrm {d} x = [f (x) \ cdot g (x)] _ {a} ^ {b } - \ int _ {a} ^ {b} f '(x) \ cdot g (x) \ mathrm {d} x}
Integration through substitution
indefinite
∫
f
(
x
)
d
x
=
∫
f
(
φ
(
t
)
)
φ
′
(
t
)
d
t
{\ displaystyle \ int f (x) \ mathrm {d} x = \ int f (\ varphi (t)) \ varphi '(t) \ mathrm {d} t}
certainly
∫
a
b
f
(
φ
(
t
)
)
⋅
φ
′
(
t
)
d
t
=
∫
φ
(
a
)
φ
(
b
)
f
(
x
)
d
x
{\ displaystyle \ int _ {a} ^ {b} f (\ varphi (t)) \ cdot \ varphi '(t) \ mathrm {d} t = \ int _ {\ varphi (a)} ^ {\ varphi (b)} f (x) \ mathrm {d} x}
Special case: linear substitution
∫
f
(
m
x
+
n
)
d
x
=
1
m
F.
(
m
x
+
n
)
+
C.
,
m
≠
0
{\ displaystyle \ int f (mx + n) \ mathrm {d} x = {\ frac {1} {m}} F (mx + n) + C, \ qquad m \ neq 0}
∫
a
b
f
(
m
x
+
n
)
d
x
=
1
m
[
F.
(
m
x
+
n
)
]
a
b
,
m
≠
0
{\ displaystyle \ int _ {a} ^ {b} f (mx + n) \ mathrm {d} x = {\ frac {1} {m}} \ lbrack F (mx + n) \ rbrack _ {a} ^ {b}, \ qquad m \ neq 0}
Special case: logarithmic integration
∫
f
′
(
x
)
f
(
x
)
d
x
=
ln
|
f
(
x
)
|
+
C.
,
f
(
x
)
≠
0
{\ displaystyle \ int {\ frac {f '(x)} {f (x)}} \ mathrm {d} x = \ ln | f (x) | + C, \ qquad f (x) \ neq 0}
Applied
Volume determination
Volume of the body with rotation of the area between the graph of f and the x-axis in the interval [a, b]
π
⋅
∫
a
b
f
2
(
x
)
d
x
{\ displaystyle \ pi \ cdot \ int _ {a} ^ {b} f ^ {2} (x) \ mathrm {d} x}
Volume of the body with rotation of the area between the graph of the reversible function f and the y-axis in the interval [a, b]
π
⋅
∫
f
(
a
)
f
(
b
)
(
f
-
1
(
y
)
)
2
d
y
{\ displaystyle \ pi \ cdot \ int _ {f (a)} ^ {f (b)} (f ^ {- 1} (y)) ^ {2} \ mathrm {d} y}
Volume of the body, which arises from the y-rotation of the area, which is limited
by the graph of the function f in the interval [a, b], the x-axis and the two straight lines and
x
=
a
{\ displaystyle x = a}
x
=
b
{\ displaystyle x = b}
2
π
⋅
∫
a
b
(
x
⋅
f
(
x
)
)
d
x
{\ displaystyle 2 \ pi \ cdot \ int _ {a} ^ {b} (x \ cdot f (x)) \ mathrm {d} x}
M.
{\ displaystyle M}
Surface area
V
{\ displaystyle V}
volume
L.
{\ displaystyle L}
Length of the generating line (profile line)
A.
{\ displaystyle A}
Area of the generating area
R.
{\ displaystyle R}
Radius of the center of gravity
First rule
M.
=
L.
⋅
2
π
R.
{\ displaystyle M = L \ cdot 2 \ pi R}
Expressed as a function of the function f (x) of the generating line, this results as:
with rotation around the x-axis
M.
=
2
π
∫
a
b
f
(
x
)
1
+
[
f
′
(
x
)
]
2
d
x
.
{\ displaystyle M = 2 \ pi \ int _ {a} ^ {b} f (x) {\ sqrt {1+ \ left [f '(x) \ right] ^ {2}}} \ mathrm {d} x.}
with rotation around the y-axis
M.
=
2
π
∫
min
(
f
(
a
)
,
f
(
b
)
)
Max
(
f
(
a
)
,
f
(
b
)
)
f
-
1
(
y
)
1
+
[
(
f
-
1
(
y
)
)
′
]
2
d
y
.
{\ displaystyle M = 2 \ pi \ int _ {\ min (f (a), f (b))} ^ {\ max (f (a), f (b))} f ^ {- 1} (y ) {\ sqrt {1+ \ left [\ left (f ^ {- 1} (y) \ right) '\ right] ^ {2}}} \ mathrm {d} y.}
Second rule
V
=
A.
⋅
2
π
R.
.
{\ displaystyle V = A \ cdot 2 \ pi R.}
In the case of rotation around the x-axis of a surface between , the x-axis and the limits and the volume is expressed by using as the centroid
f
(
x
)
{\ displaystyle f (x)}
x
=
a
{\ displaystyle x = a}
x
=
b
{\ displaystyle x = b}
f
(
x
)
{\ displaystyle f (x)}
R.
{\ displaystyle R}
V
=
A.
⋅
2
π
1
A.
∫
A.
y
d
A.
=
π
⋅
∫
a
b
(
f
(
x
)
)
2
d
x
{\ displaystyle V = A \ cdot 2 \ pi {\ tfrac {1} {A}} \ int _ {A} y \ mathrm {d} A = \ pi \ cdot \ int _ {a} ^ {b} ( f (x)) ^ {2} \ mathrm {d} x}
with and
y
=
f
(
x
)
2
{\ displaystyle y = {\ tfrac {f (x)} {2}}}
d
A.
=
f
(
x
)
d
x
.
{\ displaystyle \ mathrm {d} A = f (x) \ mathrm {d} x.}
additional
If f is continuous on [a, b], then the mean value of the function values of f is called
m
¯
{\ displaystyle {\ bar {m}}}
[
a
,
b
]
{\ displaystyle [a, b]}
m
¯
=
1
b
-
a
⋅
∫
a
b
f
(
x
)
d
x
{\ displaystyle {\ bar {m}} = {\ frac {1} {ba}} \ cdot \ int _ {a} ^ {b} f (x) \ mathrm {d} x}
Length of the arc of the differentiable function f in the interval [a, b]:
L.
=
∫
a
b
1
+
[
f
′
(
x
)
]
2
d
x
{\ displaystyle L = \ int _ {a} ^ {b} {\ sqrt {1+ [f '(x)] ^ {2}}} \ mathrm {d} x}
Calculating integrals as an approximation: Numerical integration
Breakdown sums
∫
a
b
f
(
x
)
d
x
≈
H
f
(
x
1
)
+
H
f
(
x
2
)
+
⋯
+
H
f
(
x
n
)
With
H
=
b
-
a
n
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx hf (x_ {1}) + hf (x_ {2}) + \ cdots + hf (x_ {n} ) \ qquad {\ text {with}} h = {\ frac {ba} {n}}}
Kepler's barrel rule
∫
a
b
f
(
x
)
d
x
≈
1
6th
⋅
(
f
(
a
)
+
4th
⋅
f
(
a
+
b
2
)
+
f
(
b
)
)
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx {\ frac {1} {6}} \ cdot \ left (f (a) +4 \ cdot f \ left ({\ frac {a + b} {2}} \ right) + f (b) \ right)}
Trapezoidal rule
∫
a
b
f
(
x
)
d
x
≈
f
(
b
)
+
f
(
a
)
2
⋅
(
b
-
a
)
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx {\ frac {f (b) + f (a)} {2}} \ cdot (ba)}
∫
a
b
f
(
x
)
d
x
≈
b
-
a
2
n
(
f
(
x
0
)
+
2
f
(
x
1
)
+
⋯
+
2
f
(
x
n
-
1
+
f
(
x
n
)
)
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx {\ frac {ba} {2n}} \ left (f (x_ {0}) + 2f (x_ { 1}) + \ cdots + 2f (x_ {n-1} + f (x_ {n}) \ right)}
∫
a
b
f
(
x
)
d
x
≈
b
-
a
2
⋅
b
-
a
2
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx {\ frac {ba} {2}} \ cdot {\ frac {ba} {2}}}
Simpson's rule
∫
a
b
f
(
x
)
d
x
≈
b
-
a
6th
⋅
(
f
(
a
)
+
4th
f
(
a
+
b
2
)
+
f
(
b
)
)
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx {\ frac {ba} {6}} \ cdot \ left (f (a) + 4f \ left ({ \ frac {a + b} {2}} \ right) + f (b) \ right)}
∫
a
b
f
(
x
)
d
x
≈
b
-
a
6th
n
⋅
(
f
(
x
0
)
+
4th
f
(
x
1
)
+
2
f
(
x
2
)
+
4th
f
(
x
3
)
+
2
f
(
x
4th
)
+
⋯
f
(
x
n
)
)
{\ displaystyle \ int _ {a} ^ {b} f (x) \ mathrm {d} x \ approx {\ frac {ba} {6n}} \ cdot \ left (f (x_ {0}) + 4f ( x_ {1}) + 2f (x_ {2}) + 4f (x_ {3}) + 2f (x_ {4}) + \ cdots f (x_ {n}) \ right)}
swell
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">