Journal of Automated Reasoning

, Volume 59, Issue 2, pp 267–286

Fermat, Euler, Wilson - Three Case Studies in Number Theory

Article
  • 92 Downloads

Abstract

We report on computer assisted proofs of three theorems from Number Theory, viz. Fermat’s Little Theorem, Euler’s generalization of Fermat’s statement and Wilson’s Theorem. Common to the formal proofs is that permutation of certain number lists has to be proved, which causes the main effort in the development. We give a short survey of the Open image in new window   system used in this experiment and illustrate the proofs before presenting them formally. We also discuss alternative solutions, report on the required effort and conclude with some experiences gained from this experiment.

Keywords

Program verification Theorem proving by induction Number theory 

References

  1. 1.
  2. 2.
    Boyer, R.S., Moore, JS.: A Computational Logic. Academic Press, New York (1979)Google Scholar
  3. 3.
    Boyer, R.S., Moore, JS.: Proof checking the RSA public key encryption algorithm. Am. Math. Mon. 91(3), 181–189 (1984)Google Scholar
  4. 4.
    Boyer, R.S., Moore, JS.: A theorem prover for a computational logic (keynote address). In: Proceedings of 10th International Conference on Automated Deduction (CADE-10). Lecture Notes in Computer Science, vol. 449, pp. 1–15, Kaiserslautern (1990)Google Scholar
  5. 5.
    Boyer, R.S., Moore, JS.: On the difficulty of automating inductive reasoning. Remarks made at a CADE-11 Workshop on Inductive Reasoning, Saratoga Springs (1992)Google Scholar
  6. 6.
    Dickson, L.E.: History of the theory of numbers. In: Divisibility and Primality. vol 1, Carnegie Institution of Washington, Publication No. 256, Washington (1919)Google Scholar
  7. 7.
    Rasmussen, T.M.: An inductive approach to formalizing notions of number theory proofs. In: Computer Mathematics: Proceedings of the 5th Asian Symposium (ASCM 2001), Matsuyama, Japan pp. 131–140 (2001)Google Scholar
  8. 8.
    Rosen, K.H.: Elementary Number Theory and Its Applications, 5th edn. Pearson Addison Wesley, Boston (2005)Google Scholar
  9. 9.
    Russinoff, D.M.: An experiment with the Boyer–Moore theorem prover: A proof of Wilson’s theorem. J. Autom. Reason. 1(2), 121–139 (1985)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Walther, C.: On proving the termination of algorithms by machine. Artif. Intell. 71(1), 101–157 (1994)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Walther, C., Schweitzer, S.: Verification in the classroom. J. Autom. Reason. 32(1), 35–73 (2004)CrossRefGoogle Scholar
  12. 12.
    Walther, C., Schweitzer, S.: A pragmatic approach to equality reasoning. Technical Report VFR 06/02, Technische Universität Darmstadt, pp. 1–19 (2006) (available from [1])Google Scholar
  13. 13.
  14. 14.
  15. 15.

Copyright information

© Springer Science+Business Media Dordrecht 2016

Authors and Affiliations

  1. 1.Fachbereich InformatikTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations