Proof pearl: Bounding least common multiples with triangles

DOI10.1007/S10817-017-9438-0MaRDI QIDQ1722641zbMATH OpenOpenAlexFDO

Authors Hing-Lun Chan, Michael Norrish

Publication date 18 February 2019

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-017-9438-0

zbMATH Keywords

binomial coefficientsautomated theorem provingPascal's triangleformalisationHOL4least common multipleLeibniz's triangle

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
• scientific article; zbMATH DE number 3489190
• An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
• Elementary estimations of the least common multiple

Cites work

• scientific article; zbMATH DE number 3749006 (Why is no real title available?)
• scientific article; zbMATH DE number 1825219 (Why is no real title available?)
• A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
• A formally verified proof of the prime number theorem
• About the Formalization of Some Results by Chebyshev in Number Theory
• An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
• An epic drama: the development of the prime number theorem
• 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
• Formalizing an analytic proof of the prime number theorem
• Mechanisation of AKS algorithm. I. The main theorem
• On Chebyshev-Type Inequalities for Primes
• On the Product of the Primes
• PRIMES is in P
• Proof pearl: Bounding least common multiples with triangles
• The Harmonic Triangle and the Beta Function

Cited in

(3)

• Proof pearl: Bounding least common multiples with triangles
• Lower bound for the least common multiple
• Mechanisation of the AKS algorithm

Describes a project that uses

Uses Software

• HOL

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 Q1722641)