Related papers: On General Prime Number Theorems with Remainder

Given a sequence of frequencies $\{\lambda_n\}_{n\geq1}$, a corresponding generalized Dirichlet series is of the form $f(s)=\sum_{n\geq 1}a_ne^{-\lambda_ns}$. We are interested in multiplicatively generated systems, where each number…

Let $\left[x\right]$ be the largest integer not exceeding $x$. For $0<\theta \leq 1$, let $\pi_{\theta}(x)$ denote the number of integers $n$ with $1 \leq n \leq x^{\theta}$ such that $\left[\frac{x}{n}\right]$ is prime and…

This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…

We prove a prime number theorem first for the classical Rankin-Selberg L-function $L(s,\pi\times\pi')$ over any Galois extension with $\pi$ and $\pi'$ unitary automorphic cuspidal representations of $GL_n$ and $GL_m$ respectively with at…

We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is…

In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…

Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) =…

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…

Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.

In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $\pi(n)$ which holds infinitely often.

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

We show the following bounds on the prime counting function $\pi(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{\pi(x)}{x / \log x} \geq \liminf_{x \rightarrow…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

Let $(a(n) : n \in \mathbb{N})$ denote a sequence of nonnegative integers. Let $0.a(1)a(2)...$ denote the real number obtained by concatenating the digit expansions, in a fixed base, of consecutive entries of $(a(n) : n \in \mathbb{N})$.…

This is a new proof of the tauberian theorem of complex Laplace transformation for getting a simple proof of the prime numbers theorem $\pi(x) \sim \frac{x}{\log(x)}$ for a largest real $x$.