Proof Pearl: Bounding Least Common Multiples with Triangles
From MaRDI portal
Publication:2829255
DOI10.1007/978-3-319-43144-4_9zbMath1468.68283OpenAlexW3038792973MaRDI QIDQ2829255
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
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Euler's beta integral in Pietro Mengoli's works
- PRIMES is in P
- Mechanisation of AKS Algorithm: Part 1 – The Main Theorem
- The Harmonic Triangle and the Beta Function
- An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
- On Chebyshev-Type Inequalities for Primes
This page was built for publication: Proof Pearl: Bounding Least Common Multiples with Triangles