arXiv Analytics

Sign in

arXiv:1805.03038 [math.NT]AbstractReferencesReviewsResources

A sum of squares not divisible by a prime

Kyoungmin Kim, Byeong-Kweon Oh

Published 2018-05-08Version 1

Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and $S(p)=4$ for any prime $p$ greater than $5$. In particular, it is proved that every positive integer is a sum of at most four squares not divisible by $5$, except the unique positive integer $79$.

Comments: 14 pages
Categories: math.NT
Subjects: 11E25, 11E45
Related articles: Most relevant | Search more
arXiv:1806.00296 [math.NT] (Published 2018-06-01)
On the smallest number of terms of vanishing sums of units in number fields
arXiv:1007.5485 [math.NT] (Published 2010-07-30)
On the length of binary forms
arXiv:1901.09053 [math.NT] (Published 2019-01-25)
Seeds for Generalized Taxicab Numbers