Abstract
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.
Similar content being viewed by others
References
Boole G., An Investigation of the Laws of Thought on which are Founded the Mathematical Theories of Logic and Probabilities, Dover Publications, New York (1951).
Boyer R. S. and Moore J Strother, A Computational Logic, Academic Press, New York (1979).
Boyer, R. S. and Moore, J Strother, ‘A theorem prover for recursive functions, a user's manual’, Computer Science Laboratory, SRI International (1979).
Boyer, R. S. and Moore, J Strother, Proof Checking the RSA Public Key Encryption Algorithm, Technical Report ICSCA-CMP-33, Institute for Computing Science and Computer Applications, University of Texas at Austin (1982).
Boyer R. S. and Moore J Strother, ‘Proof checking the RSA public key encryption algorithm’, American Mathematical Monthly 91 (3), 181–189 (1984).
Dijkstra, E. W., Trip Report, Newcastle-upon-Tyne, Sept. 6–10 (1982).
Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers, Oxford University Press (1968).
McCarthy J., ‘Computer programs for checking mathematical proofs’, Recursive Function Theory, Proc. Symp. Pure Math., Amer. Math. Soc. V, 219–227 (1962).
McCarthy J., ‘A basis for a mathematical theory of computation’, Computer Programming and Formal Systems (eds. P.Braffort and D.Hershberg), North-Holland Publ. Co., Amsterdam, pp. 33–70 (1963).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Russinoff, D.M. An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem. J Autom Reasoning 1, 121–139 (1985). https://doi.org/10.1007/BF00244993
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00244993