Beurling zeta function

From Wikipedia, the free encyclopedia
(Redirected from Beurling generalized prime)
Jump to navigation Jump to search

In mathematics, a Beurling zeta function is an analogue of the Riemann zeta function where the ordinary primes are replaced by a set of Beurling generalized primes: any 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[definition needed]. 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.

See also

[edit | edit source]

References

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).