Related papers: A set of formulas for primes
This is a survey article outlining what is known about absolute primes.
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+\epsilon}p_n)$…
Some symmetry problems are formulated and solved. New simple proofs are given for the earlier studied symmetry problems.
Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric…
Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
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…
Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…
A new derivation of Golomb's limit formula for generating the $n$th$+1$ prime number is presented. The limit formula is derived by extracting $p_{n+1}$ from Euler's prime product representation of the Riemann zeta function $\zeta(s)$ in the…
For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […
We compute all primes up to $6.25\times 10^{28}$ of the form $m^2+1$. Calculations using this list verify, up to our bound, a less famous conjecture of Goldbach. We introduce `Goldbach champions' as part of the verification process and…
We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…
A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…
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…
We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…
In this work we prove that the set of the difference of primes is a $\Delta_r^*$-set. The work is based on the recent dramatic new developments in the study of bounded gaps between primes, reached by Zhang, Maynard and Tao.
Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…