Given any number field, we prove that there exist arbitrarily shaped constellations consisting of pairwise non-associate prime elements of the ring of integers. This result extends the celebrated Green-Tao theorem on arithmetic progressions of rational primes and Tao's theorem on constellations of Gaussian primes. Furthermore, we prove a constellation theorem on prime representations of binary quadratic forms with integer coefficients. More precisely, for a non-degenerate primitive binary quadratic form $F$ which is not negative definite, there exist arbitrarily shaped constellations consisting of pairs of integers $(x,y)$ for which $F(x,y)$ is a rational prime. The latter theorem is obtained by extending the framework from the ring of integers to the pair of an order and its invertible fractional ideal.
We present tables of record (maximal) gaps between densest prime constellations, or k-tuplets. The tables contain all maximal gaps between prime k-tuplets up to 10^15, for each k<=7.
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known as constellations. In this paper, we use those enumerations to estimate the numbers of these constellations that occur as constellations among prime numbers, and we compare these estimates with computational results. We include in our estimates the constellations corresponding to three and four consecutive primes in arithmetic progression. For these initial e…
We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely many sets $\{a+rv_0,...,a+rv_{k-1}\}$, with $a \in \Z[i]$ and $r \in \Z \backslash \{0\}$, all of whose elements are Gaussian primes. The proof is modeled on a recent paper by Green and Tao and requires three ingredients. The first is a hypergraph removal lemma of Gowers and Rödl-Skokan; this hypergraph removal lemma can be thought of as a generalization of the…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known as constellations. As the recursion proceeds, adjacent gaps within longer constellations are added together to produce shorter constellations of the same sum. These additions or closures correspond to removing composite numbers that are divisible by the prime for that stage of Eratosthenes sieve. Although we don't know where in the cycle of gaps a closure wil…
We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or triplets in any finite sequence of primes are like fixed-probability random events. The respective probabilities are not constant, but instead depend on the length of the sequence in ways that we have been able to parameterise. For twins the ``decay constant'' decreases as the reciprocal of the logarithm of the length of the sequence, whereas for triplets the fa…
We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations. Using this recursion we can estimate the numbers of a gap or of a constellation that occur between a prime and its square. This recursion also has explicit implications for open questions about gaps between prime numbers, including three questions posed by Erdös and Turán.
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences are known as constellations. Over the last year we identified a discrete linear system that exactly models the population of any gap across all stages of the sieve. In August 2014 we summarized our results from analyzing this discrete model on populations of single gaps. This paper extends the discrete system to model the populations of constellations of gaps…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences are known as constellations. The populations of gaps and constellations across stages of Eratosthenes sieve are modeled exactly by discrete dynamic systems. These models and their asymptotic behaviors provide evidence on a number of open problems regarding gaps between prime numbers. For Eratosthenes sieve we show that the analogue of Polignac's conjecture is…
Tao conjectured that every dense subset of $\mathcal{P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we give a simple proof using the Green-Tao theorem on linear equations in primes and the Furstenberg-Katznelson multidimensional Szemerédi theorem.
We prove an analogue of the Hardy-Littlewood conjecture on the asymptotic distribution of prime constellations in the setting of short intervals in function fields of smooth projective curves over finite fields.
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known as constellations. As the recursion proceeds, adjacent gaps within longer constellations are added together to produce shorter constellations of the same sum. These additions or closures correspond to removing composite numbers that are divisible by the prime for that stage of Eratosthenes sieve. Although we don't know where in the cycle of gaps a closure wil…
We establish a version of the Furstenberg-Katznelson multi-dimensional Szemerédi 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 given shape. Our arguments are based on a weighted version of the Furstenberg correspondence principle, relative to a weight which obeys an infinite number of pseudorandomness (or "linear forms") conditions, combined with the main results of a series of papers by Green and the authors which establish such an infinite number of pseudorandomness conditions for a we…
Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular" triple of sets, then either |A+B| <= d, or |B+C| <= d, or |A+C| <= d.
In this paper, we introduce a Carlitz module analogue of Mersenne primes, and prove Carlitz module analogues of several classical results concerning Mersenne primes. In contrast to the classical case, we can show that there are infinitely many composite Mersenne numbers. We also study the acquaintances of Mersenne primes including Wieferich and non-Wieferich primes in the Carlitz module context that were first introduced by Dinesh Thakur.
We present a very elementary proof of the uniqueness of Markoff numbers which are prime powers or twice prime powers, in the sense that it uses neither algebraic number theory nor hyperbolic geometry.
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number theorem.
In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+ε}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.
We verify that every alternating group of degree at most one quadrillion is invariably generated by an element of prime order together with an element of prime power order.
We explicitly write down the Eisenstein elements inside the space of modular symbols for Eisenstein series with integer coefficients for the congruence subgroups Γ_0 (pq) with p and q distinct odd primes, giving an answer to a question of Merel in these cases. We also compute the winding elements explicitly for these congruence subgroups. Our results are explicit versions of the Manin-Drinfeld Theorem.
We give an outline of a generalization of the Gelfond-Schnirelmann method in elementary number theory. It is related to an integral of Selberg (1944) generalizing the Euler beta integral. The result we explain was obtained by Nair and Chudnovsky independently in the early eighties.
We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log n}$.
We show that if $E/\mathbb{Q}$ is an elliptic curve with a rational $p$-torsion for $p=2$ or $3$, then there is a congruence relation between Ramanujan's tau function and $E$ modulo $p$. We make use of such congruences to compute the Iwasawa invariants of $2$-adic and $3$-adic Mazur--Tate elements attached to Ramanujan's tau function. We also investigate numerically the Iwasawa invariants of the Mazur--Tate elements attached to an elliptic curve with additive reduction at a fixed prime number.
Let $Ω(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(Ω(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(Ω(n))+\mathrm{o}_{N\to\infty}(1). \] This yields a new elementary proof of the Prime Number Theorem.
The objective of this paper is to introduce an approach to the study of the nonasymptotic distribution of prime numbers. The natural numbers are represented by theorem 1 in the matrix form ^2N. The first column of the infinite matrix ^2N starts with the unit and contains all composite numbers in ascending order.The infinite rows of this matrix except for the first elements contain prime numbers only, which are determined by an uniform recurrence law. At least one of the elements of the twin pairs of prime numbers is an element of the second column of the matrix ^2N (theorem 3). The basic infor…
Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $ε>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$ elements from $A$, where $N$ depends on $n$ and $\espilon$.
We show that if {1, b, c, d} is a D(-1) diophantine quadruple with b<c<d and c=1+s^2, then the cases s=p^k, s=2p^k, c=p and c=2p^k do not occur, where p is an odd prime and k is a positive integer. For the integer d=1+x^2, we show that it is not prime and that x is divisible by at least two distinct odd primes. Furthermore, we present several infinite families of integers b such that the D(-1) pair {1, b} cannot be extended to a D(-1) quadruple. For instance, we show that if r=5p where p is an odd prime, then the D(-1) pair {1, r^2+1} cannot be extended to a D(-1) quadruple.
Let $ρ(n)$ denote the maximal number of different primes that may occur in the order of a finite solvable group $G$, all elements of which have orders divisible by at most $n$ distinct primes. We show that $ρ(n)\leq 5n$ for all $n\geq 1$. As an application, we improve on a recent bound by Hung and Yang for arbitrary finite groups.
We show that the plane Cremona group over a perfect field $k$ of characteristic $p \ge 0$ contains an element of prime order $\ell\ge 7$ not equal to $p$ if and only if there exists a 2-dimensional algebraic torus $T$ over $k$ such that $T(k)$ contains an element of order $\ell$. If $p = 0$ and $k$ does not contain a primitive $\ell$-th root of unity, we show that there are no elements of prime order $\ell > 7$ in $\Cr_2(k)$ and all elements of order 7 are conjugate.
In this paper we study elementary extensions of differential fields in prime characteristic. In particular, we show that, in contrast to Liouville's result in characteristic zero, all elements of an elementary extension admit an antiderivative in some logarithmic extension.
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of nonempty subsets of $A$ which are relatively prime and the number of nonempty subsets of $A$ which are relatively prime to $n$. Related formulas are also obtained for the number of such subsets having some fixed cardinality. This extends previous work for the cases where $A$ is an interval or a set in arithmetic progression. Applications include: a) An exact formul…
Let $q$ be a prime power and $n, r$ integers such that $r\mid q^n-1$. An element of $\mathbb{F}_{q^n}$ of multiplicative order $(q^n-1)/r$ is called \emph{$r$-primitive}. For any odd prime power $q$, we show that there exists a $2$-primitive element of $\mathbb{F}_{q^n}$ with arbitrarily prescribed $\mathbb{F}_q$ trace when $n\geq 3$. Also we explicitly describe the values that the trace of such elements may have when $n=2$. A feature of this amended version is the reduction of the discussion to extensions of prime degree $n$.
The quantum cat map is a model for a quantum system with underlying chaotic dynamics. In this paper we study the matrix elements of smooth observables in this model, when taking arithmetic symmetries into account. We give explicit formulas for the matrix elements as certain exponential sums. With these formulas we can show that there are sequences of eigenfunctions for which the matrix elements decay significantly slower then was previously conjectured. We also prove a limiting distribution for the fluctuation of the normalized matrix elements around their average.
This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows in a few lines. We believe this to be the most transparent of the elementary proofs of the PNT.
For k a field of characteristic 2, we show that there is a unique continuous automorphism of order 4 of the power series ring k[[t]] which sends t to t + t^2 + (t^6) + (t^{12} + t^{14}) + (t^{24} + t^{26} + t^{28} + t^{30}) + ... . For j >= 0, the j-th sum in parentheses has 2^j terms beginning at t^{6*2^j}, with successive terms in the j-th sum raising the exponent of t by 2.
Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of a global field of characteristic p>2. We also prove that the set of all elements of k^{perf} which are integral at some prime \qq of k^{perf} is diophantine over k^{perf}, and this is the first such result for a field which is not finitely generated over its constant field. This is related to Hilbert's Tenth Problem because for global fields k of positive ch…
We study the distribution of the sequence of elements of the discrete dynamical system generated by iterations of the Möbius map $x \mapsto (ax + b)/(cx+d)$ over a finite field of $p$ elements at the moments of time that correspond to prime numbers. In particular, we obtain nontrivial estimates of exponential sums with such sequences.
For n>1, let G(n)=σ(n)/(n log log n), where σ(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime factors p of N and all multiples aN of N. The proof uses Robin's and Gronwall's theorems on G(n). An alternate proof of one step depends on two properties of superabundant numbers proved using Alaoglu and Erdős's results.
We present new theoretical algorithms that sums the n-ary comparators output in order to get the permutation indices in order to sort a sequence. By analysing the parallel ranking algorithm, we found that the special comparators number of elements it processes divide the number of elements to be sorted. Using the divide and conquer method, we can express the sorting problem into summing output of comparators taking a prime number of elements, given that this prime number divides the initial disordered sequence length. The number of sums is directly related to the Maundy cake problem. Furthermo…
We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result: The sum of (log p)/p, taken over all primes p not exceeding n, is asymptotic to log n as n tends to infinity. We also give finite-n bounds refining the above limit. This result, originally proved by Chebyshev in 1852, is closely related to the celebrated prime number theorem.
For a prime $p>2$, let $G$ be a semi-simple, simply connected, split Chevalley group over $\mathbb{Z}_p$, $G(1)$ be the first congruence kernel of $G$ and $Ω_{G(1)}$ be the mod-$p$ Iwasawa algebra defined over the finite field $\mathbb{F}_p$. Ardakov, Wei, Zhang have shown that if $p$ is a "nice prime " ($p \geq 5$ and $p \nmid n+1$ if the Lie algebra of $G(1)$ is of type $A_n$), then every non-zero normal element in $Ω_{G(1)}$ is a unit. Furthermore, they conjecture in their paper that their nice prime condition is superfluous. The main goal of this article is to provide an entirely new proof…
