2000 character limit reached
Short intervals asymptotic formulae for binary problems with prime powers, II
Published 26 Oct 2018 in math.NT | (1810.11357v1)
Abstract: We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}{\ell_1}+p_{2}{\ell_2}$ and $n=p{\ell_1} + m{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are fixed integers, $p,p_1,p_2$ are prime numbers and $m$ is an integer.
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.