加载中…
We use transference principle to show that whenever is suitably large depending on , every sufficiently large natural number satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^kp_1, \dots, p_s \in [x-x^\theta, x + x^\theta]x = (n/s)^{1/k}\theta = 0.525 + \epsilon\thetak \geq 2s \geq k^2 + k + 1k \geq 4s \geq k^2 + k + 1\theta = 0.55 + \epsilon$. All previously known results on the problem had .

生成讲解博客的中文版本

生成AI智能校验的中文版本