Editor's Corner: The Euclidean Algorithm Strikes Again
From MaRDI portal
Publication:3982579
DOI10.2307/2323912zbMATH Open0735.11015OpenAlexW2274434947MaRDI QIDQ3982579FDOQ3982579
Authors: Stan Wagon 
Publication date: 26 June 1992
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2323912
Recommendations
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Quadratic and bilinear Diophantine equations (11D09) Number-theoretic algorithms; complexity (11Y16)
Cited In (16)
- Euclidean algorithm modulo 4 and the rotation group \(S_2\times [3,4]^+\)
- Title not available (Why is that?)
- Continuants and some decompositions into squares
- Sums of Two Squares Visualized
- On the two-square theorem and the modular group.
- Quadratic Polynomials which have a High Density of Prime Values
- Title not available (Why is that?)
- Euler's E228: primality testing and factoring via sums of squares
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
- On primitive solutions of the Diophantine equation \(x^2 + y^2 = M\)
- Dancing elves and a flower’s view of euclid’s algorithm
- Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$
- Windmills of the minds: a hopping algorithm for Fermat's two squares theorem
- Paley and the Paley Graphs
- New algorithms for modular inversion and representation by the form \(x^2+ 3xy + y^2\)
- Title not available (Why is that?)
This page was built for publication: Editor's Corner: The Euclidean Algorithm Strikes Again
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982579)
