Photo from archive.org
We present a proof of the fact that for $$n \ge 0$$n≥0. This result has a standard proof via an integral, but our proof is purely number-theoretic, requiring little more… Click to show full abstract
We present a proof of the fact that for $$n \ge 0$$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.
Keywords:
pearl bounding;
bounding least;
common multiples;
proof;
proof pearl;
least common
Journal Title: Journal of Automated Reasoning
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Automated Reasoning
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!