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, L(r, 1) = 1/r, where r is the number of the row, starting from 1, and c is the number, never more than r and L(r, c) = L(r – 1, c – 1) – L(r, c – 1)
Relation with pascal’s triangle
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:
If one takes the denominators of the nth row and adds them, then the result will equal n.2n-1. For example, for the 3rd row, we have 3 + 6 + 3 = 12 = 3 × 22.
Given a positive integer n. The task is to print Leibniz harmonic triangle of height n.
Input : n = 4 Output : 1 1/2 1/2 1/3 1/6 1/3 1/4 1/12 1/12 1/4 Input : n = 3 Output : 1 1/2 1/2 1/3 1/6 1/3
Below is the implementation of printing Leibniz harmonic triangle of height n based on above relation with Pascal triangle.
1/1 1/2 1/2 1/3 1/6 1/3 1/4 1/12 1/12 1/4
- Count ways to reach the nth stair using step 1, 2 or 3
- Program to find sum of series 1*2*3 + 2*3*4+ 3*4*5 + . . . + n*(n+1)*(n+2)
- Trinomial Triangle
- Program to print triangular number series till n
- Number of ways to form a heap with n distinct integers
- Hosoya's Triangle
- Entringer Number
- Pascal Matrix
- Number of triangles after N moves
- Find all divisors of a natural number | Set 1
- Maximum score after flipping a Binary Matrix atmost K times
- Number of ways to arrange a word such that all vowels occur together
- Find maximum value of x such that n! % (k^x) = 0
- Sum of width (max and min diff) of all Subsequences
- Ways of selecting men and women from a group to make a team
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.