The Harmonic Triangle or Leibniz's Harmonic Triangle by Gottfried Wilhelm Leibniz is structured analogously to Pascal's triangle :
The nth line begins and ends at the margin
1
n
{\ displaystyle {\ frac {1} {n}}}
Each number is the sum of the two numbers below it
1
1
2
1
2
1
3
1
6th
1
3
1
4th
1
12
1
12
1
4th
1
5
1
20th
1
30th
1
20th
1
5
1
6th
1
30th
1
60
1
60
1
30th
1
6th
1
7th
1
42
1
105
1
140
1
105
1
42
1
7th
1
8th
1
56
1
168
1
280
1
280
1
168
1
56
1
8th
⋮
⋮
⋮
{\ displaystyle {\ begin {array} {cccccccccccccccccc} &&&&&&&&& 1 &&&&&&&&& \\ &&&&&&&&& {\ frac {1} {2}} && {\ frac {1} {2}} && {\ frac {1} {2}} &&&&&&&& \\ &&&&&&} {\ frac} {1} } && {\ frac {1} {6}} && {\ frac {1} {3}} &&&&&& \\ &&&&&& {\ frac {1} {4}} && {\ frac {1} {12}} && { \ frac {1} {12}} && {\ frac {1} {4}} &&&&& \\ &&&&& {\ frac {1} {5}} && {\ frac {1} {20}} && {\ frac { 1} {30}} && {\ frac {1} {20}} && {\ frac {1} {5}} &&&& \\ &&&& {\ frac {1} {6}} && {\ frac {1} { 30}} && {\ frac {1} {60}} && {\ frac {1} {60}} && {\ frac {1} {30}} && {\ frac {1} {6}} &&& \\ &&& {\ frac {1} {7}} && {\ frac {1} {42}} && {\ frac {1} {105}} && {\ frac {1} {140}} && {\ frac {1 } {105}} && {\ frac {1} {42}} && {\ frac {1} {7}} && \\ && {\ frac {1} {8}} && {\ frac {1} {56 }} && {\ frac {1} {168}} && {\ frac {1} {280}} && {\ frac {1} {280}} && {\ frac {1} {168}} && {\ frac {1} {56}} && {\ frac {1} {8}} & \\ &&&&& \ vdots &&&& \ vdots &&&& \ vdots &&&& \\\ end {array}}}
The entries are identified with the symbol , the numbering of the rows and columns starting with 1 (this is not handled uniformly in the literature (starting with 0 or 1)).
[
n
k
]
{\ displaystyle \ left [{n \ atop k} \ right]}
The recursion applies
[
n
1
]
=
[
n
n
]
=
1
n
,
[
n
k
]
=
[
n
+
1
k
]
+
[
n
+
1
k
+
1
]
,
n
≥
1
,
1
≤
k
≤
n
{\ displaystyle \ left [{n \ atop 1} \ right] = \ left [{n \ atop n} \ right] = {\ frac {1} {n}}, \ qquad \ left [{n \ atop k } \ right] = \ left [{n + 1 \ atop k} \ right] + \ left [{n + 1 \ atop k + 1} \ right], \ quad n \ geq 1.1 \ leq k \ leq n}
A connection with the binomial coefficients of Pascal's triangle is given by
[
n
k
]
=
1
k
(
n
k
)
=
1
n
(
n
-
1
k
-
1
)
{\ displaystyle \ left [{n \ atop k} \ right] = {\ frac {1} {k {\ binom {n} {k}}}} = {\ frac {1} {n {\ binom {n -1} {k-1}}}}}
, d. H. the entries are fractions .
Because of the sum of the denominators in the nth row . Example: .
∑
k
=
0
n
(
n
k
)
=
2
n
{\ displaystyle \ sum _ {k = 0} ^ {n} {\ binom {n} {k}} = 2 ^ {n}}
n
⋅
2
n
-
1
{\ displaystyle n \ cdot 2 ^ {n-1}}
5
+
20th
+
30th
+
20th
+
5
=
5
⋅
2
4th
=
80
{\ displaystyle 5 + 20 + 30 + 20 + 5 = 5 \ cdot 2 ^ {4} = 80}
The sum of a diagonal results in because
[
n
+
k
k
]
=
[
n
+
k
-
1
k
]
-
[
n
+
k
k
+
1
]
{\ displaystyle \ left [{n + k \ atop k} \ right] = \ left [{n + k-1 \ atop k} \ right] - \ left [{n + k \ atop k + 1} \ right ]}
the telescope sum
∑
k
=
1
ν
[
n
+
k
k
]
=
[
n
1
]
-
[
n
+
ν
ν
+
1
]
=
1
n
-
[
n
+
ν
ν
+
1
]
.
{\ displaystyle \ sum _ {k = 1} ^ {\ nu} \ left [{n + k \ atop k} \ right] = \ left [{n \ atop 1} \ right] - \ left [{n + \ nu \ atop \ nu +1} \ right] = {\ frac {1} {n}} - \ left [{n + \ nu \ atop \ nu +1} \ right].}
Because of the trunk breaks, Leibniz's series follows through the border crossing :
∑
k
=
1
∞
[
n
+
k
k
]
=
1
n
{\ displaystyle \ sum _ {k = 1} ^ {\ infty} \ left [{n + k \ atop k} \ right] = {\ frac {1} {n}}}
for or for
n
≥
1
{\ displaystyle n \ geq 1}
∑
k
=
0
∞
1
(
n
+
k
k
)
=
n
n
-
1
{\ displaystyle \ sum _ {k = 0} ^ {\ infty} {\ frac {1} {\ binom {n + k} {k}}} = {\ frac {n} {n-1}}}
n
≥
2
{\ displaystyle n \ geq 2}
history
In 1672 Christiaan Huygens had given his young friend Leibniz the task of summing the reciprocal triangular numbers:
1
+
1
3
+
1
6th
+
1
10
+
⋯
+
2
n
(
n
+
1
)
+
...
{\ displaystyle 1 + {\ frac {1} {3}} + {\ frac {1} {6}} + {\ frac {1} {10}} + \ dots + {\ frac {2} {n ( n + 1)}} + \ dots}
He gives 2 as the sum. During his stay in Paris he studied the writings of Blaise Pascal in detail . In a later version of his Historia et Origo , he contrasts Pascal's triangle with its harmonic triangle. The series then results from the general series for n = 2 .
literature
Web links
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">