Open Research will be updating the system on Tuesday, 14 July 2026, from 8:15 to 9:00 AM. We apologise for any inconvenience caused.

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Proof Pearl: Bounding Least Common Multiples with Triangles

Loading...
Thumbnail Image

Date

Authors

Chan, Hing Lun Joseph
Norrish, Michael

Journal Title

Journal ISSN

Volume Title

Publisher

Kluwer Academic Publishers

Abstract

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.

Description

Citation

Source

Journal of Automated Reasoning

Book Title

Entity type

Access Statement

License Rights

Restricted until

2099-12-31
abcd