Related papers: Prime pairs and Zeta's zeros
The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…
Fix $\alpha >0$, and sample $N$ integers uniformly at random from $\{1,2,\ldots ,\lfloor e^{\alpha N}\rfloor \}$. Given $\eta >0$, the probability that the maximum of the pairwise GCDs lies between $N^{2-\eta }$ and $N^{2+\eta}$ converges…
We construct families of prime ideals in polynomial rings for which the number of associated primes of the second power (or higher powers) is exponential in the number of variables in the ring. We give a lower bound on the Ananyan-Hochster…
It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…
We consider $\Phi(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}\Sigma e^{-p^2\pi x}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $\Phi$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the…
Let $\mathcal{P}$ be the set of all primes and $\pi(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…
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…
The motion in the complex plane of the zeros to various zeta functions is investigated numerically. First the Hurwitz zeta function is considered and an accurate formula for the distribution of its zeros is suggested. Then functions which…
We study an extension of Montgomery's pair-correlation conjecture and its relevance in some problems on the distribution of prime numbers.
Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…
We investigate the statistical distribution of the zeros of Dirichlet $L$--functions both analytically and numerically. Using the Hardy--Littlewood conjecture about the distribution of prime numbers we show that the two--point correlation…
In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…
Assuming the Riemann Hypothesis (RH), Montgomery proved a theorem concerning pair correlation of zeros of the Riemann zeta-function. One consequence of this theorem is that, assuming RH, at least $67.9\%$ of the nontrivial zeros are simple.…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution…
We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…