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.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Formula for count of prime factors of a number
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.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | rogerfederer07 | 2021-06-24 11:37:14 | 209 | Initial revision (published) |
Name |
---|