|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:category
|
theorems in number theory
|
|
gptkbp:describes
|
asymptotic distribution of prime numbers
|
|
gptkbp:field
|
number theory
|
|
gptkbp:form
|
π(n) ~ n / log(n)
|
|
gptkbp:generalizes
|
gptkb:Prime_Number_Theorem_for_arithmetic_progressions
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Primzahlsatz
|
|
gptkbp:implies
|
primes become less common as numbers grow larger
|
|
gptkbp:influenced
|
analytic number theory
|
|
gptkbp:language
|
gptkb:German
|
|
gptkbp:provenBy
|
gptkb:Charles_Jean_de_la_Vallée-Poussin
gptkb:Jacques_Hadamard
|
|
gptkbp:relatedTo
|
gptkb:Gauss's_conjecture
gptkb:Riemann_zeta_function
gptkb:Legendre's_conjecture
|
|
gptkbp:state
|
the number of primes less than or equal to n is approximately n / log(n)
|
|
gptkbp:uses
|
complex analysis
properties of the Riemann zeta function
|
|
gptkbp:yearProved
|
1896
|
|
gptkbp:π(n)
|
gptkb:prime-counting_function
|
|
gptkbp:英文名
|
gptkb:Prime_Number_Theorem
|
|
gptkbp:bfsParent
|
gptkb:Analytische_Zahlentheorie
gptkb:Satz_von_Wilson
|
|
gptkbp:bfsLayer
|
6
|