Under Cramér's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$. Under the same conjecture, we also prove that for any $ε>0$, there exists a positive real number $B$ for which the formula $[B.{n!}^{2+ε}]$ gives a prime number for any sufficiently large positive integer $n$.
I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain property called pseudo equidistribution. Both rigorous as well as heuristic arguments are given in support of the generalized Cramer's conjectures.
We prove that a positive proportion of the intervals of any fixed scalar multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number. We also show that a positive proportion of the congruence classes modulo $q$ contain a prime number smaller than any fixed scalar multiple of $φ(q)\log(q).$
We prove the analog of Cramér's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based mainly on the inertia property of the counting functions of primes and prime ideals.
Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+ε}p_n)$ where $ε> 0$, in the context of the results we have obtained in our paper.
Let $p_n$ is the $n$-th prime. With help of the Cramér-like model, we prove that the set of intervals of the form $(2p_n,\enskip2p_{n+1})$ containing at list 3 primes has a positive density with respect to the set of all intervals of such form.
Contrary to what would be predicted on the basis of Cramér's model concerning the distribution of prime numbers, we develop evidence that the distribution of $ψ(x+H)- ψ(x)$, for $0\le x\le N$, is approximately normal with mean $\sim H$ and variance $\sim H\log N/H$, when $N^δ\le H \le N^{1-δ}$.
A numerical study on the distributions of primes in short intervals of length $h$ over the natural numbers $N$ is presented. Based on Cramér's model in Number Theory, we obtain a heuristic expression applicable when $h \gg \log{N}$ but $h \ll N$, providing support to the Montgomery and Soundararajan conjecture on the variance of the prime distribution at this scale.
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as building blocks remains elusive. Here, we propose a new approach to decoding the architecture of natural numbers based on complex networks and stochastic processes theory. We introduce a parameter-free non-Markovian dynamical model that naturally generates random primes and their relation with composite numbers with remarkable accuracy. Our model satisfies the…
We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}π \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a result of Ramaré and Saouter. We then show that the constant $4/π$ may be reduced to $(1+ε)$ provided that $x$ is taken to be sufficiently large. From this we get an immediate estimate for a well-known theorem of Cramér, in that we show the number of primes in the interval $(x, x+c \sqrt{x} \log x]$ is greater than $\sqrt{x}$ for $c=3+ε$ and all sufficiently larg…
Gross and Smith have put forward generalizations of Hardy - Littlewood twin prime conjectures for algebraic number fields. We estimate the behavior of sums of a singular series that arises in these conjectures, up to lower order terms. More exactly, we find asymptotic formulas for smoothed sums of the singular series minus one. Based upon Gross and Smith's conjectures, we use our result to suggest that for large enough 'short intervals' in an algebraic number field K, the variance of counts of prime elements in a random short interval deviates from a Cramer model prediction by a universal fact…
This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman-Horn's conjectures (suggest that the probability of a large positive integer being $x$ a prime - $\frac {1} {\ln(x)}$) it follows that the events consisting in a positive integer $x$ being not divisible by different primes are dependent with the ratio $0,5e^γ$ ($γ$ - Euler's constant). In establishing Hardy-Littlewood's and Bateman-Horn's conjectures, their authors followed the first suggestion by another one assuming the independence of the above-mentioned events, which on the basis of the first suggestion and Mert…
The Cramér-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n < \sum_{n=1}^N \log^2 p_n$. In the remainder of the paper we investigate which properties of the fluctuations $\fluc (x) = π(x) - \Li(x)$ would imply the Cramér-Granville conjecture is true and present two such properties, one of which assumes the Riemann Hypothesis; however we are unable to prove these properties are indeed satisfied. We argue that the conject…
Let $q>r\ge1$ be coprime positive integers. We empirically study the maximal gaps $G_{q,r}(x)$ between primes $p=qn+r\le x$, $n\in{\mathbb N}$. Extensive computations suggest that almost always $G_{q,r}(x)<φ(q)\log^2x$. More precisely, the vast majority of maximal gaps are near a trend curve $T$ predicted using a generalization of Wolf's conjecture: $$G_{q,r}(x) ~\sim~ T(q,x)={φ(q)x\over{\rm li}(x)} \Big(2\log{{\rm li}(x)\overφ(q)} - \log x + b\Big),$$ where $b = b(q,x) = O_q(1)$. The distribution of properly rescaled maximal gaps $G_{q,r}(x)$ is close to the Gumbel extreme value distribution.…
The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der Corput giving an asymptotic for the number of 3-term progressions of primes, all less than N. This article surveys recent developments of the author and T. Tao, in which the Hardy-Littlewood method has been generalised to obtain, for example, an asymptotic for the number of 4-term arithmetic progressions of primes less than N.
We prove that the upper bound for the van der Corput property of the set of shifted primes is O((log n)^{-1+o(1)}), giving an answer to a problem considered by Ruzsa and Montgomery for the set of shifted primes p-1. We construct normed non-negative valued cosine polynomials with the spectrum in the set p-1, p<=n, and a small free coefficient a_0=O((log n)^{-1+o(1)}). This implies the same bound for the Poincaré property of the set p-1, and also bounds for several properties related to uniform distribution of related sets.
We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving an asymptotic formula for this mode as $x$ tends to infinity, we look at the set of those prime numbers which, for some value of $x$, occur most frequently as the largest prime divisor of the integers in the interval $[2,x]$. We find that many prime numbers never have this property. We compare the set of "popular primes," those primes which are at some poin…
Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern ${\cal H}$. Let $π_c(x)$ be the number of primes in ${\mathbb P}_c$ not exceeding $x$. We heuristically derive formulas predicting the growth trend of the maximal gap $G_c(x)=\max_{p'\le x}(p'-p)$ between successive primes $p,p'\in{\mathbb P}_c$. Extensive computations for primes up to $10^{14}$ show that a simple trend formula $$G_c(x) \sim {x\overπ_c(x)}\cdot(\…
In 1845, Bertrand conjectured that for all integers $x\ge2$, there exists at least one prime in $(x/2, x]$. This was proved by Chebyshev in 1860, and then generalized by Ramanujan in 1919. He showed that for any $n\ge1$, there is a (smallest) prime $R_n$ such that $π(x)- π(x/2) \ge n$ for all $x \ge R_n$. In 2009 Sondow called $R_n$ the $n$th Ramanujan prime and proved the asymptotic behavior $R_n \sim p_{2n}$ (where $p_m$ is the $m$th prime). In the present paper, we generalize the interval of interest by introducing a parameter $c \in (0,1)$ and defining the $n$th $c$-Ramanujan prime as the …
There is a large literature on the asymptotic distribution of numbers free of large prime factors, so-called $\textit{smooth}$ or $\textit{friable}$ numbers. But there is very little known about this distribution that is numerically explicit. In this paper we follow the general plan for the saddle point argument of Hildebrand and Tenenbaum, giving explicit and fairly tight intervals in which the true count lies. We give two numerical examples of our method, and with the larger one, our interval is so tight we can exclude the famous Dickman-de Bruijn asymptotic estimate as too small and the Hil…
We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by giving a new proof of a rather more general result of Bourgain which, because of a close analogy with a classical argument of Tomas and Stein from Euclidean harmonic analysis, might be called a restriction theorem for the primes.
We define a variant of the Miller-Rabin primality test, which is in between Miller-Rabin and Fermat in terms of strength. We show that this test has infinitely many "Carmichael" numbers. We show that the test can also be thought of as a variant of the Solovay-Strassen test. We explore the growth of the test's "Carmichael" numbers, giving some empirical results and a discussion of one particularly strong pattern which appears in the results.
We prove several results about integers represented by positive definite quadratic forms, using a Fourier analysis approach. In particular, for an integer $\ell\geq 1$, we improve the error term in the partial sums of the number of representations of integers that are a multiple of $\ell$. This allows us to obtain unconditional Brun-Titchmarsh-type results in short intervals, and a conditional Cramér-type result on the maximum gap between primes represented by a given positive definite quadratic form.
A recent construction by Amarra, Devillers and Praeger of block designs with specific parameters depends on certain quadratic polynomials, with integer coefficients, taking prime power values. The Bunyakovsky Conjecture, if true, would imply that each of them takes infinitely many prime values, giving an infinite family of block designs with the required parameters. We have found large numbers of prime values of these polynomials, and the numbers found agree very closely with the estimates for them provided by Li's recent modification of the Bateman-Horn Conjecture. While this does not prove t…
In a recent preprint, F. Calegari has shown that for $\ell = 2, 3, 5$ and 7 there exist 2-dimensional surjective representations $ρ$ of $\Gal(\bar{\Q}/\Q)$ with values in $\F_\ell$ coming from the $\ell$-torsion points of an elliptic curve defined over $\Q$, but not minimally, i.e., so that any elliptic curve giving rise to $ρ$ has prime-to-$\ell$ conductor greater than the (prime-to-$\ell$) conductor of $ρ$. In this brief note, we will show that the same is true for any prime $\ell >7$, concretely, we will show that for any such $\ell$ the elliptic curve $$E^\ell: \qquad Y^2 = X (X- 3^\ell ) …
Let $${\mathbb P}^c=(\lfloor p^c\rfloor)_{p\in{\mathbb P}} \qquad (c>1,\ c\not\in {\mathbb N}), $$ where ${\mathbb P}$ is the set of prime numbers, and $\lfloor\cdot\rfloor$ is the floor function. We show that for every such $c$ there are infinitely many members of ${\mathbb P}^c$ having at most $R(c)$ prime factors, giving explicit estimates for $R(c)$ when $c$ is near one and also when $c$ is large.
Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If $G=\mathbb{Z}$ lower bounds for $|h^{(r)}A|$ are known, as well as the structure of the sets of integers for which $|h^{(r)}A|$ is minimal. In this paper we generalize this result by giving a lower bound for $|h^{(r)}A|$ when $G=\mathbb{Z}/p\mathbb{Z}$ for a prime $p$, and show new proofs for the direct and inverse problems in $\mathbb{Z}$.
We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci sequence is complete mod $m$. We extend this work to all Gibonacci sequences, concluding by determining the set of $m$ in which a generic Gibonacci sequence containing the relatively prime consecutive terms $a, b$ is complete mod $m$.
Let $F$ be a totally real number field, $p$ a rational prime, and $χ$ a finite order totally odd abelian character of Gal$(\bar{F}/F)$ such that $χ(\mathfrak{p})=1$ for some $\mathfrak{p}|p$. Motivated by a conjecture of Stark, Gross conjectured a relation between the derivative of the $p$-adic $L$-function associated to $χ$ at its exceptional zero and the $\mathfrak{p}$-adic logarithm of a $p$-unit in the $χ$ component of $F_χ^\times$. In a recent work, Dasgupta, Darmon, and Pollack have proven this conjecture assuming two conditions: that Leopoldt's conjecture holds for $F$ and $p$, and that…
Let p > 2 be a prime number and let N be any rational integer. We consider the p-class groups Cl(L), Cl(M) of the fields $L:=Q(N^{1/p})$ and $M:=Q(N^{1/p},μ_p)$, by comparison with the p-torsion groups T(L) and T(M) of the abelian p-ramification theory, in the framework of the reflection theorem, and obtain relations between the ranks of the isotypic components (Theorem 2.6). For p=3, we characterize the integers N such that L is 3-rational (i.e., T(L)=1), giving the following values: $N=3$; $N=3^d \ell$, $\ell = -1+ 3u$; $N=3^d \ell$, $\ell=(1+3a)^2+27b^2$, with $\ell$ prime and $uab$ prime t…
Let p be a prime and F a totally real field in which p is unramified. We consider mod p Hilbert modular forms for F, defined as sections of automorphic line bundles on Hilbert modular varieties of level prime to p in characteristic p. For a mod p Hilbert modular Hecke eigenform of arbitrary weight (without parity hypotheses), we associate a two-dimensional representation of the absolute Galois group of F, and we give a conjectural description of the set of weights of all eigenforms from which it arises. This conjecture can be viewed as a "geometric" variant of the "algebraic" Serre weight conj…
We show the following bounds on the prime counting function $π(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{π(x)}{x / \log x} \geq \liminf_{x \rightarrow \infty} \frac{π(x)}{x / \log x} \geq \log 2$$ for all $x$ sufficiently large. We also conjecture about the bounding of $π((x+1)^{2}) - π(x^{2})$, as is relevant to Legendre's conjecture about the number of primes in the aforementioned interval such that: $$ \left \lfloor\frac{1}{2}\left(\frac{\left(x+1\right)^{2}}{\log\left(x+1\right)}-\frac{x^{2}}{\log x}\right)-\f…
It is known that Szpiro's conjecture, or equivalently the ABC-conjecture, implies Lang's conjecture giving a uniform lower bound for the canonical height of nontorsion points on elliptic curves. In this note we show that a significantly weaker version of Szpiro's conjecture, which we call "prime-depleted," suffices to prove Lang's conjecture.
We prove a higher dimensional generalization of Gross and Zagier's theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves with complex multiplication by two different imaginary quadratic fields $K$ and $K^\prime$, when the curves are reduced modulo a supersingular prime and its powers. Equivalently, the Gross-Zagier formula counts optimal embeddings of the ring of integers of an imaginary quadratic field into particular maximal orders in $B_{p, \infty}$, the definite quaternion a…
