Representing integers as the sum of two squares in the ring Z_n
From MaRDI portal
Publication:2877901
Abstract: A classical theorem in number theory due to Euler states that a positive integer can be written as the sum of two squares if and only if all prime factors of , with , have even exponent in the prime factorization of . One can consider a minor variation of this theorem by not allowing the use of zero as a summand in the representation of as the sum of two squares. Viewing each of these questions in , the ring of integers modulo , we give a characterization of all integers such that every can be written as the sum of two squares in .
Recommendations
- Refinements of Lagrange’s Four-Square Theorem
- scientific article; zbMATH DE number 409823
- When is \(n^2\) a sum of \(k\) squares?
- scientific article; zbMATH DE number 6521438
- Representation of integers of the form \(x^2 + my^2 - z^2\)
- On Representing a Square as the Sum of Three Squares
- A Combinatorial Approach to Sums of Two Squares and Related Problems
- The gaps between sums of two squares
- Sums of squares, infinite descent, and Aubry's theorem
- On the sum of a prime and two prime squares
Cited in
(4)
This page was built for publication: Representing integers as the sum of two squares in the ring \(\mathbb Z_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2877901)