Fermat, Euler, Wilson -- three case studies in number theory
From MaRDI portal
(Redirected from Publication:1707601)
Recommendations
Cites work
- A theorem prover for a computational logic
- An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
- scientific article; zbMATH DE number 3702108 (Why is no real title available?)
- scientific article; zbMATH DE number 1795747 (Why is no real title available?)
- On proving the termination of algorithms by machine
- Proof Checking the RSA Public Key Encryption Algorithm
Cited in
(5)- An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
- scientific article; zbMATH DE number 1795747 (Why is no real title available?)
- A string of pearls: proofs of Fermat's little theorem
- The arithmetics of Pierre Fermat in the context of the Mersenne correspondence: A microsocial approach
- On Fermat's and Euler's number-theoretical methods, their connections and their significance
This page was built for publication: Fermat, Euler, Wilson -- three case studies in number theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707601)