The criterion of Bertrand or Bertrand's criterion is a mathematical convergence criterion for determining the ( absolute ) convergence and divergence of infinite series , which according to the French mathematician Joseph Bertrand is named (1822-1900).
formulation
Let be a positive real sequence and its series. The result with:
(
a
n
)
n
∈
N
∈
R.
+
N
{\ displaystyle (a_ {n}) _ {n \ in \ mathbb {N}} \ in \ mathbb {R} _ {+} ^ {\ mathbb {N}}}
A.
: =
∑
n
=
1
∞
a
n
{\ displaystyle \ textstyle A: = \ sum _ {n = 1} ^ {\ infty} a_ {n}}
(
B.
n
)
n
∈
N
∈
R.
N
{\ displaystyle (B_ {n}) _ {n \ in \ mathbb {N}} \ in \ mathbb {R} ^ {\ mathbb {N}}}
B.
n
: =
ln
(
n
)
(
n
(
a
n
a
n
+
1
-
1
)
-
1
)
{\ displaystyle B_ {n}: = \ ln (n) \ left (n \ left ({\ frac {a_ {n}} {a_ {n + 1}}} - 1 \ right) -1 \ right)}
have the finite or infinite (or improper) limit value :
B.
∈
R.
¯
=
R.
∪
{
-
∞
,
+
∞
}
{\ displaystyle B \ in {\ overline {\ mathbb {R}}} = \ mathbb {R} \ cup \ {- \ infty, + \ infty \}}
B.
: =
lim
n
→
∞
B.
n
{\ displaystyle B: = \ lim \ limits _ {n \ to \ infty} B_ {n}}
.
Then applies to the series: is
.
A.
{\ displaystyle A}
{
convergent if
B.
>
1
divergent if
B.
<
1
{\ displaystyle {\ begin {cases} {\ text {convergent, if}} & B> 1 \\ {\ text {divergent, if}} & B <1 \ end {cases}}}
proof
Be with . The series diverges due to the integral criterion . If we set , then applies and is monotonically decreasing and for and . Furthermore:
c
n
: =
n
ln
(
n
)
{\ displaystyle c_ {n}: = n \ ln (n)}
n
∈
N
≧
2
{\ displaystyle n \ in \ mathbb {N} _ {\ geqq 2}}
∑
n
=
2
∞
1
c
n
{\ displaystyle \ sum _ {n = 2} ^ {\ infty} {\ frac {1} {c_ {n}}}}
f
(
x
)
: =
1
x
ln
(
x
)
{\ displaystyle f (x): = {\ frac {1} {x \ ln (x)}}}
1
c
n
=
f
(
n
)
{\ displaystyle {\ frac {1} {c_ {n}}} = f (n)}
f
(
x
)
{\ displaystyle f (x)}
f
(
x
)
→
0
{\ displaystyle f (x) \ to 0}
x
→
∞
{\ displaystyle x \ to \ infty}
x
≧
2
{\ displaystyle x \ geqq 2}
∫
2
R.
1
x
ln
(
x
)
d
x
=
∫
2
R.
d
d
x
ln
(
x
)
ln
(
x
)
d
x
=
ln
(
ln
(
R.
)
)
-
ln
(
ln
(
2
)
)
→
R.
→
∞
∞
{\ displaystyle \ int _ {2} ^ {R} {\ frac {1} {x \ ln (x)}} \ mathrm {d} x = \ int _ {2} ^ {R} {\ frac {{ \ frac {\ mathrm {d}} {\ mathrm {d} x}} \ ln (x)} {\ ln (x)}} \ mathrm {d} x = \ ln (\ ln (R)) - \ ln (\ ln (2)) {\ xrightarrow {R \ to \ infty}} \ infty}
.
Now put:
K
n
: =
c
n
a
n
a
n
+
1
-
c
n
+
1
=
n
ln
(
n
)
a
n
a
n
+
1
-
(
n
+
1
)
ln
(
n
+
1
)
=
n
ln
(
n
)
a
n
a
n
+
1
-
n
ln
(
n
+
1
)
-
ln
(
n
+
1
)
=
n
ln
(
n
)
a
n
a
n
+
1
-
n
(
ln
(
1
+
1
n
)
+
ln
(
n
)
)
-
(
ln
(
1
+
1
n
)
+
ln
(
n
)
)
=
n
ln
(
n
)
a
n
a
n
+
1
-
(
n
+
1
)
ln
(
1
+
1
n
)
-
n
ln
(
n
)
-
ln
(
n
)
=
ln
(
n
)
(
n
a
n
a
n
+
1
-
n
-
1
)
-
ln
(
1
+
1
n
)
n
+
1
=
ln
(
n
)
(
n
(
a
n
a
n
+
1
-
1
)
-
1
)
-
ln
(
1
+
1
n
)
n
+
1
=
B.
n
-
ln
(
1
+
1
n
)
n
+
1
{\ displaystyle {\ begin {aligned} K_ {n} &: = c_ {n} {\ frac {a_ {n}} {a_ {n + 1}}} - c_ {n + 1} = n \ ln ( n) {\ frac {a_ {n}} {a_ {n + 1}}} - (n + 1) \ ln (n + 1) \\ & = n \ ln (n) {\ frac {a_ {n }} {a_ {n + 1}}} - n \ ln (n + 1) - \ ln (n + 1) \\ & = n \ ln (n) {\ frac {a_ {n}} {a_ { n + 1}}} - n \ left (\ ln \ left (1 + {\ frac {1} {n}} \ right) + \ ln (n) \ right) - \ left (\ ln \ left (1 + {\ frac {1} {n}} \ right) + \ ln (n) \ right) \\ & = n \ ln (n) {\ frac {a_ {n}} {a_ {n + 1}} } - (n + 1) \ ln \ left (1 + {\ frac {1} {n}} \ right) -n \ ln (n) - \ ln (n) \\ & = \ ln (n) \ left (n {\ frac {a_ {n}} {a_ {n + 1}}} - n-1 \ right) - \ ln \ left (1 + {\ frac {1} {n}} \ right) ^ {n + 1} \\ & = \ ln (n) \ left (n \ left ({\ frac {a_ {n}} {a_ {n + 1}}} - 1 \ right) -1 \ right) - \ ln \ left (1 + {\ frac {1} {n}} \ right) ^ {n + 1} \\ & = B_ {n} - \ ln \ left (1 + {\ frac {1} {n }} \ right) ^ {n + 1} \ end {aligned}}}
.
With the continuity of the logarithm and the known limit value, it follows for :
lim
n
→
∞
(
1
+
1
n
)
n
+
1
=
e
{\ displaystyle \ lim _ {n \ to \ infty} \ left (1 + {\ frac {1} {n}} \ right) ^ {n + 1} = e}
n
→
∞
{\ displaystyle n \ to \ infty}
K
=
B.
-
ln
(
e
)
=
B.
-
1
{\ displaystyle K = B- \ ln (e) = B-1}
,
where and applies. now fulfills the conditions of the criterion of Kummer after construction . From the latter follows for :
.
K
,
B.
∈
R.
¯
{\ displaystyle K, B \ in {\ overline {\ mathbb {R}}}}
K
: =
lim
n
→
∞
K
n
{\ displaystyle K: = \ lim _ {n \ to \ infty} K_ {n}}
(
c
n
)
n
∈
N
{\ displaystyle (c_ {n}) _ {n \ in \ mathbb {N}}}
A.
{\ displaystyle A}
A.
:
{
convergent
K
>
0
⇔
B.
>
1
divergent
K
<
0
⇔
B.
<
1
{\ displaystyle A \ colon {\ begin {cases} {\ text {convergent}} & K> 0 \ Leftrightarrow B> 1 \\ {\ text {divergent}} & K <0 \ Leftrightarrow B <1 \ end {cases}} }
literature
Individual evidence
^ Markus Oster, Nicolai Lang; Christian Barth: Solutions to Worksheet I. (PDF; 155 kB) Lecture Analysis II (SoSe 2009). October 25, 2009, pp. 7/28 pp. , Accessed on December 23, 2012 .
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">