|
2007-12-16, 18:50
|
#1 |
Jan 2005
Transdniestr
503 Posts |
Expected Number of Factors for numbers within a ra
Hello,
I was wondering if there's a simple formula to estimate the number of prime factors for a number in some range say a to b. For instance, between x=900 and x=1000, the expected number of prime factors is 3.04 ~ 3. |
|
|
|
2007-12-16, 22:33
|
#2 |
"Robert Gerbicz"
Oct 2005
Hungary
1,429 Posts |
It's very well known that the expected number of different prime factors for a large positive integer N is log(log(N))+O(1), this is also true if you write multiplicity instead of different. So the answer is also log(log(b))+O(1) for your question, supposing that b is large and a isn't very close to b.
You can prove this using Merten's theorem: sumprime(p=2,n,1/p)=log(log(n))+O(1) is enough for you. Last fiddled with by R. Gerbicz on 2007-12-16 at 22:35 |
|
|
|
|
2007-12-17, 13:48
|
#3 |
|
Jan 2005
Transdniestr
503 Posts |
Heh, not well enough I guess.
Thanks |
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Status page with expected number of Mersenne primes in each interval? | CRGreathouse | PrimeNet | 2 | 2018-01-10 06:13 |
| The expected number of primes | Batalov | Computer Science & Computational Number Theory | 5 | 2016-08-11 01:17 |
| Expected number of primes in OEIS A007908 | ewmayer | Probability & Probabilistic Number Theory | 6 | 2015-11-10 16:33 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
| What way would you find numbers with a set number of factors? | nibble4bits | Puzzles | 18 | 2006-01-07 10:40 |
