%0 Journal Article %J Information Processing Letters %D 2008 %T A note on the distribution of the number of prime factors of the integers %A Srinivasan, Aravind %K Chernoff bounds %K Dependent random variables %K Primes %K Probabilistic number theory %K randomized algorithms %K Tail bounds %X 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. %B Information Processing Letters %V 109 %P 133 - 135 %8 2008/12/31/ %@ 0020-0190 %G eng %U http://www.sciencedirect.com/science/article/pii/S0020019008002688 %N 2 %R 10.1016/j.ipl.2008.09.010