# On the Waring-Goldbach problem with almost equal summands

## TL;DR

This paper advances the understanding of the Waring-Goldbach problem by employing the transference principle to show that large integers can be expressed as sums of prime k-th powers within almost equal intervals, improving bounds on the interval size.

## Contribution

It introduces new bounds on the interval size for primes in the Waring-Goldbach problem, reducing the previously known interval size from over 3/4 to approximately 0.525 to 0.55, depending on parameters.

## Key findings

- Established that large integers can be represented as sums of prime k-th powers within short intervals.
- Improved bounds on the interval size parameter  for various values of k and s.
- Extended previous results by lowering the  threshold from over 3/4 to about 0.525-0.55.

## 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_1^k + \dots + p_s^k$, 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 k^2 + k + 1$. For example when $k \geq 4$ and $s \geq k^2 + k + 1$ we have $\theta = 0.55 + \epsilon$. All previously known results on the problem had $\theta > 3/4$.