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

DOI10.1016/J.IPL.2008.09.010zbMath1191.68856OpenAlexW1981276883MaRDI QIDQ975547

Aravind Srinivasan

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.010

zbMATH Keywords

primesrandomized algorithmsChernoff boundsdependent random variablesprobabilistic number theorytail bounds

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cites Work

• Approximate formulas for some functions of prime numbers
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the distribution of the number of prime factors of the integers