The prime number theorem for Beurling's generalized numbers. New cases

Jan-Christoph Schlage-Puchta; Jasson Vindas

Displaying similar documents to “The prime number theorem for Beurling's generalized numbers. New cases”

Tauberian Constants Connected with the Prime Number Theorem II: Computational Aspects.

Harry Gretton, Ken Jukes (1978/79)

Mathematische Zeitschrift

Similarity:

A note on numbers with a large prime factor III

K. Ramachandra (1971)

Acta Arithmetica

Similarity:

On prime numbers p,q and r such that pq, pr, and qr are pseudoprimes

K. Szymiczek (1964)

Colloquium Mathematicae

Similarity:

Pocklington's Theorem and Bertrand's Postulate

Marco Riccardi (2006)

Formalized Mathematics

Similarity:

The first four sections of this article include some auxiliary theorems related to number and finite sequence of numbers, in particular a primality test, the Pocklington's theorem (see [19]). The last section presents the formalization of Bertrand's postulate closely following the book [1], pp. 7-9.

On the Properties of the Möbius Function

Magdalena Jastrzebska, Adam Grabowski (2006)

Formalized Mathematics

Similarity:

We formalized some basic properties of the Möbius function which is defined classically as [...] as e.g., its multiplicativity. To enable smooth reasoning about the sum of this number-theoretic function, we introduced an underlying many-sorted set indexed by the set of natural numbers. Its elements are just values of the Möbius function.The second part of the paper is devoted to the notion of the radical of number, i.e. the product of its all prime factors.The formalization (which is...