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)$ which denotes the number of distinct prime divisors $\leq z$ of $n$. Especially, for odd integers $k\geq 3$, we lead asymptotic formulas for $\sum_{n\leq x}(\omega_{z}(n)-\log\log z)^{k}$, under certain restrictions on $k$, $z$, and $x$. Also, we refer to a framework of the approach.
Let $m\geq 1$ be a fixed integer, $a$ an integer satisfying $(a,m)=1$, and $z\geq 1$ a real parameter. Denote by $\omega_{z}(n;m,a)$ the number of distinct prime divisors $p$ of $n$ satisfying $p\equiv a\, (m)$ and $p\leq z$. We study an asymptotic behaviour of $\sum_{n\leq x}\left(\omega_{z}(n;m,a)-\frac{1}{\varphi(m)...
T. Minamide, Haruka Sakai, Y. Tanigawa· 0 citations
Let $\mu$ be the M\"obius function and $e(t)=e^{2\pi it}$. We prove that if $N\ge2$, $\alpha\in\mathbb{R}$, $(a,q)=1$, and $|\alpha-a/q|\le q^{-2}$, then \[\bigg|\sum_{n\le N}\mu^2(n)e(\alpha n)\bigg|\ll\left(\frac Nq+q\right)(\log 2N)^5, \] with an absolute implied constant, and we deduce the corresponding estimate on...
Nicolas Robles, Alexandru Zaharescu, Dirk Zeindler· 0 citations
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...
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...
Following Erd\H{o}s (1982) and Sanna (2019), we study the arithmetic function $h(n)$, which is defined to be the number of distinct exponents in the prime factorization of a positive integer $n$. Among other things, we show that $$ \sum_{n\leq x}h(\phi(n)) \asymp x\left(\frac{\log\log x}{\log\log\log x}\right)^{1/2}, $...
Mikhail R. Gabdullin, V. V. Iudelevich· 0 citations
For a real transcendental number $\xi$, let $\omega_n^*(\xi)$ denote the supremum of all $\omega$ for which there exist infinitely many real algebraic numbers $\alpha$ of degree $\leq n$ satisfying $|\xi-\alpha|\leq H(\alpha)^{-\omega -1}$, where $H(\alpha)$ is the naive height of the minimal polynomial of $\alpha$. A...
A. Dixit· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.