Related papers: Bounded gaps between primes with a given primitive…

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…

In 1999, Balog, Br\"udern, and Wooley (1999) showed there are infinitely many prime gaps $p-q$ that are $(\log p)^{\frac{3}{4}}$-smooth, and infinitely many consecutive prime gaps that are $(\log p)^\frac{7}{8}$-smooth. Advancements made…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

The method of Murty and Cioab\u{a} shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus…

In 1992, Erd$\H{o}$s and Hegyv$\'{a}$ri showed that for any prime p, there exist infinitely many length 3 weakly prime-additive numbers divisible by p. In 2018, Fang and Chen showed that for any positive integer m, there exists infinitely…

Let $\Gamma\subset\mathbb{Q}^*$ be a finitely generated subgroup and let $p$ be a prime such that the reduction group $\Gamma_p$ is a well defined subgroup of the multiplicative group $\mathbb{F}_p^*$. We prove an asymptotic formula for the…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

An asymptotic formula for the number of integers with the primitive root 2, and a generalized Artin primitive root conjecture for composite integers is presented here.

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In…

Combining the mollifiers, we exhibit other choices of coefficients that improve the results on large gaps between the zeros of the Riemann zeta-function. Precisely, assuming the Generalized Riemann Hypothesis (GRH), we show that there exist…

Let $N_a(x)$ denote the number of primes up to $x$ for which the integer $a$ is a primitive root. We show that $N_a(x)$ satisfies the asymptotic predicted by Artin's conjecture for almost all $1\le a\le \exp((\log \log x)^2)$. This improves…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

Green and Tao famously proved in a 2008 paper that there are arithmetic progressions of prime numbers of arbitrary lengths. Soon after, analogous statements were proved by Tao for the ring of Gaussian integers and by L\^e for the polynomial…