Skip to main content

Proof pearl: Bounding least common multiples with triangles


Joseph Chan and Michael Norrish

Australian National University



We present a proof of the fact that 2^n ≤ lcm{1 . . . (n + 1)}. This result has a standard proof via an integral, but our proof is purely number theoretic, requiring little more than list inductions. The proof is based on manipulations of a variant of Leibniz’s Harmonic Triangle, itself a relative of Pascal’s better-known Triangle.

BibTeX Entry

    isbn             = {9783319431437},
    publisher        = {Springer},
    booktitle        = {International Conference on Interactive Theorem Proving},
    month            = aug,
    slides           = {},
    paperurl         = {},
    year             = {2016},
    editor           = {{Jasmin Christian Blanchette and Stephan Merz}},
    title            = {Proof Pearl: Bounding Least Common Multiples with Triangles},
    pages            = {140--150},
    author           = {Chan, Joseph and Norrish, Michael},
    address          = {Nancy, France}