English

Short intervals asymptotic formulae for binary problems with prime powers

Number Theory 2019-08-21 v2

Abstract

We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms n=p11+p22n=p_{1}^{\ell_1}+p_{2}^{\ell_2}, with 1,2{2,3}\ell_1, \ell_2\in\{2,3\}, 1+25\ell_1+\ell_2\le 5 are fixed integers, and n=p1+m2n=p^{\ell_1} + m^{\ell_2}, with 1=2\ell_1=2 and 22112\le \ell_2\le 11 or 1=3\ell_1=3 and 2=2 \ell_2=2 are fixed integers, p,p1,p2p,p_1,p_2 are prime numbers and mm is an integer.

Keywords

Cite

@article{arxiv.1806.05373,
  title  = {Short intervals asymptotic formulae for binary problems with prime powers},
  author = {Alessandro Languasco and Alessandro Zaccagnini},
  journal= {arXiv preprint arXiv:1806.05373},
  year   = {2019}
}

Comments

Accepted (Nov. 2017) for publication in Journal de Theorie des Nombres de Bordeaux. Two references updated

R2 v1 2026-06-23T02:29:37.765Z