An Erd\H{o}s-Kac theorem for integers with dense divisors

From MaRDI portal
Publication:6416852



Abstract: We show that for large integers n, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean Clog2n and variance Vlog2n, where C=1/(1−e−gamma)approx2.280 and Vapprox0.414. This result is then generalized in two different directions.














This page was built for publication: An Erd\H{o}s-Kac theorem for integers with dense divisors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6416852)