For an integer $n>1$, let $P^+(n)$ be the largest prime factor of $n$, and let $P_y^+(n)$ denote the largest prime factor of $n$ not exceeding $y$. One of Erd\H{o}s and Tur\'an's conjectures asserts that the asymptotic density of integers $n$ satisfying $P^+(n)<P^+(n+1)$ is $1/2$. Furthermore, Wang conjectures that for $x\rightarrow\infty$, one has $\#\{p\leq x:P^+(p-1)<P^+(p+1)\}\sim \pi(x)/2$. In this paper, we show the following results. For any $3\leq y\ll x^{o(1)}$, for $x\rightarrow\infty$, we have \begin{align*}&\#\{n\leq x:P^+_y(n)<P^+_y(n+1)\}\sim \frac{1}{2}x, \\&\#\{p\leq x:P^+_y(p-1)<P^+_y(p+1)\}\sim \frac{1}{2}\pi(x). \end{align*} For any $0<\alpha<17/32$, let $y=x^\alpha$. Then there exists $h(\alpha)>0$ such that \begin{align*} \#\{p\leq x:P_y^+(p-1)<P_y^+(p+1)\}\geq(h(\alpha)+o(1))\pi(x). \end{align*} In particular, the function $h$ satisfies $\lim_{\alpha\rightarrow 0^+}h(\alpha)=1/2$. Similar result also holds for $\#\{n\leq x:P_y^+(n)<P_y^+(n+1)\}$. These improve Rivat's result (2001) and Wang's result (2019).
Let $d$ be the divisor function, and let $K(n)$ be the least positive integer $K$ for which $d((n + K)!) \ge 2d(n!)$. Erd\H{o}s, Graham, Ivi\'c and Pomerance proved that, for infinitely many $n$, \begin{equation*} K(n)>(1/9)(\log n)(\log_{2} n)(\log_{4} n)/(\log_{3} n)^3. \end{equation*} We improve upon this by a facto...
Let $p_n$ be the $n$th prime and $g_n=p_{n+1}-p_n$. Following Gafni and Tao, an integer $m$ with $p_n<m<p_{n+1}$ is rough for the gap if its least prime factor is at least $g_n$; let $M_n$ be the number of such integers. Gafni and Tao proved that the number of $n$ with $X\le p_n\le 2X$ and $M_n=0$ is $O(X/\log^2 X)$, a...
Denote by $\omega(n)$ the number of distinct prime divisors of the natural number $n$. In 2007, Granville and Soundararajan gave a quite new method to compute the higher moments $\sum_{n\leq x}(\omega(n)-\log\log x)^{k}$, for a wide range of integers $k\geq 2$. In this notes, we shall apply the method for $\omega_{z}(n...
T. Minamide, Haruka Sakai, Y. Tanigawa· 1 citation
A prime gap $(p_n, p_{n+1})$ is \textit{frangible} if the smallest prime divisor of every integer $m$ with $p_n<m<p_{n+1}$ is strictly less than the size of the gap, $p_{n+1}-p_n$. Gafni and Tao recently proved that the number of frangible gaps up to $X$ is $\ll X/\log^2 X$, answering a question of Erd\H{o}s. They also...
Let $k$ be a positive integer, and consider the sequences of positive rationals with $x_0\in\N$ and $x_{n+1}=k/(x_0+x_1+\dots+x_n)$. Write $x_n=a_n/b_n$ in lowest terms. We show that there is a rational constant $c>0$ such that $c\,a_n+b_n$ is a perfect power for every such sequence and every $n\ge2$ if and only if $k=...
Mateo Matijasevick, Santiago E. Rodriguez, Gregorio Salazar· 0 citations
For an integer solution of $y^2=x^3+k$ with $x,y\ge 1$ and $k\ne 0$, the integers $x^3$, $|k|$ and $y^2$ form a triple in which one term is the sum of the other two. When $\gcd(x,y)=1$ this triple is coprime, and the $abc$ conjecture predicts that its quality is asymptotically at most $1$. Following M\"uller, Taktikos...
R. Laniewski, K. Muller· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.