Skip navigation
Skip navigation

Proof Pearl: Bounding Least Common Multiples with Triangles

Chan, Hing Lun Joseph; Norrish, Michael

Description

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.

CollectionsANU Research Publications
Date published: 2017
Type: Journal article
URI: http://hdl.handle.net/1885/247360
Source: Journal of Automated Reasoning
DOI: 10.1007/s10817-017-9438-0

Download

File Description SizeFormat Image
01_CHAN_Proof_Pearl%3A_Bounding_Least_2017.pdf741.11 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator