Proof Pearl: Bounding Least Common Multiples with Triangles

Hing Lun Chan*, Michael Norrish

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    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 languageEnglish
    Pages (from-to)171-192
    Number of pages22
    JournalJournal of Automated Reasoning
    Volume62
    Issue number2
    DOIs
    Publication statusPublished - 15 Feb 2019

    Fingerprint

    Dive into the research topics of 'Proof Pearl: Bounding Least Common Multiples with Triangles'. Together they form a unique fingerprint.

    Cite this