Related papers: Highly biased prime number races

We establish a version of the Furstenberg-Katznelson multi-dimensional Szemer\'edi in the primes ${\mathcal P} := \{2,3,5,\ldots\}$, which roughly speaking asserts that any dense subset of ${\mathcal P}^d$ contains constellations of any…

We apply the method of multiple Dirichlet series to develop $L$-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for the family of quartic Hecke $L$-functions of prime moduli over the…

An old open problem in number theory is whether Chebotarev density theorem holds in short intervals. More precisely, given a Galois extension $E$ of $\mathbb{Q}$ with Galois group $G$, a conjugacy class $C$ in $G$ and an $1\geq…

In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…

This paper uses concepts introduced by Fiorilli and Martin to develop a more accurate remainder term in calculations of the distribution of primes in residue classes. Using it in Rubinstein and Sarnak's method estimates the limiting…

We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating…

The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…

We study the bias of random bounded-degree polynomials over odd prime fields and show that, with probability exponentially close to 1, such polynomials have exponentially small bias. This also yields an exponential tail bound on the weight…

Assuming the Generalized Riemann Hypothesis, the non-trivial zeros of $L$-functions lie on the critical line with the real part $1/2$. We find an upper bound of the lowest first zero in families of even cuspidal newforms of prime level…

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…

We prove an explicit version of Weiss' bound on the least norm of a prime ideal in the Chebotarev density theorem, which is itself a significant improvement on the work of Lagarias, Montgomery, and Odlyzko. In order to accomplish this, we…

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Given a polynomial f(z) = z^d + c over a global field K and a_0 in K, we study the density of prime ideals of K dividing at least one element of the orbit of a_0 under f. The density of such sets for linear polynomials has attracted much…

It is shown that short-range correlations between large prime numbers (~10^5 and larger) have a Poissonian nature. Correlation length \zeta = 4.5 for the primes ~10^5 and it is increasing logarithmically according to the prime number…

Under the assumption of the Riemann Hypothesis, the Linear Independence Hypothesis, and a bound on negative discrete moments of the Riemann zeta function, we prove the existence of a limiting logarithmic distribution of the normalisation of…

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a…

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…