Related papers: Short effective intervals containing primes

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

Let $\eta$ be a quadratic irrationality. The variant of a ternary problem of Goldbach involving primes such that $a<\{\eta p\}<b$, where $a$ and $b$ are arbitrary numbers of the interval $(0,1)$, solved in this paper.

Let $0<\gamma_1\leq \gamma_2\leq \ldots$ denote the positive ordinates of the non-trivial zeros of the Riemann zeta-function. A result first announced by Selberg states that there exist absolute constants $\Theta, \vartheta>0$ such that for…

Let $f(z)=\sum_{n=1}^\infty a(n)q^n\in S^{\text{new}}_ k (\Gamma_0(N))$ be a newform with squarefree level $N$ that does not have complex multiplication. For a prime $p$, define $\theta_p\in[0,\pi]$ to be the angle for which $a(p)=2p^{( k…

Let $E/\mathbb{Q}$ be an elliptic curve that has complex multiplication (CM) by an imaginary quadratic field $K$. For a prime $p$, there exists $\theta_p \in [0, \pi]$ such that $p+1-\#E(\mathbb{F}_p) = 2\sqrt{p} \cos \theta_p$. Let $x>0$…

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…

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

In this article, we prove an "equivalence" between two higher even moments of primes in short intervals under Riemann Hypothesis. We also provide numerical evidence in support of these asymptotic formulas.

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…

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

Let $E_k$ be the set of positive integers having exactly $k$ prime factors. We show that almost all intervals $[x,x+\log^{1+\varepsilon} x]$ contain $E_3$ numbers, and almost all intervals $[x,x+\log^{3.51} x]$ contain $E_2$ numbers. By…

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

For a set of primes $\mathcal{P}$, let $\Psi(x, \mathcal{P})$ be the number of positive integers $n \leq x$ all of whose prime factors lie in $\mathcal{P}$. In this paper we classify the sets of primes $\mathcal{P}$ such that $\Psi(x,…

Hilberdink showed that there exists a constant $c_0>2$, such that there exists a continuous prim system satisfying $N(x)=c(x-1)+1$ if and only if $c\leq c_0$. Here we determine $c_0$ numerically to be $1.25479\cdot 10^{19}\pm2\cdot…

We use exponent pairs to establish the existence of many $x^a$-smooth numbers in short intervals $[x-x^b,x]$, when $a>1/2$. In particular, $b=1-a-a(1-a)^3$ is admissible. Assuming the exponent-pairs conjecture, one can take…

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\le 1$ has either mean value…