Proof Pearl: Bounding Least Common Multiples with Triangles
We present a proof of the fact that Open image in new window for \(n \ge 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.
|Collections||ANU Research Publications|
|Source:||Journal of Automated Reasoning|
|01_CHAN_Proof_Pearl%3A_Bounding_Least_2017.pdf||741.11 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.