加载中…
We prove that, for any , every sufficiently large odd number can be represented as the sum of three primes $N = p_1 + p_2 +p_3p_i = \lfloor n_{i}^{c_i}\rfloorn_i \in{\mathbb N}1 \leq i \leq 3$. Our arguments are based on a variant of Green’s transference principle due to Matom"aki, Maynard and Shao. We prove a necessary restriction estimate using Bourgain’s strategy and employ Harman’s sieve method to optimize our upper bound for .

生成讲解博客的中文版本

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