An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem (Q1819945)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem |
scientific article; zbMATH DE number 3995080
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem |
scientific article; zbMATH DE number 3995080 |
Statements
An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem (English)
0 references
1985
0 references
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.
0 references
automatic theorem proving
0 references
Boyer-Moore theorem prover
0 references
number theory
0 references
Wilson's theorem
0 references
