A sum of squares not divisible by a prime
Number Theory
2018-05-09 v1
Abstract
Let be a prime. We define the smallest number such that every positive integer is a sum of at most squares of integers that are not divisible by . In this article, we prove that , , , and for any prime greater than . In particular, it is proved that every positive integer is a sum of at most four squares not divisible by , except the unique positive integer .
Cite
@article{arxiv.1805.03038,
title = {A sum of squares not divisible by a prime},
author = {Kyoungmin Kim and Byeong-Kweon Oh},
journal= {arXiv preprint arXiv:1805.03038},
year = {2018}
}
Comments
14 pages