Algoritmo di Euclide: differenze tra le versioni

Contenuto cancellato Contenuto aggiunto
Riga 143:
 
==Bibliografia==
*[[Donald Knuth]]., ''TheCharles ArtE. ofLeiserson, ComputerRonald Programming''L. Rivest, Volumee 2:Clifford Stein, ''SeminumericalIntroduction to Algorithms'', ThirdSecond Edition. AddisonMIT Press and McGraw-WesleyHill, 19972001. ISBN 0-201262-8968403293-27. SectionsSection 431.5.2–4.5.32: Greatest common divisor, pp. 333–379856–862.
*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.
 
==Voci correlate==