Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Beurling_zeta_function> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Beurling_zeta_function abstract "In mathematics, a Beurling zeta function is an analogue of the Riemann zeta function where the ordinary primes are replaced by Beurling generalized primes: a sequence of real numbers greater than 1 that tend to infinity. These were introduced by Beurling (1937).A Beurling generalized integer is a number that can be written as a product of Beurling generalized primes. Beurling generalized the usual prime number theorem to Beurling generalized primes. He showed that if the number N(x) of Beurling generalized integers less than x is of the form N(x) = Ax + O(x log−γx) with γ > 3/2 then the number of Beurling generalized primes less than x is asymptotic to x/log x, just as for ordinary primes, but if γ = 3/2 then this conclusion need not hold.".
- Beurling_zeta_function wikiPageID "31365520".
- Beurling_zeta_function wikiPageRevisionID "583837995".
- Beurling_zeta_function hasPhotoCollection Beurling_zeta_function.
- Beurling_zeta_function subject Category:Zeta_and_L-functions.
- Beurling_zeta_function comment "In mathematics, a Beurling zeta function is an analogue of the Riemann zeta function where the ordinary primes are replaced by Beurling generalized primes: a sequence of real numbers greater than 1 that tend to infinity. These were introduced by Beurling (1937).A Beurling generalized integer is a number that can be written as a product of Beurling generalized primes. Beurling generalized the usual prime number theorem to Beurling generalized primes.".
- Beurling_zeta_function label "Beurling zeta function".
- Beurling_zeta_function sameAs m.0gkzqff.
- Beurling_zeta_function sameAs Q4899294.
- Beurling_zeta_function sameAs Q4899294.
- Beurling_zeta_function wasDerivedFrom Beurling_zeta_function?oldid=583837995.
- Beurling_zeta_function isPrimaryTopicOf Beurling_zeta_function.