Finding Sums of Four Squares via Complex Continued Fractions

From MaRDI portal



Abstract: The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd n one can find a representation by doing arithmetic in a maximal order of quaternion algebra once a pair of (positive) integers x,y with x2+y2equiv−1modn is given. In this paper, we introduce a new method to find a representation of odd integer w given x,y satisfying the above requirement. This method can avoid the complicated non-commutative structure in quaternion algebra, which is similar to the one we use to obtain a representation of a prime pequiv1mod4 as sum of two squares by doing continued fraction expansions, except that here we will expand complex number using Hurwitz algorithm.













This page was built for publication: Finding Sums of Four Squares via Complex Continued Fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397976)