On monochromatic representation of sums of squares of primes

arXiv1710.07767MaRDI QIDQ6292843FDOQ6292843

Authors: Kummari Mallesham, Gyan Prakash, D. S. Ramana 

Publication date: 21 October 2017

Abstract: When the sequences of squares of primes is coloured with $K$ colours, where $Kgeq1$ is an integer, let $s(K)$ be the smallest integer such that each sufficiently large integer can be written as a sum of no more than $s(K)$ squares of primes, all of the same colour. We show that $s(K)llKexpleft(frac(3log2+mo(1))logKloglogKight)$ for $Kgeq2$. This improves on $s(K)l{l}_{epsilon}{K}^{2+epsilon}$, which is the best available upper bound for $s(K)$.

This page was built for publication: On monochromatic representation of sums of squares of primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6292843)