Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On a conjecture of ErdŐs, Pólya and Turán on consecutive gaps between primes (1504.06860v1)

Published 26 Apr 2015 in math.NT

Abstract: Let p_n denote the sequence of all primes and let d_n=p_n-p_{n-1} denote the sequence of all gaps between consecutive primes. In 1948 Erd\H{o}s and Tur\'an showed that d_{n+1}-d_n changes sign infinitely often and together with P\'olya asked for a necessary and sufficient condition that a fixed linear combination of r>1 consecutive prime gaps d_{n+i} i=(1,2,...r) should change sign infinitely often as n runs through the sequence of all natural numbers. They conjectured that the condition is that the non zero values among the coefficients of the linear combination cannot all have the same sign but they could prove only much weaker relations. In the present work this conjecture is proved by the aid of the Maynard-Tao method and other important ideas of the recent work of W.D. Banks, T. Freiberg and J.Maynard (see arXiv:1404.59094v2).

Summary

We haven't generated a summary for this paper yet.