A note on the distribution of the number of prime factors of the integers

  • Authors:

  • Aravind Srinivasan

  • Affiliations:

  • Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA

  • Venue:
  • Information Processing Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.89

Visualization

Abstract

The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors of a random integer in {1,2,...,n}. The method illustrates tail bounds in negatively-correlated settings.