Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:normal_order_theorem_for_ω(n)
|
| gptkbp:appliesTo |
natural numbers
|
| gptkbp:author |
gptkb:G._H._Hardy
gptkb:Srinivasa_Ramanujan |
| gptkbp:concerns |
number of prime factors
|
| gptkbp:field |
number theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hardy–Ramanujan theorem
|
| gptkbp:namedAfter |
gptkb:G._H._Hardy
gptkb:Srinivasa_Ramanujan |
| gptkbp:publicationYear |
1917
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Erdős–Kac_theorem
|
| gptkbp:state |
The normal order of the number of distinct prime factors of a number n is log log n
|
| gptkbp:bfsParent |
gptkb:G._H._Hardy
|
| gptkbp:bfsLayer |
5
|