Related papers: A Direct Proof of the Prime Number Theorem using R…

For a real number $k$, define $\pi_k(x) = \sum_{p\le x} p^k$. When $k>0$, we prove that $$ \pi_k(x) - \pi(x^{k+1}) = \Omega_{\pm}\left(\frac{x^{\frac12+k}}{\log x} \log\log\log x\right) $$ as $x\to\infty$, and we prove a similar result when…

Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli…

As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of…

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

We prove some properties of the sequence $\{a_n\}_{n\ge1}$ defined by $a_n=\pi(n)-\pi\bigl(\textstyle\sum_{k=1}^{n-1}a_k\bigr).$

Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…

In this paper, we generalize Mauduit and Rivat's theorem on the Rudin-Shapiro sequence. Weakening the hypothesis needed in their theorem, we prove a prime number theorem for a large class of functions defined on the digits. Our result…

Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by $\pi$ G (x) the number of primes in the floor function set G(x) := {[ x n ] : 1 n x} and by S 1 P (x) the number of primes…

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

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…

In this article we provide new explicit Chebyshev's bounds for the prime counting function $\psi(x)$. The proof relies on two new arguments: smoothing the prime counting function which allows to generalize the previous approaches, and a new…

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

In this essay, we see how prime cyclotomic fields (cyclotomic fields obtained by adjoining a primitive p-th root of unity to Q, where p is an odd prime) can lead to elegant proofs of number theoretical concepts. We namely develop the notion…

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…

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 asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the non-real zeros of $\zeta(s)$, that the set of real numbers $x\ge2$ for which $\pi(x)>$ li$(x)$ has a logarithmic…