Is there any formula for calculating the count of prime factors of a number 'N'? I know the loose upper bound is log2(N) but is there a better upper bound? Thanks.
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Is there any formula for calculating the count of prime factors of a number 'N'? I know the loose upper bound is log2(N) but is there a better upper bound? Thanks.
Название |
---|
There is no deterministic solution as of now, but it is a very famous fact that Hardy and Ramanujan proved that "for most numbers" (in the probabilistic sense), the number of distinct prime factors of a number $$$n$$$ is $$$log(log(n))$$$.
Hardy-Ramanujan Theorem
Is there any way to find the maximum number of distinct prime factors of all the numbers in the range [1, N]?
Multiply first prime numbers while result is less than N.