Abstract
We present a proof of the fact that [InlineEquation not available: see fulltext.] for n≥ 0. This result has a standard proof via an integral, but our proof is purely number-theoretic, requiring little more than inductions based on lists. The almost-pictorial proof is based on manipulations of a variant of Leibniz’s harmonic triangle, itself a relative of Pascal’s better-known Triangle.
Original language | English |
---|---|
Pages (from-to) | 171-192 |
Number of pages | 22 |
Journal | Journal of Automated Reasoning |
Volume | 62 |
Issue number | 2 |
DOIs | |
Publication status | Published - 15 Feb 2019 |