2000 character limit reached
A density theorem for prime squares
Published 27 Feb 2025 in math.NT | (2502.20322v2)
Abstract: Let $s\geq 8$ be an integer and $P$ be a set of primes with relative lower density greater than $\sqrt{1-\min{s,16}/32}$. We prove that every sufficiently large integer $n\equiv s({\rm mod}24)$ can be represented by a sum of $s$ squares of primes in $P$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.