On Euclid’s Algorithm and Elementary Number Theory Roland Backhouse, Jo˜ao F. Ferreira1 School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, England Abstract Algorithms can be used to prove and t - EUCLID - Document - PDFSEARCH.IO

First Page	Meta Content
	On Euclid’s Algorithm and Elementary Number Theory Roland Backhouse, Jo˜ao F. Ferreira1 School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, England Abstract Algorithms can be used to prove and t Add to Reading List Document Date: 2009-03-03 11:35:00 Open Document File Size: 281,59 KB Share Result on Facebook Country Portugal / / / Event Environmental Issue / / Facility University of Nottingham / / IndustryTerm information technology / infimum operator / nontrivial algorithm / gcd operator / unknown algorithm / enumeration algorithm / gcd algorithm / / Organization University of Nottingham / Nottingham / Jo˜ao F. Ferreira1 School of Computer Science / Divisibility Theory Division / / Person Moshe Newman / Roland Backhouse / / / Position guard / / ProvinceOrState Indiana / / Technology Stern-Brocot enumeration algorithm / enumeration algorithm / gcd algorithm / information technology / previously unknown algorithm / Introduction An algorithm / / SocialTag Elementary arithmetic Stern–Brocot tree Algorithm Greatest common divisor Multiplication Function Number theory Rational number Number Mathematics

On Euclid’s Algorithm and Elementary Number Theory Roland Backhouse, Jo˜ao F. Ferreira1 School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, England Abstract Algorithms can be used to prove and tAdd to Reading List