Related papers: Prime Number Races
Chebyshev observed in a letter to Fuss that there tends to be more primes of the form $4n+3$ than of the form $4n+1$. The general phenomenon, which is referred to as Chebyshev's bias, is that primes tend to be biased in their distribution…
We survey results about prime number races, that is, results about the relative sizes of prime counting functions $\pi_{q,a}(x)$, with $q$ fixed and $a$ varying. In particular, we describe recent work by the authors on these problems.
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…
For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…
Let $\pi(x;q,a)$ denote the number of primes up to $x$ that are congruent to $a$ modulo $q$. A prime number race, for fixed modulus $q$ and residue classes $a_1, \ldots, a_r$, investigates the system of inequalities $\pi(x;q,a_1) >…
It has been well-observed that an inequality of the type $\pi(x;q,a) > \pi(x;q,b)$ is more likely to hold if $a$ is a non-square modulo $q$ and $b$ is a square modulo $q$ (the so-called ``Chebyshev Bias''). For instance, each of…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…
In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…
The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.
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…
We introduce a refinement of the classical Liouville function to primes in arithmetic progressions. Using this, we discover new biases in the appearances of primes in a given arithmetic progression in the prime factorizations of integers.…
In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…
We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…
In this research paper, relationship between every Mersenne prime and certain Natural numbers is explored. We begin by proving that every Mersenne prime is of the form {4n + 3,for some integer 'n'} and generalize the result to all powers of…
Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If…
For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…