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 z can be written as the sum of two squares if and only if all prime factors q of z, with qequiv3pmod4, have even exponent in the prime factorization of z. One can consider a minor variation of this theorem by not allowing the use of zero as a summand in the representation of z as the sum of two squares. Viewing each of these questions in , the ring of integers modulo n, we give a characterization of all integers nge2 such that every can be written as the sum of two squares in .





Describes a project that uses

Uses Software





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)