Proof pearl: Bounding least common multiples with triangles

DOI10.1007/978-3-319-43144-4_9MaRDI QIDQ2829255zbMATH OpenOpenAlexFDO

Authors Hing-Lun Chan, Michael Norrish

Publication date 27 October 2016

Published in Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-43144-4_9

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Formalization of mathematics in connection with theorem provers (68V20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Proof pearl: Bounding least common multiples with triangles
• Lower bound for the least common multiple
• An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
• scientific article; zbMATH DE number 3489190
• Elementary estimations of the least common multiple

Cites work

• scientific article; zbMATH DE number 3749006 (Why is no real title available?)
• An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Euler's beta integral in Pietro Mengoli's works
• Mechanisation of AKS algorithm. I. The main theorem
• On Chebyshev-Type Inequalities for Primes
• PRIMES is in P
• The Harmonic Triangle and the Beta Function

Cited in

(2)

• Proof pearl: Bounding least common multiples with triangles
• Lower bound for the least common multiple

This page was built for publication: Proof pearl: Bounding least common multiples with triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829255)