Abstract | ||
---|---|---|
Program derivation methodology is applied to reconstruct Euler's proof that every prime congruent to 1 modulo 4 is the sum of two squares. |
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/BFb0054284 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
program derivation techniques,program derivation | Prime (order theory),Constructive proof,Modulo,Euler's formula,Program derivation,Fermat's theorem on sums of two squares,Program analysis,Congruence (geometry),Calculus,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-64591-8 | 0 | 0.34 |
References | Authors | |
1 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. Bijlsma | 1 | 36 | 7.02 |