Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Waring-Goldbach problem with almost equal summands

Published 5 Mar 2019 in math.NT | (1903.01824v1)

Abstract: We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1k + \dots + p_sk$, where $p_1, \dots, p_s \in [x-x\theta, x + x\theta]$ are primes, $x = (n/s){1/k}$ and $\theta = 0.525 + \epsilon$. We also improve known results for $\theta$ when $k \geq 2$ and $s \geq k2 + k + 1$. For example when $k \geq 4$ and $s \geq k2 + k + 1$ we have $\theta = 0.55 + \epsilon$. All previously known results on the problem had $\theta > 3/4$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.