The euclidean algorithm and simple continued fractions

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.creator	Porubský, Štefan
dc.creator	Trott, Michael
dc.date	2011-05-26T19:48:54Z
dc.date	2011-05-26T19:48:54Z
dc.date	2011-05-26
dc.date.accessioned	2017-04-05T16:48:21Z
dc.date.available	2017-04-05T16:48:21Z
dc.identifier	http://acervodigital.unesp.br/handle/123456789/2754
dc.identifier	http://objetoseducacionais2.mec.gov.br/handle/mec/5047
dc.identifier.uri	http://repositorioslatinoamericanos.uchile.cl/handle/2250/830165
dc.description	none
dc.description	This Demonstration shows the connection between the continued fraction expansion of a rational number a/b and the Euclidean algorithm applied to the pair of integers a and b
dc.description	Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
dc.relation	2TheEuclideanAlgorithmAndSimpleContinuedFractions.nbp
dc.rights	Demonstration freeware using Mathematica Player
dc.subject	Educação Básica::Ensino Fundamental Final::Matemática::Aritmética
dc.subject	Algorithm
dc.subject	Euclid's element
dc.subject	Greek mathematics
dc.subject	Algoritmo de Euclides
dc.title	The euclidean algorithm and simple continued fractions
dc.type	Software