- Euclid's algorithm
- noun see Euclidean algorithm
New Collegiate Dictionary. 2001.
Euclid's algorithm
Look at other dictionaries:
euclid's algorithm — ˈyüklə̇dz noun Usage: often capitalized E : a rule for finding the greatest common divisor of two positive integers … Useful english dictionary
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Euclid's lemma — (Greek polytonic|λῆμμα ) is a generalization of Proposition 30 of Book VII of Euclid s Elements . The lemma states that:If a positive integer divides the product of two other positive integers, and the first and second integers are coprime, then… … Wikipedia
Euclid Discoveries — is a privately held software development firm based in Concord, MA focused on next generation video processing and compression technology. In order to address consumer demand for high quality video on any video enabled device, the company… … Wikipedia
algorithm — algorithmic, adj. /al geuh ridh euhm/, n. a set of rules for solving a problem in a finite number of steps, as for finding the greatest common divisor. [1890 95; var. of ALGORISM, by assoc. with Gk arithmós number. See ARITHMETIC] * * * Procedure … Universalium
Euclid — Infobox Scientist name = Euclid image width = caption = birth date = fl. 300 BC residence = Alexandria, Egypt ethnicity = Greek field = Mathematics known for = Euclid s Elements Euclid (Greek: . polytonic|Εὐκλείδης mdash; Eukleidēs), fl. 300 BC,… … Wikipedia
Euclid — /yooh klid/, n. 1. fl. c300 B.C., Greek geometrician and educator at Alexandria. 2. a city in NE Ohio, near Cleveland. 59,999. * * * flourished с 300 BC, Alexandria, Egypt Greek mathematician of antiquity, known primarily for his highly… … Universalium
Euclid's orchard — In mathematics Euclid s orchard is an array of one dimensional trees of unit height planted at the lattice points in one quadrant of a square lattice. [MathWorld|urlname=EuclidsOrchard|title=Euclid s Orchard] More formally, Euclid s orchard is… … Wikipedia
Euclidean algorithm — In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does… … Wikipedia
Binary GCD algorithm — The binary GCD algorithm is an algorithm which computes the greatest common divisor of two nonnegative integers. It gains a measure of efficiency over the ancient Euclidean algorithm by replacing divisions and multiplications with shifts, which… … Wikipedia
