Related papers: New bounds for the prime counting function \pi(x)

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…

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…

By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…

This article provides a proof that the Ramanujan's Inequality given by, $$\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$$ holds unconditionally for every $x\geq \exp(43.5102147)$. In case for an alternate proof of the result stated…

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…

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the…

The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers

We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

This paper describes some of the ideas used in the development of our work on small gaps between primes.

The paper contains lower bounds on the counting function of the positive eigenvalues of the interior transmission problem when the latter is elliptic. In particular, these bounds justify the existence of an infinite set of interior…

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…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - \Delta^{-1}), x]$.

The work is devoted to the construction of a new interval arithmetic which would combine algorithmic efficiency and high quality estimation of the ranges of expressions.

We give a new elementary proof of Landau's Prime Ideal Theorem. The proof is an extension of Richter's proof of the Prime Number Theorem. The main result contains other results related to the equidistribution of the prime ideal counting…