DBpedia – Linked Data Fragments

Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Euclidean_algorithm> ?p ?o }

• Euclidean_algorithm abstract "In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers, the largest number that divides both of them without leaving a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in Euclid's 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 numerical 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 (252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 147 = 252 − 105. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until one of the two numbers reaches zero. When that occurs, the other number (the one that is not zero) is the GCD of the original two numbers. By reversing the steps, the GCD can be expressed as a sum of the two original numbers each multiplied by a positive or negative integer, e.g., 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 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 is 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.".
• Euclidean_algorithm thumbnail Euclid's_algorithm_Book_VII_Proposition_2_3.png?width=300.
• Euclidean_algorithm wikiPageExternalLink ?id=7eLkq0wQytAC.
• Euclidean_algorithm wikiPageExternalLink v=onepage&q&f=false.
• Euclidean_algorithm wikiPageExternalLink ?id=hXGr-9l1DXcC.
• Euclidean_algorithm wikiPageExternalLink ?id=yMGeElJ8M0wC.
• Euclidean_algorithm wikiPageExternalLink index.html.
• Euclidean_algorithm wikiPageExternalLink Euclid.shtml.
• Euclidean_algorithm wikiPageExternalLink EuclidAlg.shtml.
• Euclidean_algorithm wikiPageExternalLink euclidean.html.
• Euclidean_algorithm wikiPageExternalLink kmath384.htm.
• Euclidean_algorithm wikiPageID "10377".
• Euclidean_algorithm wikiPageRevisionID "645209844".
• Euclidean_algorithm hasPhotoCollection Euclidean_algorithm.
• Euclidean_algorithm title "Euclid's algorithm".
• Euclidean_algorithm title "Euclidean Algorithm".
• Euclidean_algorithm urlname "EuclideanAlgorithm".
• Euclidean_algorithm urlname "EuclidsAlgorithm".
• Euclidean_algorithm subject Category:Articles_containing_proofs.
• Euclidean_algorithm subject Category:Articles_with_example_pseudocode.
• Euclidean_algorithm subject Category:Euclid.
• Euclidean_algorithm subject Category:Number_theoretic_algorithms.
• Euclidean_algorithm type Abstraction100002137.
• Euclidean_algorithm type Act100030358.
• Euclidean_algorithm type Activity100407535.
• Euclidean_algorithm type Algorithm105847438.
• Euclidean_algorithm type Event100029378.
• Euclidean_algorithm type NumberTheoreticAlgorithms.
• Euclidean_algorithm type Procedure101023820.
• Euclidean_algorithm type PsychologicalFeature100023100.
• Euclidean_algorithm type Rule105846932.
• Euclidean_algorithm type YagoPermanentlyLocatedEntity.
• Euclidean_algorithm comment "In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers, the largest number that divides both of them without leaving a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in Euclid's Elements (c.".
• Euclidean_algorithm label "Algorisme d'Euclides".
• Euclidean_algorithm label "Algorithme d'Euclide".
• Euclidean_algorithm label "Algoritma Euklidean".
• Euclidean_algorithm label "Algoritme van Euclides".
• Euclidean_algorithm label "Algoritmo de Euclides".
• Euclidean_algorithm label "Algoritmo de Euclides".
• Euclidean_algorithm label "Algoritmo di Euclide".
• Euclidean_algorithm label "Algorytm Euklidesa".
• Euclidean_algorithm label "Euclidean algorithm".
• Euclidean_algorithm label "Eukleidův algoritmus".
• Euclidean_algorithm label "Euklideszi algoritmus".
• Euclidean_algorithm label "Euklidischer Algorithmus".
• Euclidean_algorithm label "Öklid algoritması".
• Euclidean_algorithm label "Алгоритм Евклида".
• Euclidean_algorithm label "Алгоритъм на Евклид".
• Euclidean_algorithm label "ユークリッドの互除法".
• Euclidean_algorithm label "유클리드 호제법".
• Euclidean_algorithm sameAs Eukleidův_algoritmus.
• Euclidean_algorithm sameAs Euklidischer_Algorithmus.
• Euclidean_algorithm sameAs Αλγόριθμος_του_Ευκλείδη.
• Euclidean_algorithm sameAs Algoritmo_de_Euclides.
• Euclidean_algorithm sameAs Algorithme_d'Euclide.
• Euclidean_algorithm sameAs Algoritma_Euklidean.
• Euclidean_algorithm sameAs Algoritmo_di_Euclide.
• Euclidean_algorithm sameAs ユークリッドの互除法.
• Euclidean_algorithm sameAs 유클리드_호제법.
• Euclidean_algorithm sameAs Algoritme_van_Euclides.
• Euclidean_algorithm sameAs Algorytm_Euklidesa.
• Euclidean_algorithm sameAs Algoritmo_de_Euclides.
• Euclidean_algorithm sameAs m.02tbp.
• Euclidean_algorithm sameAs Q230848.
• Euclidean_algorithm sameAs Q230848.
• Euclidean_algorithm sameAs Euclidean_algorithm.
• Euclidean_algorithm wasDerivedFrom Euclidean_algorithm?oldid=645209844.
• Euclidean_algorithm depiction Euclid's_algorithm_Book_VII_Proposition_2_3.png.
• Euclidean_algorithm isPrimaryTopicOf Euclidean_algorithm.