Related papers: Primes in explicit short intervals on RH
Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…
In previous work, the first author obtained conjecturally sharp upper bounds for the joint moments of the $(2k-2h)^{\text{th}}$ power of the Riemann zeta function with the $2h^{\text{th}}$ power of its derivative on the critical line in the…
The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. In 1999 A.…
We study the surprising discrepancy between the number of primes corresponding, respectively, to the two letters of an infinite word engendered by one of the simplest Lindenmayer systems. We formulate a conjecture concerning the rate of…
Combining the mollifiers, we exhibit other choices of coefficients that improve the results on large gaps between the zeros of the Riemann zeta-function. Precisely, assuming the Generalized Riemann Hypothesis (GRH), we show that there exist…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
We prove a bound on the number of primes with a given splitting behaviour in a given field extension. This bound generalises the Brun-Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
We present a new, elementary, dynamical proof of the prime number theorem.
In this work, we obtain some new lower bounds for the number $\mathcal N_B(x)$ of Nov\'ak numbers less than or equal to $x$. We also prove, conditionally on Generalized Riemann Hypothesis, the upper estimates for the number of primes…
We show that a positive proportion of all gaps between consecutive primes are small gaps. We provide several quantitative results, some unconditional and some conditional, in this flavour.
We make explicit an argument of Heath-Brown concerning large and small gaps between nontrivial zeroes of the Riemann zeta-function, $\zeta(s)$. In particular, we provide the first unconditional results on gaps (large and small) which hold…
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 properties of the Riemann extensions of nonriemannian spaces defined by the first order systems of differential equations are considered.
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…
A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…
In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…
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…
We estimate the distribution of relatively $r$-prime lattice points in number fields $K$ with their components having a norm less than $x$. In the previous paper we obtained uniform upper bounds as $K$ runs through all number fields under…
We investigate the first order implicit linear difference equation over residue class rings modulo m. We prove an existence criterion and establish the amount of solutions for this equation. We obtain analogous results for the initial…