For k greater than 1 and r different from 0, let pi^k_{2r}(x) denote the number of prime pairs (p,p^k+2r) with p not exceeding (large) x. By the Bateman-Horn conjecture, the function pi^k_{2r}(x) should be asymptotic to (2/k)C^k_{2r}li_2(x), with certain specific constants C^k_{2r}. Heuristic arguments lead to the conjecture that these constants have mean value one, just like the Hardy-Littlewood constants C_{2r} for prime pairs (p,p+2r). The conjecture is supported by extensive numerical work.
In this paper, we consider pairs of a prime and a prime power with a fixed difference. We prove an average result on the distribution of such pairs. This is a partial improvement of the result of Bauer (1998).
In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231 powers of 2.
It is well known that the arithmetic nature of Mills' prime-representing constant is uncertain: we do not know if Mills' constant is a rational or irrational number. In the case of other prime-representing constants, irrationality can be proved, but it is not known whether these constants are algebraic or transcendental numbers. By using Liouville or Roth's theorems about approximation by rationals, we find a couple of prime-representing constants that can be proved to be transcendental numbers.
We present a constant and a recursive relation to define a sequence $f_n$ such that the floor of $f_n$ is the $n$th prime. Therefore, this constant generates the complete sequence of primes. We also show this constant is irrational and consider other sequences that can be generated using the same method.
We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient condition for the truth of the Goldbach conjecture, the infinitude of prime twins, and more general of prime pairs with a fixed even difference.
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 whether there are infinitely many prime pairs with given even difference! Using a strong hypothesis on (weighted) equidistribution of primes in arithmetic progressions, Goldston, Pintz and Yildirim have shown (2007) that there are infinitely many pairs of primes differing by at most sixteen. The present author uses a Tauberian approach to derive that the PPC is …
We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove that for a small positive proportion of prime pairs $p,p+k$, the dominant inequality is reversed.
In this paper we extend the well-known investigations of Montgomery and Goldston & Montgomery, concerning the pair-correlation function and its relations with the distribution of primes in short intervals, to a more general version of the pair-correlation function.
We use the methods developed in our papers on moments and divisor correlations to derive heuristically the conjectural ratios formula for two zetas over two zetas.
We show that the error term in the asymptotic formula for the Ces{à}ro mean of the singular series in the Goldbach and the Hardy-Littlewood prime-pair conjectures cannot be too small and oscillates.
Goldston and Montgomery [3] proved that the Strong Pair Correlation Conjecture and two second moments of primes in short intervals are equivalent to each other under Riemann Hypothesis. In this paper, we get the second main terms for each of the above and show that they are almost equivalent to each other.
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the {\em vector degree}, are considered. We show that the number of irreducibles can be computed recursively by degree and that the number of relatively prime pairs can be expressed in terms of the number of irreducibles. We also obtain asymptotic formulas for the number of irreducibles and the number of relatively prime pairs. The asymptotic formulas for the num…
We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are uniform in long ranges and with suitable error terms.
n this paper, we state several conjectures regarding distribution of primes and of pairs of primes represented by irreducible homogeneous polynomial in two variables $f(a,b)$. We formulate conjectures with respect to the slope $t=b/a$ for any irreducible polynomial $f$. Here, we formulate a conjecture for all irreducible polynomials. We also consider conjectures for distribution of pairs of primes. It show unexpected relation to multiple Dedekind zeta function - at $s=2$ for one prime and at $(s_1,s_2)=(2,2)$ for pairs of primes. We tested the conjecture for pairs of primes for several quadrat…
We present a transformation, based on the Bézout's identity, which maps the set of pairs of relatively prime numbers $(p,q)$ with fixed $p$ and $0<q<p$, to pairs of relatively prime numbers in the $p\times p$ square in $\mathbb R^2$, in such a way that intriguing quadratic arcs show up. We exhibit parametrizations of quadratic curves which fit such quadratic arcs and we also justify algebraically the ensuing geometry.
Taking $r>0$, let $π_{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 $π_{2r}(x)\sim 2C_{2r} {\rm li}_2(x)$ with an explicit constant $C_{2r}>0$. There seems to be no good conjecture for the remainders $ω_{2r}(x)=π_{2r}(x)- 2C_{2r} {\rm li}_2(x)$ that corresponds to Riemann's formula for $π(x)-{\rm li}(x)$. However, there is a heuristic approximate formula for averages of the remainders $ω_{2r}(x)$ which is supported by numerical results.
For a fixed odd prime q we investigate the first and second order terms of the asymptotic series expansion for the number of n\le x such that q does not divide phi(n). Part of the analysis involves a careful study of the Euler-Kronecker constants for cyclotomic fields. In particular, we show that the prime k-tuples conjecture and a conjecture of Ihara about the distribution of these Euler-Kronecker constants cannot be both true.
A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a symmetric pair. In the present paper, that theorem is improved to what is likely to be the best possible result. We also establish that there exist infinitely many symmetric pairs of primes. In fact, we show that for every integer m at least 2 there is a string of m consecutive primes, any two of which form a symmetric pair.
Jagy and Kaplansky exhibited a table of 68 pairs of positive definite binary quadratic forms that represent the same odd primes and conjectured that this list is complete outside of "trivial" pairs. In this article, we find all pairs of such forms that represent the same primes outside of a finite set.
For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an explicit positive constant C_{2r}. A heuristic argument indicates that the remainder e_{2r}(x) in this approximation cannot be of lower order than x^beta, where beta is the supremum of the real parts of zeta's zeros. The argument also suggests an approximation for pi_{2r}(x) similar to one of Riemann for pi(x).
A group of infinite products over low-order rational polynomials evaluated at the sequence of prime numbers is loosely called the Hardy-Littlewood constants. In this manuscript we look at them as factors embedded in a super-product over primes, semiprimes, 3-almost primes etc. Numerical tables are derived by transformation into series over k-almost prime zeta functions. Alternative product representations in a basis of k-almost prime products associated with Euler's formula for the Riemann zeta function are also pointed out.
Recently, Romik determined in [9] the Taylor expansion of the Jacobi theta constant θ_3, around the point x = 1. He discovered a new integer sequence, (d(n))_0^\infty=1, 1, -1, 51, 849, -26199, \dots, from which the Taylor coefficients are built, and conjectured that the numbers d(n) satisfy certain congruences modulo various primes. In this paper, we prove some of these conjectures, for example that d(n)\equiv (-1)^{n+1}(mod 5) for all n\geq 1,and that for any prime p\equiv 3 (mod 4), d(n) vanishes modulo p for all large enough n.
These notes are based on my four lectures given at the Newton Institute in April 2004 during the Recent Perspectives in Random Matrix Theory and Number Theory Workshop. Their purpose is to introduce the reader to the analytic number theory necessary to understand Montgomery's work on the pair correlation of the zeros of the Riemann zeta-function and subsequent work on how this relates to prime numbers. A very brief introduction to Selberg's work on the moments of $S(T)$ is also given.
Computer experiments reveal that twin primes tend to center on nonsquarefree multiples of 6 more often than on squarefree multiples of 6 compared to what should be expected from the ratio of the number of nonsquarefree multiples of 6 to the number of squarefree multiples of 6 equal $π^2/3-1$, or ca 2.290. For multiples of 6 surrounded by twin primes, this ratio is 2.427, a relative difference of ca $6.0\%$ measured against the expected value. A deviation from the expected value of this ratio, ca $1.9\%$, exists also for isolated primes. This shows that the distribution of primes is biased towa…
For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a finer-scale estimate for $R_2(x)$ up to $(\log x)^{-N}$ error for any $N > 0$. In this article, we establish the limiting behavior of the higher Mertens constants from the $R_2(x)$ estimate. We also extend these results to $R_3(x)$, and we remark on the general case $k\ge4$.
We say that a prime number $p$ is an $\textit{Artin prime}$ for $g$ if $g$ mod $p$ generates the group $(\mathbb{Z}/p\mathbb{Z})^{\times}$. For appropriately chosen integers $d$ and $g$, we present a conjecture for the asymptotic number $π_{d,g}(x)$ of primes $p \leq x$ such that both $p$ and $p+d$ are Artin primes for $g$. In particular, we identify a class of pairs $(d,g)$ for which $π_{d,g}(x) =0$. Our results suggest that the distribution of Artin prime pairs, amongst the ordinary prime pairs, is largely governed by a Poisson binomial distribution.
We seek to understand how the technical definition of Lehmer pair can be related to more analytic properties of the Riemann zeta function, particularly the location of the zeros of $ζ^\prime(s)$. Because we are interested in the connection between Lehmer pairs and the de Bruijn-Newman constant $Λ$, we assume the Riemann Hypothesis throughout. We define strong Lehmer pairs via an inequality on the derivative of the pre-Schwarzian of Riemann's function $Ξ(t)$, evaluated at consecutive zeros. Theorem 1 shows that strong Lehmer pairs are Lehmer pairs. Theorem 2 describes the derivative of the pre-…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the reduction $E_p$ of $E$ modulo $p$. Under the Generalized Riemann Hypothesis (GRH), we study the primes $p$ for which the integer $|a_p(E)|$ is a prime. In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number…
Numerical evidence suggests that for only about $2\%$ of pairs $p,p+2$ of twin primes, $p+2$ has more primitive roots than does $p$. If this occurs, we say that $p$ is exceptional (there are only two exceptional pairs with $5 \leq p \leq 10{,}000$). Assuming the Bateman-Horn conjecture, we prove that at least $0.47\%$ of twin prime pairs are exceptional and at least $65.13\%$ are not exceptional. We also conjecture a precise formula for the proportion of exceptional twin primes.
We exhibit the analogy between prime geodesics on hyperbolic Riemann surfaces and ordinary primes. We present new asymptotic counting results concerning pairs of prime geodesics whose homology difference is fixed.
In 1947 Mills proved that there exists a constant $A$ such that $\lfloor A^{3^n} \rfloor$ is a prime for every positive integer $n$. Determining $A$ requires determining an effective Hoheisel type result on the primes in short intervals - though most books ignore this difficulty. Under the Riemann Hypothesis, we show that there exists at least one prime between every pair of consecutive cubes and determine (given RH) that the least possible value of Mills' constant $A$ does begin with 1.3063778838. We calculate this value to 6850 decimal places by determining the associated primes to over 6000…
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of primes the base $q$ expansion of which differ in at most two digits. Likewise, for any fixed integer $t,$ there are infinitely many pairs of primes, the first $t$ digits of which are the same. In another direction, we show that, there is a constant $c$ depending on $q$ such that for infinitely many integers $m$ there are at least $c\log \log m$ primes which…
Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as the closely related problem of improving bounds $bc$, and $abc$. In particular, we prove two results. First we prove a new general bound on any prime divisor of an odd perfect number and obtain as a corollary of that bound that $$a < 2N^{\frac{1}{6}}.$$ Second, we show that $$abc < (2N)^{\frac{3}{5}}.$$ We also show how in certain circumstances these bounds …
We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-γ})^{-1} = 2.280...$ and $γ$ is Euler's constant. We explore several applications and resolve a conjecture of Margenstern about practical numbers.
Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <= c1((logx)^2)/loglogx, c1 > 0 constant. Equivalently, it shows that the very short intervals (x, x + y] contain prime numbers for all y > c2((logx)^2)/loglogx, c2 > 0 constant, and sufficiently large x > 0.
We give a description of the set of exceptional pairs for a number field $K$, that is the set of pairs $(\ell, j(E))$, where $\ell$ is a prime and $j(E)$ is the $j$-invariant of an elliptic curve $E$ over $K$ which admits an $\ell$-isogeny locally almost everywhere but not globally. We obtain an upper bound for $\ell$ in such pairs in terms of the degree and the discriminant of $K$. Moreover, we prove finiteness results about the number of exceptional pairs.
Let $\varepsilon>0$ be a small constant. In the present paper we prove that whenever $η$ is real and constants $λ_i$ satisfy some necessary conditions, then there exist infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying the inequality \begin{equation*} |λ_1p_1 + λ_2p_2 + λ_3p_3+η|<\varepsilon \end{equation*} and such that $p_3=x^2 + y^2 +1$.
Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^αd_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log X}~\qquad\quad~ &α=-1,\\ \frac{X}{\log X}\frac{(\log\log X)^{1+α}}{1+α}\qquad &α>-1, \end{cases} \end{align*} and establish asymptotic properties for some series of $d_n$ without the Hardy--Littlewood prime-pair conjecture.
For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match the strength of those of classical analytic methods. We also study the limiting behavior of the constants appearing in these estimates, which may be viewed as higher analogues of the Mertens constant $β=0.2614...$ Further, in the case $k=2$ of semiprimes we give yet finer-scale and explicit estimates, as well as a conjecture.
We introduce a new algorithm, which is faster and requires less computing resources than the ones previously known, to compute the Euler-Kronecker constants $\mathfrak{G}_q$ for the prime cyclotomic fields $\mathbb{Q}(ζ_q)$, where $q$ is an odd prime and $ζ_q$ is a primitive $q$-root of unity. With such a new algorithm we evaluated $\mathfrak{G}_q$ and $\mathfrak{G}_q^+$, where $\mathfrak{G}_q^+$ is the Euler-Kronecker constant of the maximal real subfield of $\mathbb{Q}(ζ_q)$, for some very large primes $q$ thus obtaining two new negative values of $\mathfrak{G}_q$: $\mathfrak{G}_{9109334831}…
While the sequence of primes is very well distributed in the reduced residue classes (mod $q$), the distribution of pairs of consecutive primes among the permissible $ϕ(q)^2$ pairs of reduced residue classes (mod $q$) is surprisingly erratic. This paper proposes a conjectural explanation for this phenomenon, based on the Hardy-Littlewood conjectures. The conjectures are then compared to numerical data, and the observed fit is very good.
In this paper we aim to prove two inequalities involving the classical approximation constants $w_{n}^{\prime}(ζ),\hat{w}_{n}^{\prime}(ζ)$ that stem from the simultaneous approximation problem $|ζ^{j}x-y_{j}|$, $1\leq j\leq n$, on the one side and the constants $w_{n}^{\ast}(ζ),\hat{w}_{n}^{\ast}(ζ)$ connected to approximation with algebraic numbers of degree $\leq n$ on the other side. We concretely prove $w_{n}^{\ast}(ζ)\hat{w}_{n}^{\prime}(ζ)\geq 1$ and $\hat{w}_{n}^{\ast}(ζ)w_{n}^{\prime}(ζ)\geq 1$. The first result is due to W. Schmidt, however our method of proving it allows to derive th…
The Stieltjes constants $γ_k(a)$ appear in the regular part of the Laurent expansion for the Hurwitz zeta function $ζ(s,a)$. We present summatory results for these constants $γ_k(a)$ in terms of fundamental mathematical constants such as the Catalan constant, and further relate them to products of rational functions of prime numbers. We provide examples of infinite series of differences of Stieltjes constants evaluating as volumes in hyperbolic $3$-space. We present a new series representation for the difference of the first Stieltjes constant at rational arguments. We obtain expressions for $…
We establish the equivalence of conjectures concerning the pair correlation of zeros of $L$-functions in the Selberg class and the variances of sums of a related class of arithmetic functions over primes in short intervals. This extends the results of Goldston & Montgomery [7] and Montgomery & Soundararajan [11] for the Riemann zeta-function to other $L$-functions in the Selberg class. Our approach is based on the statistics of the zeros because the analogue of the Hardy-Littlewood conjecture for the auto-correlation of the arithmetic functions we consider is not available in general. One of o…
