Related papers: Primes in arithmetic progressions on average II

We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval $[u+1,u+h]$ of Legendre symbols modulo primes $p$ in a dyadic interval $[Q,2Q]$. The bound is nontrivial and gives a power…

An interesting episode in the history of the prime number theorem concerns a formula proposed by Legendre for counting the primes below a given bound. We point out that arithmetic bias likely played an important role in arriving at that…

For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…

We study two kinds of conjectural bounds for the prime gap after the k-th prime $p_k$: (A) $p_{k+1} < (p_k)^{1+1/k}$ and (B) $p_{k+1}-p_k < \log^2 p_k - \log p_k - b$ for $k>9$. The upper bound (A) is equivalent to Firoozbakht's conjecture.…

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

We consider the Gaussian limit law for the distribution of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an optimal bound for the speed of convergence, thereby improving on previous estimates…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…

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 Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

We explore the distribution of class numbers $h(d)$ of indefinite binary quadratic forms, for discriminants $d$ such that the corresponding fundamental unit $\varepsilon_d$ is lower than $d^{1/2+\alpha}$, where $0<\alpha<1/2$. To do so we…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

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…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. In 1999 A.…