2000 character limit reached
On the Waring-Goldbach problem on average
Published 15 Jun 2018 in math.NT | (1806.05861v2)
Abstract: Let $s$, $\ell$ be two integers such that $2\le s\le \ell-1$, $\ell\ge 3$. We prove that a suitable asymptotic formula for the average number of representations of integers $n=\sum_{i=1}{s} p_{i}{\ell}$, where $p_i$, $i=1,\dotsc,s$, are prime numbers, holds in short intervals.
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.