On the consecutive prime divisors of an integer

Abstract

Paul Erd˝os, Janos Galambos and others have studied the relative size of the consecutive prime divisors of an integer. Here, we further extend this study by examining the distribution of the consecutive neighbour spacings between the prime divisors p 1 ( n ) < p 2 ( n ) < · · · < p r ( n ) of a typical integer n ≥ 2. In particular, setting γ j ( n ) := log p j ( n ) / log p j +1 ( n ) for j = 1 , 2 , . . . , r − 1 and, for any λ ∈ (0 , 1], introducing U λ ( n ) := # { j ∈ { 1 , 2 , . . . , r − 1 } : γ j ( n ) < λ } , we establish the mean value of U λ ( n ) and prove that U λ ( n ) /r ∼ λ for almost all integers n ≥ 2. We also examine the shifted prime version of these two results and study other related functions.