Related papers: Generalized Ramanujan Primes

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).

We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also…

We prove that for every nonnegative integer $m$ there exists an $\varepsilon>0$ such that if $\lambda\in (0,\varepsilon]$ and $x$ is sufficiently large in terms of $m$, then the number of positive integers $n\leq x$ for which the interval…

Historically, to bound the mean for small sample sizes, practitioners have had to choose between using methods with unrealistic assumptions about the unknown distribution (e.g., Gaussianity) and methods like Hoeffding's inequality that use…

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

Let $d_n = p_{n+1} - p_n$, where $p_n$ denotes the $n$th smallest prime, and let $R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2$ (the "Erd{\H o}s--Rankin" function). We consider the sequence $(d_n/R(p_n))$ of normalized prime gaps, and show…

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…

Let $p_n$ denote the $n$th smallest prime number, and let $\boldsymbol{L}$ denote the set of limit points of the sequence $\{(p_{n+1} - p_n)/\log p_n\}_{n = 1}^{\infty}$ of normalized differences between consecutive primes. We show that for…

Given disjoint subsets $T_1,\ldots,T_m$ of "not too large" primes up to $x$, we establish that for a random integer $n$ drawn from $[1,x]$, the $m$-dimensional vector enumerating the number of prime factors of $n$ from $T_1,\ldots,T_m$…

Lehmer conjectured that Ramanujan's tau function never vanishes. As a variation of this conjecture, it is proved that \begin{equation*} \tau(n)\neq \pm \ell, \pm 2\ell, \pm 2\ell^2, \end{equation*} where $\ell<100$ is an odd prime, by…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

We prove that analogues of the Hardy-Littlewood generalised twin prime conjecture for almost primes hold on average. Our main theorem establishes an asymptotic formula for the number of integers $n=p_1p_2 \leq X$ such that $n+h$ is a…

The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…

Let $\mathcal{P}$ be the set of primes and $\pi(x)$ the number of primes not exceeding $x$. Let also $P^+(n)$ be the largest prime factor of $n$ with convention $P^+(1)=1$ and $$ T_c(x)=\#\left\{p\le x:p\in \mathcal{P},P^+(p-1)\ge…

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…

We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…

Let $1<c<d$ be two relatively prime integers and $g_{c,d}=cd-c-d$. We confirm, by employing the Hardy--Littlewood method, a 2020 conjecture of Ram\'{\i}rez Alfons\'{\i}n and Ska{\l}ba which states that $$#\left\{p\le g_{c,d}:p\in…

Let $q\ge 5$ be a prime and put $q^*=(-1)^{(q-1)/2}\cdot q$. We consider the integer sequence $u_q(1),u_q(2),\ldots,$ with $u_q(j)=(3^j-q^*(-1)^j)/4$. No term in this sequence is repeated and thus for each $n$ there is a smallest integer…