Arbitrarily long strings of consecutive primes in special sets

Abstract

Let F(x) be a function of the form Σi=1r di xi where d1,…,dr∈R, 0 ≤ 1 < … < r, r ∈ Z,i ∈ R for 1 ≤ i ≤ r and dr=0. We prove that sets of the form \ n ∈ N: \ F(n) \ ∈ U \ for any non-empty open set U ⊂ [0,1) contain arbitrarily long strings of consecutive primes.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…