2017MathematikaRequires access

PRIME NUMBER THEOREM EQUIVALENCES AND NON‐EQUIVALENCES

Harold G. Diamond, Wenbin Zhang

Open publisher page 9 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Mathematics, Prime (order theory), Prime number, Multiplicative number theory, Prime number theorem, Pure mathematics, Discrete mathematics, Algebra over a field

Related papers

Back to paper searchBrowse research topicsOriginal source
PRIME NUMBER THEOREM EQUIVALENCES AND NON‐EQUIVALENCES — Research Paper | ScholarLens