The remainders of the Euclidean algorithm with symmetric quotients
Number Theory
2014-02-07 v2
Abstract
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
Keywords
Cite
@article{arxiv.1307.3649,
title = {The remainders of the Euclidean algorithm with symmetric quotients},
author = {Barry R. Smith},
journal= {arXiv preprint arXiv:1307.3649},
year = {2014}
}
Comments
6 pages