The Leibniz harmonic triangle is a triangular arrangement of unit fractions in which the outermost diagonals consist of the reciprocals of the row numbers and each inner cell is the cell diagonally above and to the left minus the cell to the left. To put it algebraically, (where is the number of the row, starting from 1, and is the column number, never more than r) and
The first eight rows are:
\begin{array}{cccccccccccccccccc} &&&&&&&&&1&&&&&&&&\\ &&&&&&&&
1 | |
2 |
&&
1 | |
2 |
&&&&&&&\\ &&&&&&&
1 | |
3 |
&&
1 | |
6 |
&&
1 | |
3 |
&&&&&&\\ &&&&&&
1 | |
4 |
&&
1 | |
12 |
&&
1 | |
12 |
&&
1 | |
4 |
&&&&&\\ &&&&&
1 | |
5 |
&&
1 | |
20 |
&&
1 | |
30 |
&&
1 | |
20 |
&&
1 | |
5 |
&&&&\\ &&&&
1 | |
6 |
&&
1 | |
30 |
&&
1 | |
60 |
&&
1 | |
60 |
&&
1 | |
30 |
&&
1 | |
6 |
&&&\\ &&&
1 | |
7 |
&&
1 | |
42 |
&&
1 | |
105 |
&&
1 | |
140 |
&&
1 | |
105 |
&&
1 | |
42 |
&&
1 | |
7 |
&&\\ &&
1 | |
8 |
&&
1 | |
56 |
&&
1 | |
168 |
&&
1 | |
280 |
&&
1 | |
280 |
&&
1 | |
168 |
&&
1 | |
56 |
&&
1 | |
8 |
&\\ &&&&&\vdots&&&&\vdots&&&&\vdots&&&&\\ \end{array}
The denominators are listed in, while the numerators are all 1s.
The terms are given by the recurrences
an,1=
1 | |
n |
,
an,k=
1 | |
n\binom{n-1 |
{k-1}},
and explicitly by
an,k=
1 | |
\binom{n |
{k}k}
where
\binom{n}{k}
Whereas each entry in Pascal's triangle is the sum of the two entries in the above row, each entry in the Leibniz triangle is the sum of the two entries in the row below it. For example, in the 5th row, the entry (1/30) is the sum of the two (1/60)s in the 6th row.
Just as Pascal's triangle can be computed by using binomial coefficients, so can Leibniz's:
L(r,c)=
1 | |
r{r-1\choosec-1 |
Moreover, each entry in the Harmonic triangle is equal to the reciprocal of the respective entry in Pascal's triangle multiplied by the reciprocal of the respective row,
r
h(r,c)=
1 | |
p(r,c) |
x
1 | |
r |
h(r,c)
p(r,c)
The infinite sum of all the terms in any diagonal equals the first term in the previous diagonal, that is
infty | |
\sum | |
r=c |
L(r,c)=L(c-1,c-1)
infty | |
\sum | |
r=c |
infty | |
L(r,c)=\sum | |
r=c |
L(r-1,c-1)-L(r,c-1)=L(c-1,c-1)-\cancelto{0}{L(infty,c-1)} :
L(infty,c-1)=\limr\toinftyL(r,c-1)=\limr\toinfty
1 | |
r{r-1\choosec-2 |
\begin{array}{cccccccccccccccccc} &&&&&&{\color{red}1}&&&&&&\\ &&&&&
1 | |
2 |
&&{\color{blue}
1 | |
2 |
For example,
{\color{blue} | 1 | + |
2 |
1 | + | |
6 |
1 | +...}= | |
12 |
1 | - | |
1 |
1 | + | |
2 |
1 | - | |
2 |
1 | + | |
3 |
1 | - | |
3 |
1 | |
4 |
+...={\color{red}1}
{\color{blue} | 1 | + |
5 |
1 | + | |
30 |
1 | +...}= | |
105 |
1 | - | |
4 |
1 | + | |
20 |
1 | - | |
20 |
1 | + | |
60 |
1 | - | |
60 |
1 | +...={\color{red} | |
140 |
1 | |
4 |
Replacing the formula for the coefficients we get the infinite series
infty | |
\sum | |
r=c |
1 | |
r{r-1\choosec-1 |
If one takes the denominators of the nth row and adds them, then the result will equal
n2n
We have
L(r,c)=
1 | |
\int | |
0 |
xc-1(1-x)r-cdx.