|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:describes
|
asymptotic distribution of prime numbers
|
|
gptkbp:field
|
number theory
|
|
gptkbp:hasApplication
|
cryptography
analytic number theory
|
|
gptkbp:hasApproximation
|
π(n) ~ n / log n
π(n) ~ Li(n)
|
|
gptkbp:implies
|
density of primes decreases as numbers grow
|
|
gptkbp:influencedBy
|
gptkb:Carl_Friedrich_Gauss
gptkb:Bernhard_Riemann
gptkb:Adrien-Marie_Legendre
|
|
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
gptkb:logarithmic_integral
|
|
gptkbp:state
|
the number of primes less than or equal to n is approximately n / log n
|
|
gptkbp:yearProved
|
1896
|
|
gptkbp:π(n)
|
number of primes less than or equal to n
|
|
gptkbp:bfsParent
|
gptkb:Handbuch_der_Lehre_von_der_Verteilung_der_Primzahlen
gptkb:Riemann's_1859_paper_"On_the_Number_of_Primes_Less_Than_a_Given_Magnitude"
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
prime number theorem
|