normal order theorem for ω(n)
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
natural numbers
|
| gptkbp:describes |
distribution of the number of distinct prime divisors of n
|
| gptkbp:functionInvolved |
ω(n)
|
| https://www.w3.org/2000/01/rdf-schema#label |
normal order theorem for ω(n)
|
| gptkbp:introduced |
gptkb:G._H._Hardy
gptkb:Srinivasa_Ramanujan |
| gptkbp:normalOrderOf |
ω(n) is log log n
|
| gptkbp:provenBy |
gptkb:Paul_Erdős
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Erdős–Kac_theorem
number theory |
| gptkbp:state |
for most n ≤ x, ω(n) is close to log log n
|
| gptkbp:bfsParent |
gptkb:Hardy–Ramanujan_theorem
|
| gptkbp:bfsLayer |
6
|