arXiv · 1408.4638
New algorithms for modular inversion and representation by binary quadratic forms arising from structure in the Euclidean algorithm
Abstract
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by the binary quadratic form $x^2 + 3xy + y^2$. The Euclidean algorithm is commenced with inputs from one of the families, and the first remainder less than a predetermined size produces the modular inverse or representation.
Explore related subjects
Keep this discovery
Christina Doran, Shen Lu, Barry R. Smith. 2014-08-20. New algorithms for modular inversion and representation by binary quadratic forms arising from structure in the Euclidean algorithm. https://doi.org/10.2140/involve.2017.10.541
Cite the original work for its findings. Save a collection to share your selection of sources.