Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

IPL
2008

favoriteEmaildiscussreport

82views more IPL 2008»

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

13 years 4 months ago

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

Download www.cs.umd.edu

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. Key words: Chernoff bounds, probabilistic number theory, primes, tail bounds, dependent random variables, randomized algorithms

Aravind Srinivasan

Real-time Traffic

Chernoff Bounds | Chernoff-Hoeffding Bounds | Chernoff-type Upper-tail Bound | IPL 2008 |

claim paper

Related Content

» A Note on Integer Factorization Using Lattices

» The period of the Bell numbers modulo a prime

» Fast Bounds on the Distribution of Smooth Numbers

» Fast Parallel Molecular Algorithms for DNAbased Computation Factoring Integers

» On Factoring Arbitrary Integers with Known Bits

» Proving in ZeroKnowledge that a Number Is the Product of Two Safe Primes

» The number field sieve for integers of low weight

» Generating Arithmetically Equivalent Number Fields with Elliptic Curves

» Estimating the PrimeFactors of an RSA Modulus and an Extension of the Wiener Attack

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Aravind Srinivasan

Comments (0)