加载中…
Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of differences between consecutive primes is bounded by for sufficiently large and any fixed . The proof relies on utilising various mean-value estimates for Dirichlet polynomials.

生成讲解博客的中文版本

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