PRIME NUMBER THEOREM EQUIVALENCES AND NON‐EQUIVALENCES
Harold G. Diamond, Wenbin Zhang
Abstract
Harold G. Diamond, Wenbin Zhang
Abstract
There are several formulas in classical prime number theory that are said to be “equivalent” to the Prime Number Theorem. For Beurling generalized numbers, not all such implications hold unconditionally. Here we investigate conditions under which the Beurling version of these relations do or do not hold.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
There are several formulas in classical prime number theory that are said to be “equivalent” to the Prime Number Theorem. For Beurling generalized numbers, not all such implications hold unconditionally. Here we investigate conditions under which the Beurling version of these relations do or do not hold.
Key concepts: Mathematics, Prime (order theory), Prime number, Multiplicative number theory, Prime number theorem, Pure mathematics, Discrete mathematics, Algebra over a field