Related papers: Primes in prime number races

Taking $r>0$, let $\pi_{2r}(x)$ denote the number of prime pairs $(p, p+2r)$ with $p\le x$. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that $\pi_{2r}(x)\sim 2C_{2r} {\rm li}_2(x)$ with an explicit constant $C_{2r}>0$.…

We prove that the Riemann hypothesis is equivalent to the condition $\int_{2}^x\left(\pi(t)-\text{li}(t)\right)\mathrm{d}t<0$ for all $x>2$. Here, $\pi(t)$ is the prime-counting function and $\text{li}(t)$ is the logarithmic integral. This…

A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that…

Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…

In this paper, we introduce the prime trees associated with a finite subset $P$ of the set of all prime numbers, and provide conditions under which the tree is of finite type. Moreover, we compute the density of finite-type subsets $P$. As…

Let N_g(d) be the set of primes p such that the order of g modulo p is divisible by a prescribed integer d. Wiertelak showed that this set has a natural density and gave a rather involved explicit expression for it. Let N_g(d)(x) be the…

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Let $K$ be a number field and $G$ a finitely generated torsion-free subgroup of $K^\times$. Given a prime $\mathfrak p$ of $K$ we denote by ${\rm ind}_{\mathfrak p}(G)$ the index of the subgroup $(G\bmod\mathfrak p)$ of the multiplicative…

It follows from the work of Artin and Hooley that, under assumption of the generalized Riemann hypothesis, the density of the set of primes $q$ for which a given non-zero rational number $r$ is a primitive root modulo $q$ can be written as…

For integer a let us consider the sequence X_a={x_0,x_1,x_2,...} defined by x_0=a, x_1=1 and, for n>=1, x_{n+1}=x_n+x_{n-1}. We say that a prime p divides X_a if p divides at least one term of the sequence. It is easy to see that every…

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

This is a survey article on prime number races. Chebyshev noticed in the first half of the nineteenth century that for any given value of x, there always seem to be more primes of the form 4n+3 less than x then there are of the form 4n+1.…

We establish a conditional equivalence between quantitative unboundedness of the analytic rank of elliptic curves over $\mathbb Q$ and the existence of highly biased elliptic curve prime number races. We show that conditionally on a Riemann…

We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…