• Login
• Admin

Backhouse, Roland and Ferreira, João F. (2011) On Euclid’s algorithm and elementary number theory. Science of Computer Programming, 76 (3). pp. 160-180. ISSN 0167-64230

Full text not available from this repository.

Abstract

Algorithms 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).

The theorems that we verify are well-known and most of them are included in standard number-theory books. The new results concern distributivity properties of the greatest common divisor and a new algorithm for efficiently enumerating the positive rationals in two different ways. One way is known and is due to Moshe Newman. The second is new and corresponds to a deforestation of the Stern–Brocot tree of rationals. We show that both enumerations stem from the same simple algorithm. In this way, we construct a Stern–Brocot enumeration algorithm with the same time and space complexity as Newman’s algorithm. A short review of the original papers by Stern and Brocot is also included.

Item Type:	Article
RIS ID:	https://nottingham-repository.worktribe.com/output/707172
Keywords:	Number theory; Calculational method; Greatest common divisor; Euclid’s algorithm; Invariant; Eisenstein array; Eisenstein–Stern tree (aka Calkin–Wilf tree); Stern–Brocot tree; Algorithm derivation; Enumeration algorithm; Rational number
Schools/Departments:	University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number:	https://doi.org/10.1016/j.scico.2010.05.006
Depositing User:	Backhouse, Professor Roland C
Date Deposited:	07 Jan 2013 10:20
Last Modified:	04 May 2020 16:30
URI:	https://eprints.nottingham.ac.uk/id/eprint/1856

Actions (Archive Staff Only)

Edit View