Editor's Corner: The Euclidean Algorithm Strikes Again
From MaRDI portal
Publication:3982579
Cited in
(16)- Euclidean algorithm modulo 4 and the rotation group \(S_2\times [3,4]^+\)
- scientific article; zbMATH DE number 2149952 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7734739 (Why is no real title available?)
- 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\)
- Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$
- Dancing elves and a flower’s view of euclid’s algorithm
- Windmills of the minds: a hopping algorithm for Fermat's two squares theorem
- New algorithms for modular inversion and representation by the form \(x^2+ 3xy + y^2\)
- Paley and the Paley Graphs
- scientific article; zbMATH DE number 3799727 (Why is no real title available?)
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)