相关论文: A remark on an inequality for the prime counting f…

A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.

Consider the positive integers $n$ such that $n$ divides the $n$-th Fibonacci number, and their counting function $A$. We prove that \[A(x) \leq x^{1-(1/2+o(1))\log\log\log x/\log\log x}.\]

Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the…

Based on the first 25 known values of Pi(10^n), the number of primes less than 10^n, with n integer between 1 and 25, we propose a conjectured value range of Pi(10^26) calculated by using polynomial interpolations with two corrective…

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.

In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

We prove several asymptotic continued fraction expansions of $\pi(x)$, $\Pi(x)$, $\operatorname{li}(x)$, $\operatorname{Ri}(x)$, and related functions, where $\pi(x)$ is the prime counting function, $\Pi(x) = \sum_{k = 1}^\infty…

In this article, we show that $$ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right| \le 0.1038 \log T + 0.2573 \log\log T + 9.3675 $$ where $N(T)$ denotes the number of non-trivial zeros $\rho$, with $0<\Im(\rho)…

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…

Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…

We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $\pi(n)$, the prime-counting function. We also obtain that $\pi(n) \sim n a_n$ and we estimate…

Let $G(X)$ denote the size of the largest gap between consecutive primes below $X$. Answering a question of Erdos, we show that $$G(X) \geq f(X) \frac{\log X \log \log X \log \log \log \log X}{(\log \log \log X)^2},$$ where $f(X)$ is a…

Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…

In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $\pi(x)$ holds for every $x…

We provide an elementary proof of the left side inequality and improve the right inequality in \bigg[\frac{n!}{x-(x^{-1/n}+\alpha)^{-n}}\bigg]^{\frac{1}{n+1}}&<((-1)^{n-1}\psi^{(n)})^{-1}(x)…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

We prove that the Riemann hypothesis is equivalent to the condition $\int_{2}^x\left(\pi(t)-\text{li}(t)\right)\mathrm{d}t<0$ for all $x>2$. Here, $\pi(t)$ is the prime-counting function and $\text{li}(t)$ is the logarithmic integral. This…

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…

We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.