Related papers: Effective prime factors and Goldbach's Theorem/Con…

We show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…

We prove a factorization theorem for heavy-to-light form factors. Our result differs in several important ways from previous proposals. A proper separation of scales gives hard kernels that are free of endpoint singularities. A general…

We find an interesting relationship between the golden ratio, the Moebius function, the Euler totient function and the natural logarithm - central players in the theory of numbers. A number of identities involving the golden ratio and its…

Let $2 \leq y \leq x$ such that $\beta := \frac{\log x}{\log y} \rightarrow \infty$. Let $\omega_y(n)$ denote the number of distinct prime factors $p$ of $n$ such that $p \leq y$, and let $\mu_y(n) := \mu^2(n)(-1)^{\omega_y(n)}$, where…

We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six…

With an artificial (p', n')-system it has been proved that even numbers > (p(x))^2 are the sum of two p > p(x).

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.

In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

This paper makes the following conjecture: For every prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d|x^2$ so that either:…

We propose a generalization of the Elliott-Halberstam conjecture concerning the distribution of prime pairs in arithmetic progressions. This conjecture, which we call the Generalized Elliott-Halberstam Conjecture for Shifted Convolutions…

An equivalence is proven between the Riemann Hypothesis and the speed of convergence to 1/zeta(2) of the probability that two independent random variables following the same geometric distribution are coprime integers, when the parameter of…

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…

In this note we use recent developments in sieve theory to highlight the interplay between Goldbach and de Polignac numbers. Assuming that the primes have level of distribution greater than $1/2$, we show that at least one of two nice…

Starting from the first Hardy-Littlewood conjecture some topics will be covered: an empirical approach to the distribution of the twin primes in classes mod(10) and a simplified proof of the Bruns theorem . Finally, it will be explored an…

Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $\Sigma_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by…