The k-tuple Prime Difference Champion

Abstract

Let Dk be a set with k distinct elements of integers such that d1<d2<·s<dk. We say Dk* is a k-tuple prime difference champion (k-tuple PDC) for primes x if the set Dk* is the most probable differences among k+1 primes up to x. Unconditionally we prove that the k-tuple PDCs go to infinity and further have asymptotically the same number prime factors when weighted by logarithmic derivative as the porimorials. Assuming an appropriate form of the Hardy-Littlewood Prime k-tuple Conjecture, we obtain that the k-tuple PDCs are infinite square-free numbers containing any large primorial as factor when x→ ∞.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…