Fermat, Euler, Wilson -- three case studies in number theory (Q1707601): Difference between revisions

@@ Property / DOI @@
-.1007/s10817-016-9387-z
@@ Property / DOI: 10.1007/s10817-016-9387-z / rank @@
-Normal rank
@@ Property / cites work @@
+Q3894958
@@ Property / cites work: Q3894958 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof Checking the RSA Public Key Encryption Algorithm
+Normal rank
@@ Property / cites work @@
+Q4550802
@@ Property / cites work: Q4550802 / rank @@
+Normal rank
@@ Property / cites work @@
+An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
+Normal rank
@@ Property / cites work @@
+On proving the termination of algorithms by machine
+Normal rank
@@ Property / cites work @@
+A theorem prover for a computational logic
@@ Property / cites work: A theorem prover for a computational logic / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10817-016-9387-Z
@@ Property / DOI: 10.1007/S10817-016-9387-Z / rank @@
+Normal rank