Máximo común divisor: Diferenzas entre revisións
Contido eliminado Contido engadido
→Ligazóns externas: Arranxos |
→Ligazóns externas: Bibliografía de en.wiki |
||
Liña 431:
{{listaref}}
== Véxase tamén ==
=== Bibliografía ===
*{{cite book|last=Andrews |first=George E. |author-link=George Andrews (mathematician) |year=1994 |origyear=1971 |title=Number Theory |publisher=Dover |publication-place= |page= |isbn=9780486682525 |url=https://books.google.com/books?id=eVwvvwZeBf4C |accessdate= }}
* [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]] e [[Clifford Stein]]. ''Introduction to Algorithms'', Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 31.2: Greatest common divisor, pp. 856–862.
*{{cite book | last1 = Hardy | first1 = G. H. | author1-link = G. H. Hardy | last2 = Wright | first2 = E. M. | author2-link = E. M. Wright | title = An Introduction to the Theory of Numbers | edition = Fifth | publisher = [[Oxford University Press]] | location = Oxford | year = 1979 | isbn = 978-0-19-853171-5}}
* [[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.
* {{cite book| 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 }}
* {{cite book| first1 = Anthony J. | last1 = Pettofrezzo | first2 = Donald R. | last2 = Byrkit | year = 1970 | title = Elements of Number Theory | 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 ===
* Weisstein, Eric W. [http://mathworld.wolfram.com/GreatestCommonDivisor.html «Greatest Common Divisor».]
| |||