Related papers: An Elementary Proof of the Prime Number Theorem ba…

In this paper, we prove the following result: {quote} Let $\A$ be an infinite set of positive integers. For all positive integer $n$, let $\tau_n$ denote the smallest element of $\A$ which does not divide $n$. Then we have $$\lim_{N \to +…

We show that the M\"obius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this…

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

We survey the classical results on the prime number theorem

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

In this article, we study the summatory function \begin{equation*} W(x)=\sum_{n\leq x}(-2)^{\Omega(n)}, \end{equation*} where $\Omega(n)$ counts the number of prime factors of $n$, with multiplicity. We prove $W(x)=O(x)$, and in particular,…

In this paper, we derive new properties of the Mertens function and discuss a likely upper bound of the absolute value of the Mertens function $\sqrt{\log{x!}}>|M(x)|$ when $x>1$. Using this likely bound we show that we have a sufficient…

We investigate Sarnak's conjecture on the M\"obius function in the special case when the test function is the indicator of the set of integers for which a real additive function assumes a given value.

The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example,…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

Let $\phi(\cdot)$ and $\sigma(\cdot)$ denote the Euler function and the sum of divisors function, respectively. In this paper, we give a lower bound for the number of positive integers $m\le x$ for which the equation $m=n-\phi(n)$ has no…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

This article provides a proof of the famous \textit{Prime Number Theorem} by establishing an analogous statement of the same in terms of the second \textit{Chebyshev Function} $\psi(x)$. We shall be extensively using complex analytic…

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is…

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp…

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…