Máximo común divisor: Diferenzas entre revisións
Contido eliminado Contido engadido
m →Bibliografía: Arranxos varios, replaced: {{cite book → {{Cita libro (4) |
Engade 1 libro para verificar) #IABot (v2.0.7) (GreenC bot |
||
Liña 150:
* [[Donald Knuth]]. ''[[The Art of Computer Programming]]'', Volume 2: ''Seminumerical Algorithms'', Third Edition. Addison-Wesley, 1997. ISBN 0-201-89684-2. Section 4.5.2: The Greatest Common Divisor, pp. 333–356.
* {{Cita libro| first = Calvin T. | last = Long | year = 1972 | title = Elementary Introduction to Number Theory | edition = 2nd | publisher = [[D. C. Heath and Company]] | location = Lexington | lccn = 77171950 }}
* {{Cita libro| first1 = Anthony J. | last1 = Pettofrezzo | first2 = Donald R. | last2 = Byrkit | year = 1970 | title = Elements of Number Theory | url = https://archive.org/details/elementsofnumber0000pett | publisher = [[Prentice Hall]] | location = Englewood Cliffs | lccn = 71081766}}
* [[Saunders MacLane]] e [[Garrett Birkhoff]]. ''A Survey of Modern Algebra'', Fourth Edition. MacMillan Publishing Co., 1977. ISBN 0-02-310070-2. 1–7: "The Euclidean Algorithm."
=== Ligazóns externas ===
| |||