Related papers: Correlations of Almost Primes
Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. We also prove some corresponding results for…
A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to…
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…
Fix a graph $H$ and some $p\in (0,1)$, and let $X_H$ be the number of copies of $H$ in a random graph $G(n,p)$. Random variables of this form have been intensively studied since the foundational work of Erd\H{o}s and R\'{e}nyi. There has…
Hooley conjectured that the variance V(x;q) of the distribution of primes up to x in the arithmetic progressions modulo q is asymptotically x log q, in some unspecified range of q\leq x. On average over 1\leq q \leq Q, this conjecture is…
Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…
This paper investigates the dependence between primes in tuples through the analysis of the Hardy-Littlewood constant. A detailed analysis of the behavior of the constant for the pattern $(0,d)$ is conducted, depending on the arithmetic…
We prove several supercongruences involving the harmonic number of order two $H_n^{(2)}:=\sum_{k=1}^n1/k^2$. For example, if $p>5$ is prime and $\alpha$ is $p$-integral, then we can completely determine $$…
We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…
Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…
Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…
The prime detecting function (PDF) approach can be effective instrument in the investigation of numbers. The PDF is constructed by recurrence sequence - each successive prime adds a sieving factor in the form of PDF. With built-in prime…
Assuming the Generalized Riemann Hypothesis (GRH), we show using the asymptotic large sieve that 91% of the zeros of primitive Dirichlet $L$-functions are simple. This improves on earlier work of \"{O}zl\"{u}k which gives a proportion of at…
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…
For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…
In the late eighties, Hildebrand and Tenenbaum proved an asymptotic formula for the number of positive integers below $x$, having exactly $\nu$ distinct prime divisors: $\pi_{\nu}(x) \sim x \delta_{\nu}(x)$. Here we consider the restricted…
Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to…
In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…
This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…
This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.