The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is proportional to this probability by a constant factor which depends on $a_i$ and $m$ but not on $n$, for large $n$. These constants are appellated as PDF (prime distribution factors). Moreover, it is argued that the PDF depend on the $a_i$ in a "week" way, only on the prime factors of the differences $a_i-a_j$ and not on their exponents. For example $p$ and $p+2^s$ will have the exact same probability for all integer $s>0$. The exact formulae for the PDF ratios are given. Moreover, the actual 'basic' PDF's are calculated exactly and are shown to be bigger than 1, which indicates that primes 'repel' each other. An exact asymptotic formula for the number of basic multiplets is given.
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number multiplets with less regular distances are studied.
A classification of twin primes implies special twin primes. When applied to triplets, it yields exceptional prime number triplets. These generalize yielding exceptional prime number multiplets.
Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to quadratic and cubic prime number generating polynomials.
The concept of Artin transfer pattern $((\ker(T_{K,N_i}))_i,(\mathrm{Cl}_p(N_i))_i)$ for homogeneous multiplets $(N_1,\ldots,N_m)$ of unramified cyclic prime degree p extensions $N_i/K$ of a base field K with p-class transfer homomorphisms$T_{K,N_i}:\,\mathrm{Cl}_p(K)\to\mathrm{Cl}_p(N_i)$ is generalized for heterogeneous multiplets of ramified extensions. By application to quadratic subfields K of dihedral fields N of degree 2p with an odd prime p, a conjecture of Scholz concerning the index of subfield units, $(U_N:U_0)$, for ramified extensions N/K with conductor f>1 is verified computation…
Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each class of generalized twin primes of the classification contains a positive fraction of all prime pairs.
Recently, I have defined the so called PDF's (prime distribution factors) which govern the distribution of prime numbers of the type $p,p+a_i$ being all primes up to some number $n$. It was shown that the PDF's are expressible in terms of the basic PDF's which are defined as $a_i-a_j$ or $a_i$ being composed of primes which are less or equal to the number of primes. For example, $p,p+2$ (twin primes), or $p,p+2,p+6$ being all primes (basic triplets). We give here a conjecture for the number of basic prime PDF's in terms of Hardy-Littlewood numbers, thus completing the determination of PDF's. T…
We study the problem of writing Gaussian primes as the sum of two squares, both of which are interesting arithmetically, in particular, when one is the square of a prime and the other the square of an almost-prime.
We survey some past conditional results on the distribution of large differences between consecutive primes and examine how the Hardy-Littlewood prime k-tuples conjecture can be applied to this question.
A classical problem in analytic number theory is to study the distribution of $αp$ modulo 1, where $α$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is an almost-prime (the existence of infinitely many such $p$ is another topical result in prime number theory) and prove that its distribution has a similar property.
We study the distribution of primes from a topological viewpoint. Certain conjecture is introduced, and we show that it is equivalent to the Riemann Hypothesis.
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like fixed probability random events. As the sequence of primes grows, the probability decreases as the reciprocal of the count of primes to that point. The manner of the decrease is consistent with the Hardy--Littlewood Conjecture, the Prime Number Theorem, and the Twin Prime Conjecture. Furthermore, our probabilistic model, is simply parameterized. We discuss a sim…
We bring to bear an empirical model of the distribution of twin primes and produce two distinct results. The first is that we can make a quantitative probabilistic prediction of the occurrence of gaps in the sequence of twins within the primes. The second is that the ``high jumper'' i.e., the separation with greatest likelihood (in terms of primes) is always expected to be zero.
The aim of the present paper is to study the relations between the prime distribution and the zero distribution for generalized zeta functions which are expressed by Euler products and is analytically continued as meromorphic functions of finite order. In this paper, we give an inequality between the order of the zeta function as a meromorphic function and the growth of the multiplicity in the prime distribution.
For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $φ(q)$ reduced residue classes modulo $q$. This paper considers patterns of sequences of consecutive primes $(p_n, p_{n+1}, \ldots, p_{n+k})$ modulo $q$. Numerical evidence suggests a preference for certain prime patterns. For example, computed frequencies of the pattern $(a,a)$ modulo $q$ up to $x$ are much less than the expected frequency $π(x)/φ(q)^2$. We begin to rigorously c…
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.
This work consists of a heuristic study on the distribution of prime numbers in short intervals. We have modelled the occurrence of prime numbers such intervals as a counting experiment. As a result, we have provided an experimental validation and an extension of the Montgomery and Soundararajan conjecture. This is a reduced version of my bachelor`s thesis presented at the University of Valencia.
For an elliptic curve E/Q without complex multiplication we study the distribution of Atkin and Elkies primes l, on average, over all good reductions of E modulo primes p. We show that, under the Generalised Riemann Hypothesis, for almost all primes p there are enough small Elkies primes l to ensure that the Schoof-Elkies-Atkin point-counting algorithm runs in (log p)^(4+o(1)) expected time.
In this note we study Kloosterman sums twisted by a multiplicative characters modulo a prime power. We show, by an elementary calculation, that these sums become equidistributed on the real line with respect to a suitable measure.
In the present paper we investigate distributional properties of sparse sequences modulo almost all prime numbers. We obtain new results for a wide class of sparse sequences which in particular find applications on additive problems and the discrete Littlewood problem related to lower bound estimates of the $L_1$-norm of trigonometric sums.
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…
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…
We demonstrate the existence of a congruence class bias in the distribution of supersingular primes on average for elliptic curves over $\Q$. For example, we show that on average there are twice as many supersingular primes congruent to 2 mod 3 as there are congruent to 1 mod 3. Our result is obtained using the averaging approach of Fouvry-Murty along with ideas of David-Pappalardi.
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…
The distribution of lattice points with relatively $r$-prime is related to problems in the Number Theory such as the Extended Lindelöf Hypothesis and the Gauss Circle Problem. It is known that Sittinger's result is improved on the assumption of the Extended Lindelöf Hypothesis. In this paper, we improve Sittinger's result without assuming the Extended Lindelöf hypothesis.
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained by considering three probabilistic models are similar. It is shown that the accuracy of these probabilistic models exceeds the Riemann hypothesis with a certain probability. The author constructed probabilistic models for the analysis of the average distance between neighboring prime numbers and k-tuples and found probability distributions of these random var…
Recently, Bruinier and Ono classified cusp forms $f(z) := \sum_{n=0}^{\infty} a_f(n)q ^n \in S_{λ+1/2}(Γ_0(N),χ)\cap \mathbb{Z}[[q]]$ that does not satisfy a certain distribution property for modulo odd primes $p$. In this paper, using Rankin-Cohen Bracket, we extend this result to modular forms of half integral weight for primes $p \geq 5$. As applications of our main theorem we derive distribution properties, for modulo primes $p\geq5$, of traces of singular moduli and Hurwitz class number. We also study an analogue of Newman's conjecture for overpartitions.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for $α\in\mathbb{R}\backslash\mathbb{Q},\,β\in\mathbb{R}$ and $0<θ<10/1561$, there exist infinitely many primes $p$, such that $\|αp^2+β\|<p^{-θ}$ and $p+2=\mathcal{P}_4$, which constitutes an improvement upon the previous result.
We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some natural variants of the problem concerning points with prime coordinates and points that are visible from the origin.
In this article we investigate the distribution of prime ideals of residue degree bigger than one across the ideal classes in the class group of a number field $L$. A criterion for the class group of $L$ being generated by the classes of prime ideals of residue degree $f>1$ is provided. Further, some consequences of this study on the solvability of norm equations for $L/\mathbb{Q}$ and on the problem of finding annihilators for relative extensions are discussed.
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.
Let $E$ be an elliptic curve defined over rational field $\mathbb{Q}$ and $N$ be a positive integer. Now, $M_E(N)$ denotes the number of primes $p$, such that the group $E_p(\mathbb{F}_p)$ is of order $N$. We show that $M_E(N)$ follows Poisson distribution when an average is taken over a large class of curves.
We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke, Friedlander and Iwaniec with averaging only over the modulus $q$ and of Dunn, Kerr, Shparlinski and Zaharescu with averaging only over $p$.
We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates. Possessing average counting functions along with their corresponding exact counting functions allows to implicitly define pertinent $k$-tuple zeta functions. The $k$-tuple zeta functions in turn allow construction of $k$-tuple analogs of explicit formulae. If the zeros of the (implicitly defined) $k$-tuple zeta can be determined, the explicit formulae should yield…
We investigate the average distribution of primes represented by positive definite integral binary quadratic forms, the average being taken over negative fundamental discriminants in long ranges. In particular, we prove corresponding results of Bombieri-Vinogradov type and of Barban-Davenport-Halberstam type, although with shorter ranges than in the original theorems for primes in arithmetic progressions: The results imply that, for all $a>0$, the least prime that can be represented by any given positive definite binary quadratic form of discriminant $q$ is smaller than $|q|^{7+a}$ for all for…
We consider the Dickman function $Ψ(x,y)$ in the limit when $\ln x/\ln y\to \infty $ and $\ln \ln x \ln y\to 0$. The asymptotic value is expressed in terms of the ratio of iterated loragithm of $x$ and $ln y$.
In this article we prove a general theorem which establishes the existence of limiting distributions for a wide class of error terms from prime number theory. As a corollary to our main theorem, we deduce previous results of Wintner (1935), Rubinstein and Sarnak (1994), and of Ng (2004). In addition, we establish limiting distribution results for the error term in the prime number theorem for an automorphic $L$-function, weighted sums of the Möbius function, weighted sums of the Liouville function, the sum of the Möbius function in an arithmetic progression, and the error term in Chebotarev's …
Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the distribution of the natural numbers in terms of a phase related to sqrt{pi}-sqrt{R} and indicate how li(x) can cross pi(x) for the first time.
The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in prime distribution. At least when the characteristic is $2$, we provide conjectural rationality and characterization of vanishing for families of interesting infinite sums over irreducible polynomials over finite fields. The cancellations responsible do not happen degree by degree or even for degree bounds for primes or prime powers, so rather than finite fields…
Let $χ$ be a Dirichlet character modulo $q$, let $L(s, χ)$ be the attached Dirichlet $L$-function, and let $L^\prime(s, χ)$ denotes its derivative with respect to the complex variable $s$. The main purpose of this paper is to give an asymptotic formula for the $2k$-th power mean value of $\left|L^\prime/L(1, χ)\right|$ when $χ$ ranges a primitive Dirichlet character modulo $q$ for $q$ prime. We derive some consequences, in particular a bound for the number of $χ$ such that $\left|L^\prime/L(1, χ)\right|$ is large.
We prove several results regarding the distribution of numbers that are the product of a prime and a $k$-th power. First, we prove an asymptotic formula for the counting function of such numbers; this generalises a result of E. Cohen. We then show that the error term in this formula can be sharpened on the assumption of the Riemann hypothesis. Finally, we prove an asymptotic formula for these counting functions in short intervals.
We consider $Φ(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}Σe^{-p^2πx}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $Φ$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros Re~$z_k>\frac{1}{2}$. The first 21 zeros give rise to asymptotic harmonic behavior in $Φ(x)$ defined by the prime numbers up to one trillion.
Given disjoint subsets $T_1,\ldots,T_m$ of "not too large" primes up to $x$, we establish that for a random integer $n$ drawn from $[1,x]$, the $m$-dimensional vector enumerating the number of prime factors of $n$ from $T_1,\ldots,T_m$ converges to a vector of $m$ independent Poisson random variables. We give a specific rate of convergence using the Kubilius model of prime factors. We also show a universal upper bound of Poisson type when $T_1,\ldots,T_m$ are unrestricted, and apply this to the distribution of the number of prime factors from a set $T$ given that $n$ has $k$ total prime factor…
Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set {p<x, p prime : s_q(p)=alpha(q-1)log_q x} where alpha lies in a tight range around 1/2. In this paper, we examine the tails of this distribution, and provide the lower bound |{p < x, p prime : s_q(p)>alpha(q-1)log_q x}| >>x^{2(1-alpha)}e^{-c(log x)^{1/2+epsilon}} for 1/2<alpha<0.7375. To attain this lower bound, we note that the multinomial distribution is s…
For a nonnegative integer $n$, and a prime $\wp$ in $\mathbb{F}_q[T]$, we prove a result that provides a method for computing the number of integers $m$ with $0 \le m \le n$ for which the Carlitz binomial coefficients $\binom{n}{m}_C$ fall into each of the residue classes modulo $\wp$. Our main result can be viewed as a function field analogue of the Garfield-Wilf theorem.
Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le r_n<p$ and propose several conjectures on the distribution of an integer $\lceil \sum_{i\in S} r_i/p\rceil$ for a subset $S$ of $\{1,\dots,n\}$ when $p\to\infty$.
Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity omega(binom(nk)(mk))=sum_i (pi(k/b(i))- pi(k/a(i))) + O(sqrt(k)). Erdoes mentioned that omega(binom(nk)(mk))= log n^n/(m^m (n-m)^(n-m)) k/log k + o(k/log k). As an application of the above identities, we conclude some well-known facts about the distribution of the primes and deduce for all natural numbers k an expression (also well-known) log k = sum_i a_k(i) whi…
Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the numerical evidence lead to the conjecture that the primes are distributed among sequence $(S_n)$ in the same way that they are distributed among positive integers. More precisely, Conjecture 3.3 in [8] asserts that $π_n\sim \frac{n}{\log n}$ as $n\to \infty$, where $π_n$ denotes the number of primes in the set $\{S_1,S_2,\ldots, S_n\}$. Motivated by this, here we c…
We consider the p-adic distributions derived from Eisenstein series in [GMPS], whose Mellin transforms are reciprocals of the Kubota-Leopoldt p-adic L-function. These distributions were shown there to be measures when p is regular. They fail to be measures when p is irregular; in this paper we give quantitative estimates that describe their behavior more precisely.
The computer data up to $2^{44}\approx 1.76\times 10^{13}$ on the gaps between consecutive twins is presented. The simple derivation of the heuristic formula describing computer results contained in the recent papers by P.F.Kelly and T.Pilling \cite{Kelly1}, \cite{Kelly2} is provided and compared with the ``experimental'' values.
