English

On the Waring-Goldbach problem with almost equal summands

Number Theory 2019-03-06 v1

Abstract

We use transference principle to show that whenever ss is suitably large depending on k2k \geq 2, every sufficiently large natural number nn satisfying some congruence conditions can be written in the form n=p1k++pskn = p_1^k + \dots + p_s^k, where p1,,ps[xxθ,x+xθ]p_1, \dots, p_s \in [x-x^\theta, x + x^\theta] are primes, x=(n/s)1/kx = (n/s)^{1/k} and θ=0.525+ϵ\theta = 0.525 + \epsilon. We also improve known results for θ\theta when k2k \geq 2 and sk2+k+1s \geq k^2 + k + 1. For example when k4k \geq 4 and sk2+k+1s \geq k^2 + k + 1 we have θ=0.55+ϵ\theta = 0.55 + \epsilon. All previously known results on the problem had θ>3/4\theta > 3/4.

Keywords

Cite

@article{arxiv.1903.01824,
  title  = {On the Waring-Goldbach problem with almost equal summands},
  author = {Juho Salmensuu},
  journal= {arXiv preprint arXiv:1903.01824},
  year   = {2019}
}

Comments

38 pages

R2 v1 2026-06-23T07:58:40.543Z