On the gap distribution of prime factors

Abstract

Let \pj(n)\j=1ω(n) denote the increasing sequence of distinct prime factors of an integer n. For z≥slant 0, let G(n;z) denote the number of those indexes j such that pj+1(n)>pj(n) z. We show uniform convergence, with almost optimal effective estimate of the speed, of the distribution of G(n;z) on \n:1≤slant n≤slant N\ to a Gaussian limit law with mean e-z2n and variance \ e-z-2z e-2z\2n, and we establish an asymptotic formula with remainder for all centered moments.

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…