An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
From MaRDI portal
(Redirected from Publication:1819945)
This paper describes the use of the Boyer-Moore theorem prover in mechanically generating a proof of Wilson's theorem: for any prime p, (p- 1)! and p-1 are congruent modulo p. The input to the theorem prover consists of a sequence of three function definitions and forty-two propositions to be proved. The proofs generated by the system are based on a library of lemmas relating to list manipulation and number theory, including Fermat's theorem.
Recommendations
Cited in
(9)- A mechanical proof of quadratic reciprocity
- Verification of the Miller-Rabin probabilistic primality test.
- Fermat, Euler, Wilson -- three case studies in number theory
- Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem
- Proof movie -- a proof with the Boyer-Moore prover
- scientific article; zbMATH DE number 4033137 (Why is no real title available?)
- scientific article; zbMATH DE number 65529 (Why is no real title available?)
- scientific article; zbMATH DE number 1795747 (Why is no real title available?)
- A theorem prover for a computational logic
This page was built for publication: An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819945)
