Editor's Corner: The Euclidean Algorithm Strikes Again

DOI10.2307/2323912zbMath0735.11015OpenAlexW2274434947MaRDI QIDQ3982579

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

zbMATH Keywords

Euclidean algorithmsum of squaresrepresentation of primesleast quadratic nonresidue

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (6)

Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$ ⋮ On primitive solutions of the Diophantine equation \(x^2 + y^2 = M\) ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ Euler’s E228: Primality Testing and Factoring via Sums of Squares ⋮ Unnamed Item ⋮ Paley and the Paley Graphs

This page was built for publication: Editor's Corner: The Euclidean Algorithm Strikes Again