![On the computation of the GCD (LCM) of 2-d polynomials N. P. Karampetakis Department of Mathematics Aristotle University of Thessaloniki Thessaloniki 54006, - ppt download On the computation of the GCD (LCM) of 2-d polynomials N. P. Karampetakis Department of Mathematics Aristotle University of Thessaloniki Thessaloniki 54006, - ppt download](https://images.slideplayer.com/17/5359504/slides/slide_33.jpg)
On the computation of the GCD (LCM) of 2-d polynomials N. P. Karampetakis Department of Mathematics Aristotle University of Thessaloniki Thessaloniki 54006, - ppt download
![Euclid's Ancient Recipe. The oldest algorithm still in use which… | by Karl Beecher | Great Moments in Computing History | Medium Euclid's Ancient Recipe. The oldest algorithm still in use which… | by Karl Beecher | Great Moments in Computing History | Medium](https://miro.medium.com/v2/resize:fit:781/1*hfyj9CPxreA4UrjSMf9ELA.png)
Euclid's Ancient Recipe. The oldest algorithm still in use which… | by Karl Beecher | Great Moments in Computing History | Medium
GitHub - margaritageleta/polynomial-calculator: Polynomial calculator, with love 💕 (Contains the secret implementation of the Complex polynomials !!!!!)
![GCD / polynomial GCD online calculator: Calculate the greatest common divisor of integers and polynomials - @QED GCD / polynomial GCD online calculator: Calculate the greatest common divisor of integers and polynomials - @QED](https://storage.googleapis.com/atqed/math/arithmetic/gcd_2.png)