Representing integers as the sum of two squares in the ring Z_n

From MaRDI portal
Publication:2877901

zbMATH Open1316.11028arXiv1404.0187MaRDI QIDQ2877901FDOQ2877901


Authors: Joshua Harrington, Alicia Lamarche, Lenny Jones Edit this on Wikidata


Publication date: 28 August 2014

Published in: Journal of Integer Sequences (Search for Journal in Brave)

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 .


Full work available at URL: https://arxiv.org/abs/1404.0187

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (4)

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)