Euclidean algorithm
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.
- Comment
- enIn mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.
- Date
- enJune 2019
- Depiction
- Has abstract
- enIn mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations. The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, they are the GCD of the original two numbers. By or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way is known as Bézout's identity. The version of the Euclidean algorithm described above (and by Euclid) can take many subtraction steps to find the GCD when one of the given numbers is much bigger than the other. A more efficient version of the algorithm shortcuts these steps, instead replacing the larger of the two numbers by its remainder when divided by the smaller of the two (with this version, the algorithm stops when reaching a zero remainder). With this improvement, the algorithm never requires more steps than five times the number of digits (base 10) of the smaller integer. This was proven by Gabriel Lamé in 1844, and marks the beginning of computational complexity theory. Additional methods for improving the algorithm's efficiency were developed in the 20th century. The Euclidean algorithm has many theoretical and practical applications. It is used for reducing fractions to their simplest form and for performing division in modular arithmetic. Computations using this algorithm form part of the cryptographic protocols that are used to secure internet communications, and in methods for breaking these cryptosystems by factoring large composite numbers. The Euclidean algorithm may be used to solve Diophantine equations, such as finding numbers that satisfy multiple congruences according to the Chinese remainder theorem, to construct continued fractions, and to find accurate rational approximations to real numbers. Finally, it can be used as a basic tool for proving theorems in number theory such as Lagrange's four-square theorem and the uniqueness of prime factorizations. The original algorithm was described only for natural numbers and geometric lengths (real numbers), but the algorithm was generalized in the 19th century to other types of numbers, such as Gaussian integers and polynomials of one variable. This led to modern abstract algebraic notions such as Euclidean domains.
- Hypernym
- Method
- Is primary topic of
- Euclidean algorithm
- Label
- enEuclidean algorithm
- Link from a Wikipage to an external page
- books.google.com/books%3Fid=7eLkq0wQytAC
- books.google.com/books%3Fid=hXGr-9l1DXcC
- books.google.com/books%3Fid=yMGeElJ8M0wC
- www.cut-the-knot.org/blue/Euclid.shtml
- www.cut-the-knot.org/blue/EuclidAlg.shtml
- www.math.sc.edu/~sumner/numbertheory/euclidean/euclidean.html
- plus.maths.org/issue40/features/wardhaugh/index.html
- archive.org/details/introductiontonu00star_0
- www.mathpages.com/home/kmath384.htm
- archive.org/details/numbertheoryitsh00ore
- archive.org/details/vorlesungenberz02dirigoog
- Link from a Wikipage to another Wikipage
- Absolute value
- Abstract algebra
- Algebraic integer
- Algorithm
- Almost all
- Aristotle
- Aryabhata
- Associative property
- Associativity
- Bartel Leendert van der Waerden
- BCH code
- Berlekamp–Massey algorithm
- Bézout's identity
- Big O notation
- Big-O notation
- Binary GCD algorithm
- Binary numeral system
- Binary operation
- Binary search tree
- Calkin–Wilf tree
- Cambridge University Press
- Carl Friedrich Gauss
- Category:Articles containing proofs
- Category:Articles with example pseudocode
- Category:Euclid
- Category:Number theoretic algorithms
- Chinese remainder theorem
- Claude Gaspard Bachet de Méziriac
- Commensurability (mathematics)
- Commutative property
- Commutative ring
- Commutativity
- Complex number
- Computational complexity theory
- Computer programming
- Constant time
- Continued fraction
- Continued fraction factorization
- Control theory
- Convergent (continued fraction)
- Coprime integers
- Cryptographic protocol
- Cut-the-knot
- Cyclotomic field
- Derivative
- Determinant
- Diophantine approximation
- Diophantine equation
- Diophantus
- Disquisitiones Arithmeticae
- Distributive property
- Distributivity
- Division (mathematics)
- Dixon's factorization method
- Domain (ring theory)
- Donald Knuth
- Eisenstein integer
- Electronic commerce
- Émile Léger
- Empty product
- Ernst Kummer
- Error-correcting code
- Euclid
- Euclid's Elements
- Euclid's lemma
- Euclidean division
- Euclidean domain
- Euclidean rhythm
- Eudoxus of Cnidus
- Euler's totient function
- Euler–Mascheroni constant
- Évariste Galois
- Extended Euclidean algorithm
- Fermat's Last Theorem
- Fermat's theorem on sums of two squares
- Fibonacci number
- Fibonacci numbers
- Field norm
- File:24x60.svg
- File:Diophante Bezout.svg
- File:Eisenstein primes.svg
- File:Euclid's algorithm Book VII Proposition 2 3.png
- File:Euclidean algorithm 1071 462.gif
- File:Euclidean Algorithm Running Time.svg
- File:Euklid.jpg
- File:Gaussian primes.png
- File:SternBrocotTree.svg
- Finite field
- Fraction (mathematics)
- Fundamental theorem of arithmetic
- Gabriel Lamé
- Gaussian integer
- GCD domain
- Generalized Riemann hypothesis
- Golden ratio
- Greatest common divisor
- Group (mathematics)
- Helaman Ferguson
- Hurwitz quaternion
- Ideal (ring theory)
- Ideal number
- Imaginary unit
- Infinitesimal
- Integer
- Integer factorization
- Integer relation algorithm
- Integral domain
- Internet
- Interval (mathematics)
- Invertible matrix
- Irrational number
- Irreducible element
- Irreducible fraction
- Irreducible polynomial
- Jacques Charles François Sturm
- Joseph Liouville
- Lagrange's four-square theorem
- Lehmer's GCD algorithm
- Lenstra elliptic curve factorization
- Lenstra–Lenstra–Lovász lattice basis reduction algorithm
- Leopold Kronecker
- Linear combination
- Mathematical induction
- Mathematical Treatise in Nine Sections
- Mathematician
- Mathematics
- Matrix (mathematics)
- Modular arithmetic
- Modular multiplicative inverse
- Modulo operation
- Monoid
- Natural number
- Nicholas Saunderson
- Norm (mathematics)
- Norm-Euclidean field
- Number theory
- Peter Gustav Lejeune Dirichlet
- Pierre Joseph Étienne Finck
- Pollard's rho algorithm
- Polynomial
- Polynomial long division
- Porter's constant
- Prime number
- Principal ideal
- Principal ideal domain
- Pseudocode
- Pythagoras
- Pythagorean triple
- Qin Jiushao
- Quadratic integer
- Quasilinear time
- Quaternion
- Rational number
- Real number
- Recurrence relation
- Reed–Solomon code
- Remainder
- Richard Dedekind
- Riemann zeta function
- Ring (mathematics)
- Ring of integers
- Ring theory
- Roger Cotes
- Routh–Hurwitz stability criterion
- RSA algorithm
- Schönhage–Strassen algorithm
- Shor's algorithm
- Square root of 2
- Stern–Brocot tree
- Sturm's theorem
- Sturm chain
- Sunzi Suanjing
- System of linear equations
- Telescoping series
- Temporary variable
- The Art of Computer Programming
- Underdetermined system
- Uniform cost model
- Unique factorization domain
- Univariate polynomial
- Von Mangoldt function
- Vorlesungen über Zahlentheorie
- Well-order
- Well-ordering principle
- Zero of a function
- Reason
- enAre there other examples?
- enHow \psi is chosen?
- enWhat is this?
- SameAs
- 2BJ8A
- 4659898-4
- Algorisme d'Euclides
- Algorithme d'Euclide
- Algorithm Ewclidaidd
- Algorithmus Euclidis
- Algoritm d'Euclid
- Algoritme Euklides
- Algoritme van Euclides
- Algoritmo de Euclides
- Algoritmo de Euclides
- Algoritmo de Euclides
- Algoritmo di Euclide
- Algoritmu d'Euclides
- Algoritmul lui Euclid
- Algorytm Euklidesa
- Eiklīda algoritms
- Euclidean algorithm
- Euclidean algorithm
- Euclidean algorithm
- Eukleideen algoritmi
- Eukleidův algoritmus
- Eŭklida algoritmo
- Euklides algoritm
- Euklidesen algoritmo
- Euklideszi algoritmus
- Euklidischer Algorithmus
- Euklido algoritmas
- Euklidov algoritam
- Euklidov algoritam
- Euklidov algoritmus
- Euklids algoritme
- Euklids algoritme
- Euklidsch Algorithmus
- Euklidsk algoritme
- Evklid alqoritmi
- Evklidov algoritem
- Giải thuật Euclid
- m.02tbp
- Öklid algoritması
- Q230848
- Αλγόριθμος του Ευκλείδη
- Алгарытм Эўкліда
- Алгоритм Евклида
- Алгоритм Евкліда
- Алгоритъм на Евклид
- Евклид алгоритмы
- Евклидийн алгоритм
- Еуклидов алгоритам
- Էվկլիդեսի ալգորիթմ
- אלגוריתם אוקלידס
- ئەلگۆریتمی ئیقلیدس
- الگوریتم اقلیدس
- خوارزمية أقليدس
- ইউক্লিডীয় এলগরিদম
- யூக்ளிடிய படிமுறைத்தீர்வு
- യൂക്ലിഡിന്റെ അൽഗൊരിതം
- ขั้นตอนวิธีแบบยุคลิด
- ユークリッドの互除法
- 輾轉相除法
- 유클리드 호제법
- Subject
- Category:Articles containing proofs
- Category:Articles with example pseudocode
- Category:Euclid
- Category:Number theoretic algorithms
- Thumbnail
- Title
- enEuclid's algorithm
- enEuclidean Algorithm
- Urlname
- enEuclideanAlgorithm
- enEuclidsAlgorithm
- WasDerivedFrom
- Euclidean algorithm?oldid=1118720378&ns=0
- WikiPageLength
- 121899
- Wikipage page ID
- 10377
- Wikipage revision ID
- 1118720378
- WikiPageUsesTemplate
- Template:!
- Template:About
- Template:Ancient Greek mathematics
- Template:Authority control
- Template:Cite book
- Template:Clarify
- Template:Commons category
- Template:Em
- Template:Featured article
- Template:Mabs
- Template:Main
- Template:Math
- Template:MathWorld
- Template:Mvar
- Template:Nowrap begin
- Template:Nowrap end
- Template:Number theoretic algorithms
- Template:PlanetMath
- Template:Reflist
- Template:Short description
- Template:Sqrt
