Skip to search formSkip to main contentSkip to account menu

Euclidean algorithm

Known as: Euclids algorithm, Game of Euclid, Euclidean 
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
1996
Review
1996
  • F. Winkler
  • 1996
  • Corpus ID: 29546558
The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from… 
Highly Cited
1991
Highly Cited
1991
Highly Cited
1987
Highly Cited
1987
On etablit un theoreme de substitution de solutions analytiques a une C n -solution d'un systeme d'equations differentielles… 
Highly Cited
1983
Highly Cited
1983
Highly Cited
1978
Highly Cited
1978
The majority of students who take courses in number theory are mathematics majors who will not become number theorists. Many of… 
1972
1972
An improvement is given to the method of Hermite for finding a and b in p = a2 + b2, where p is a prime 3 1 (mod 4).