On Euclid’s algorithm and elementary number theory

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 v...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Science of computer programming Ročník 76; číslo 3; s. 160 - 180
Hlavní autoři: Backhouse, Roland, Ferreira, João F.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.03.2011
Témata:
Algorithm derivation
Calculational method
Eisenstein array
Eisenstein–Stern tree (aka Calkin–Wilf tree)
Enumeration algorithm
Euclid’s algorithm
Greatest common divisor
Invariant
Number theory
Rational number
Stern–Brocot tree
Stern–Brocot tree
Invariant
Eisenstein array
Enumeration algorithm
Calculational method
Euclid’s algorithm
Rational number
Greatest common divisor
Eisenstein–Stern tree (aka Calkin–Wilf tree)
Number theory
Algorithm derivation
ISSN:0167-6423, 1872-7964
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2010.05.006