#### Vol. 10, No. 4, 2017

 Recent Issues
 The Journal About the Journal Subscriptions Editorial Board Editors’ Interests Scientific Advantages Submission Guidelines Submission Form Ethics Statement Editorial Login Author Index Coming Soon Contacts ISSN: 1944-4184 (e-only) ISSN: 1944-4176 (print)
New algorithms for modular inversion and representation by the form $x^2 + 3xy + y^2$

### Christina Doran, Shen Lu and Barry R. Smith

Vol. 10 (2017), No. 4, 541–554
##### 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 representing 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.

##### Keywords
number theory, continued fraction, binary quadratic form, algorithm
Primary: 11A05