Output details
11 - Computer Science and Informatics
Teesside University
Article title
On Euclid's algorithm and elementary number theory
Type
D - Journal article
Title of journal
Science of Computer Programming
Article number
-
Volume number
76
Issue number
3
First page of article
160
ISSN of journal
01676423
Year of publication
2011
Number of additional authors
1
Additional information
<12> This paper shows how the lessons that have been learnt in algorithm design can significantly improve mathematical practice. The focus is on how to derive number-theoretical results from Euclid’s algorithm. New results include distributivity properties of the greatest common divisor and new algorithms for efficiently enumerating the rationals in two different ways. The algorithm provides the definitive link between two well-known trees of rationals. The concise, systematic nature of the methods shown may have impact on technology transfer from Computing Science to Mathematics. This paper appeared in an SCP special issue containing a selection of the best papers of MPC2008.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
