Automating Elementary Number-Theoretic Proofs Using Gröbner Bases
From MaRDI portal
Publication:3608762
DOI10.1007/978-3-540-73595-3_5zbMath1213.03020OpenAlexW2050804394MaRDI QIDQ3608762
No author found.
Publication date: 6 March 2009
Published in: Automated Deduction – CADE-21 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73595-3_5
Mechanization of proofs and logical operations (03B35) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (4)
Formal Proof of the Group Law for Edwards Elliptic Curves ⋮ Unnamed Item ⋮ Formal power series ⋮ Formalization of Wu’s Simple Method in Coq
Uses Software
This page was built for publication: Automating Elementary Number-Theoretic Proofs Using Gröbner Bases
