Fermat, Euler, Wilson -- three case studies in number theory (Q1707601): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3894958 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proof Checking the RSA Public Key Encryption Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4550802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On proving the termination of algorithms by machine / rank | |||
Normal rank | |||
Revision as of 09:16, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fermat, Euler, Wilson -- three case studies in number theory |
scientific article |
Statements
Fermat, Euler, Wilson -- three case studies in number theory (English)
0 references
3 April 2018
0 references
program verification
0 references
theorem proving by induction
0 references
number theory
0 references
