Finding Sums of Four Squares via Complex Continued Fractions

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+y2-1 n 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 p14 as sum of two squares by doing continued fraction expansions, except that here we will expand complex number using Hurwitz algorithm.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…