On Euclid’s algorithm and elementary number theoryTools Backhouse, Roland and Ferreira, João F. (2011) On Euclid’s algorithm and elementary number theory. Science of Computer Programming, 76 (3). pp. 160180. ISSN 016764230 Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.scico.2010.05.006
AbstractAlgorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid’s algorithm. We illustrate how to use the algorithm as a verification interface (i.e., how to verify theorems) and as a construction interface (i.e., how to investigate and derive new theorems).
Actions (Archive Staff Only)
