On Euclid's algorithm and elementary number theory

Science of Computer Programming

Volumn 76, Issue 3, 2011, Pages 160-180

  Backhouse, Roland ^a   Ferreira, João F ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Algorithm derivation; Calculational method; Eisenstein array; EisensteinStern tree (aka CalkinWilf tree); Enumeration algorithm; Euclid's algorithm; Greatest common divisor; Invariant; Number theory; Rational number; SternBrocot tree

Indexed keywords

ALGORITHM DERIVATION; CALCULATIONAL METHOD; CALKIN-WILF TREE; EISENSTEIN ARRAY; ENUMERATION ALGORITHMS; EUCLID'S ALGORITHM; GREATEST COMMON DIVISORS; INVARIANT; RATIONAL NUMBERS; STERN-BROCOT TREE;

ALGORITHMS; DEFORESTATION; NUMBER THEORY;

TREES (MATHEMATICS);

ALGORITHMS; DEFORESTATION; MATHEMATICS; TREES;

EID: 78751569989     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2010.05.006     Document Type: Conference Paper

References (20)

1. D.E. Knuth The Art of Computer Programming 3rd ed. Seminumerical Algorithms vol. 2 1997 Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA
2. R. Backhouse Program Construction. Calculating Implementations From Specifications 2003 John Wiley & Sons, Ltd
3. D. Gries, and F.B. Schneider A Logical Approach to Discrete Math 1993 Springer-Verlag
4. E.W. Dijkstra Guarded commands, nondeterminacy and formal derivation of programs Communications of the ACM 18 8 1975 453 457
5. K.E. Hirst Numbers, Sequences and Series 1995 Edward Arnold
6. D.M. Burton Elementary Number Theory 6th ed. 2005 McGraw-Hill Higher Education URL http://www.worldcat.org/isbn/0071244255
7. J.B. Fraleigh A First Course in Abstract Algebra 6th ed. 1998 Addison Wesley Longman Inc.
8. A. van Gasteren On the Shape of Mathematical Arguments LNCS vol. 445 1990 Springer-Verlag
9. E.W. Dijkstra, Fibonacci and the greatest common divisor, April 1990. URL http://www.cs.utexas.edu/users/EWD/ewd10xx/EWD1077.PDF.
10. R.L. Graham, D.E. Knuth, and O. Patashnik Concrete Mathematics: A Foundation for Computer Science 2nd ed. 1994 Addison-Wesley Publishing Company
11. J. Gibbons, D. Lester, and R. Bird Enumerating the rationals Journal of Functional Programming 16 3 2006 281 291
12. D.E. Knuth, C. Rupert, A. Smith, and R. Stong Recounting the rationals, continued American Mathematical Monthly 110 7 2003 642 643
13. N. Calkin, and H.S. Wilf Recounting the rationals The American Mathematical Monthly 107 4 2000 360 363
14. M. Aigner, and G. Ziegler Proofs From The Book 3rd ed. 2004 Springer-Verlag
15. M.A. Stern eber eine zahlentheoretische Funktion Journal fr die reine und angewandte Mathematik 55 1858 193 220
16. R. Backhouse, and J.F. Ferreira Recounting the rationals: twice! Mathematics of Program Construction LNCS vol. 5133 2008 79 91 10.1007/978-3-540-70594-96 URL http://joaoff.com/publications/2008/rationals
17. A. Brocot Calcul des rouages par approximation, nouvelle mthode Revue Chronomtrique 3 1861 186 194 Available via http://joaoff.com/publications/2008/ rationals/
18. B. Hayes On the teeth of wheels American Scientist 88 4 2000 296 300 URL http://www.americanscientist.org/issues/pub/2000/4/on-the-teeth-of-wheels
19. N.J.A. Sloane, The on-line encyclopedia of integer sequences. URL http://www.research.att.com/~njas/sequences/.
20. R. Backhouse, J.F. Ferreira, On Euclid's algorithm and elementary number theory, 2009. URL http://joaoff.com/publications/2009/euclid-alg.