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).
We show that for Beurling generalized numbers the prime number theorem in remainder form $$π(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) = ax + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n \in \mathbb{N},$$ where $N$ and $π$ are the counting functions of the generalized integers and primes, respectively. This was already considered by Nyman (Acta Math. 81 (1949), 299-307), but his article on the subject contains some mistakes. We also obtain an average version of this prime number th…
Jacob's ladders, point of contact of the remainder in the prime-number law with the Fermat-Wiles theorem and multiplicative puzzles on some sets of integrals
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is also shown to be applicable for the Chinese Remainder problem, i.e., simultaneous linear congruence equations, for co-prime moduli as well as non-co-prime moduli.
Given $β\in(0,1)$, we show the existence of a Beurling generalized number system whose integer counting satisfies $N(x) = ax + O\bigl(x\exp(-c\log^β x)\bigr)$ for some $a>0$ and $c>0$, and whose prime counting function satisfies $π(x) = \mathrm{Li}(x) + Ω\bigl(x\exp(-c'(\log x)^{\fracβ{β+1}})\bigr)$ for some $c'>0$. This is done by generalizing a construction of Diamond, Montgomery, and Vorhauer. This Beurling system serves as additional motivation for a conjecture of Bateman and Diamond from 1969, concerning the PNT with Malliavin-type remainder.
Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the question of Littlewood, who asked for explicit oscillation results provided a zeta-zero is known. We prove that given a zero $ρ_0$ of the Beurling zeta function $ζ_P$ for a given number system generated by the primes $P$, the corresponding error term $Δ_P(x):=ψ_{P}(x)-x$, where $ψ_{P}(x)$ is the von Mangoldt summatory function shows oscillation in any large enough…
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.
Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise relatively prime and in each row, at least one matrix element a(i,j) is relatively prime to m(i). The Chinese remainder theorem is the special case, where A has only one column.
This paper uses concepts introduced by Fiorilli and Martin to develop a more accurate remainder term in calculations of the distribution of primes in residue classes. Using it in Rubinstein and Sarnak's method estimates the limiting logarithmic frequency of pi(x)>Li(x) as 0.00000026300 with only 5 zeta zeros used explicitly, and a reliable value between 0.000000262996732 and 0.000000262996733 is obtained with fewer than 100 zeros. Accurate results for "prime number races" can usually be obtained with explicit use of only the first zero of each L-function involved, thus bringing out their depen…
For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as $A = A^{[0]} + p A^{[1]} + p^2 A^{[2]} + \cdots$ where each $A^{[i]} \in \mathbb{Z}^{n \times n}$ has entries between $[0, p-1]$. Upper bounds are proven for the $\mathbb{Z}$-ranks of $A \,\mathrm{rem}\, p$, and $A \,\mathrm{quo}\, p$. Also, upper bounds are proven for the $\mathbb{Z}/p\mathbb{Z}$-rank of $A^{[i]}$ for all $i \ge 0$ when $p = 2$, and a conje…
We prove upper bounds for the mean square of the remainder in the prime geodesic theorem, for every cofinite Fuchsian group, which improve on average on the best known pointwise bounds. The proof relies on the Selberg trace formula. For the modular group we prove a refined upper bound by using the Kuznetsov trace formula.
The remainder $E_Γ(X)$ in the Prime Geodesic Theorem for the Picard group $Γ= \mathrm{PSL}(2,\mathbb{Z}[i])$ is known to be bounded by $O(X^{3/2+ε})$ under the assumption of the Lindelöf hypothesis for quadratic Dirichlet $L$-functions over Gaussian integers. By studying the second moment of $E_Γ(X)$, we show that on average the same bound holds unconditionally.
We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the $2d$ different primes. We may conclude that there exist infinitely many $2d$ different primes including the twin primes in case of $d=1$ because we can give the lower bounds of the existence density for the $2d$ different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.
In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic achievement of Yitang Zhang about the existence of bounded gaps between consecutive primes. Most of these results would have belonged to the category of science fiction a decade ago. However, the presented results are far from being immediate consequences of Zhang's famous theorem: they require various new ideas, other important properties of the applied sieve functi…
If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify the Firoozbakht conjecture for primes up to four quintillion $(4\times10^{18})$.
A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints about the conjecture in the cases of odd and even integers and using the method of Lagrange multipliers, Cardano formula for cubic equations and the contradiction, we prove the conjecture.
In this paper, we prove the Iwasawa main conjecture for elliptic curves at an odd supersingular prime p. Some consequences are the p-parts of the leading term formulas in the Birch and Swinnerton-Dyer conjectures for analytic rank 0 or 1.
Let $\mathcal{P}$ be the set of all primes and $π(x)$ be the number of primes up to $x$. For any $n\ge 2$, let $P^+(n)$ be the largest prime factor of $n$. For $0<c<1$, let $$T_c(x)=\#\{p\le x:p\in \mathcal{P},P^+(p-1)\ge p^c\}.$$ In this note, we proved that there exists some $c<1$ such that $$\limsup_{x\rightarrow\infty}\frac{T_c(x)}{π(x)}<\frac12,$$ which disproves a conjecture of Chen and Chen.
In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture can be proved assuming our improved version of Legendre's Conjecture. Finally, we sharpen the Bertrand's Postulate for prime numbers. Our results are backed by extensive empirical investigation.
Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.
We present here a new conjecture for the nature of the Mersenne prime numbers by connecting it with the Collatz-Kakutani problem. By introducing a natural path length on the basis of the Collatz-Kakutani tree, we conjecture that this path length of a Mersenne prime from the root of the Collatz-Kakutani tree is approximately proportional to the index of the Mersenne prime. We also discuss difference of behaviors between Mersenne numbers and Mersenne primes.
In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
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$.
In 1987, B. Perrin-Riou formulated a Heegner point main conjecture for elliptic curves at primes of ordinary reduction. In this paper, we formulate an analogue of Perrin-Riou's main conjecture for supersingular primes. We then prove this conjecture under mild hypotheses, and deduce from this result a $Λ$-adic extension of Kobayashi's $p$-adic Gross-Zagier formula, new cases of B.-D. Kim's doubly-signed main conjectures, and a strengthened version of Skinner's converse to the Gross-Zagier-Kolyvagin theorem for supersingular primes.
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also determine very thin and low diverging ranges in which the probability of finding a prime is one.
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 improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all $\varepsilon>0$, $p-2$ is either a prime number or can be written as $p_1 p_2$ where $p_1$ and $p_2$ are prime and $p_1<X^{\varepsilon}$, and we give the explicit asymptotic.
In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem, including Goldbach's conjecture, twin primes conjecture and Catalan's conjecture as well.
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.
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in arithmetic progressions and in short intervals, and the Goldbach conjecture. We prove an asymptotic formula for the number of simultaneous prime values of $n$ linear functions, in the limit of a large finite field.
For every even integer N, denote by D_{1,2}(N) the number of representations of N as a sum of a prime and an integer having at most two prime factors. In this paper, we give a new lower bound for D_{1,2}(N).
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for fixed $m$ and $a, b$ coprime to $m$, any positive even $n \equiv a + b \bmod m$ outside of a finite exceptional set is expected to be a sum of two primes $p$ and $q$ with $p \equiv a \bmod m$, $q \equiv b \bmod m$. We make conjectures about the growth of these exceptional sets.
We study p-divisibility of discriminants of Hecke algebras associated to spaces of cusp forms of prime level. We make a precise conjecture about the indexes of Hecke algebras in their normalisation which implies (if true) the conjecture that there are no mod p congruences between non-conjugate newforms of weight 2 and level Gamma_0(p).
Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and Littlewood twin prime conjecture in the case of elliptic curves. Koblitz's conjecture is still widely open. In this paper we prove that Koblitz's conjecture is true on average over a two-parameter family of elliptic curves. One of the key ingredients in the proof is a short average distribution result in the style of Barban-Davenport-Halberstam, where the a…
Question 10208b (1992) of the American Mathematical Monthly asked: does there exist an increasing sequence $\{a_k\}$ of positive integers and a constant $B > 0$ having the property that $\{ a_k + n\}$ contains no more than $B$ primes for every integer $n$? A positive answer to this question became known as Golomb's conjecture. In this note we give a negative answer, making use of recent progress in prime number theory.
Jing Run Chen proved in 1966 that $p+2$ has at most two prime factors for infinitely many primes $p$. However, due to the parity problem we do not know whether $p+2$ has an odd (or even) number of prime factors infinitely often. In the present work it is proved that $p+d$ has an odd number of prime factors for at least one value of d=2,4,...16.
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…
In this paper, we define $X$-base Fibonacci-Wieferich prime which is a generalized Wieferich prime where $X$ is a finite set of algebraic numbers. We are going to show that there are infinitely many non-$X$-base Fibonacci-Wieferich primes assuming the $abc$-conjecture of Masser-Oesterlé-Szpiro for number fields. We also provide a new conjecture concerning the rank of free part of abelian group generated by all elements in $X$, and we will use the arithmetic point of view and geometric point of view to give heuristic.
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 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.
We prove the lower bound for the number of Lucas non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $k\geq 2$ there are $\gg \log x$ Lucas non-Wieferich primes $p\leq x$ such that $p\equiv\pm1\pmod{k}$, assuming the $abc$ conjecture for number fields. Further, we discuss some applications of Lucas sequences in Cryptography.
In this paper, we make a conjecture (conjecture 1) related to the Bateman-Horn conjecture and proceed to study the roots of $x^2+1$ and $x^2+2$ to prime moduli, assuming the truth of the Bateman-Horn conjecture and conjecture 1 and using the Erdős-Turan-Koksma inequality.
At a prime of ordinary reduction, the Iwasawa ``main conjecture'' for elliptic curves relates a Selmer group to a $p$-adic $L$-function. In the supersingular case, the statement of the main conjecture is more complicated as neither the Selmer group nor the $p$-adic $L$-function is well-behaved. Recently Kobayashi discovered an equivalent formulation of the main conjecture at supersingular primes that is similar in structure to the ordinary case. Namely, Kobayashi's conjecture relates modified Selmer groups, which he defined, with modified $p$-adic $L$-functions defined by the first author. In …
Let $K/\mathbb{Q}$ be an algebraic number field of class number one and $\mathcal{O}_K$ be its ring of integers. We show that there are infinitely many non-Wieferich primes with respect to certain units in $\mathcal{O}_K$ under the assumption of the \textit{abc} conjecture for number fields.
We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} Λ(n) Λ(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such an asymptotic formula has been previously obtained only for fixed $h$ in which case our result quantitatively improves those of Heath-Brown (1983) and Tao and Teräväinen (2021). Since our main theorems work also for large $h$ we can derive new results concerning connections between Siegel zeros and the Goldbach conjecture and between Siegel zeros and primes in almost al…
We use Vaughan's variation on Vinogradov's three-primes theorem to prove Zariski-density of prime points in several infinite families of hypersurfaces, including level sets of some quadratic forms, the Permanent polynomial, and the defining polynomials of some pre-homogeneous vector spaces. Three of these families are instances of a conjecture by Bourgain, Gamburd and Sarnak regarding prime points in orbits of simple algebraic groups. Our approach is based on the formulation of a general condition on the defining polynomial of a hypersurface, which suffices to guarantee that Zariski-density of…
In 1995, Ehud de Shalit proved an analogue of a conjecture of Mazur--Tate for the modular Jacobian $J_0(p)$. His main result was valid away from the Eisenstein primes. We complete the work of de Shalit by including the Eisenstein primes, and give some applications such as an elementary combinatorial identity involving discrete logarithms of difference of supersingular $j$-invariants. An important tool is our recent work on the so called "generalized cuspidal $1$-motive".
We survey results about prime number races, that is, results about the relative sizes of prime counting functions $π_{q,a}(x)$, with $q$ fixed and $a$ varying. In particular, we describe recent work by the authors on these problems.
