Related papers: Sum of Divisors Function And The Largest Integer F…
Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}\pi(x)=\Theta(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber…
Let $x$ be a positive integer. We give an asymptotic result for $\omega(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.
Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…
We study an asymptotic behavior of the sum $\sum\limits_{n\le x}\frac{\D \tau(n)}{\D \tau(n+a)}$. Here $\tau(n)$ denotes the number of divisors of $n$ and $a\ge 1$ is a fixed integer.
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
We show asymptotic upper and lower bounds for the greatest common divisor of N and $\sigma(N)$. We also show that there are infinitely many integers N with fairly large g.c.d. of N and $\sigma(N)$.
In this paper, we can show that \begin{align*} S_{\Lambda}(x)=\sum_{1\leq n\leq x}\Lambda \left(\left[\frac{x}{n}\right]\right)= \sum_{n=1}^{\infty} \frac{\Lambda(n)}{n(n+1)}x +O\left(x^{7/15+1/195+\varepsilon}\right), \end{align*} where…
We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…
Let $s(n)=\sum_{d\mid n,~d<n} d$ denote the sum of the proper divisors of $n$. The second-named author proved that $\omega(s(n))$ has normal order $\log\log{n}$, the analogue for $s$-values of a classical result of Hardy and Ramanujan. We…
We deduce asymptotic formulas for the sums $\sum_{n_1,\ldots,n_r\le x} f(n_1\cdots n_r)$ and $\sum_{n_1,\ldots,n_r\le x} f([n_1\cdots n_r])$, where $r\ge 2$ is a fixed integer, $[n_1,\ldots,n_r]$ stands for the least common multiple of the…
Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…
A representation of divisor function $\tau(n)\equiv \sigma_{0}(n)$ by means of logarithmic residue of a function of complex variable is suggested. This representation may be useful theoretical instrument for further investigations of…
Let $d(n)$ denote the number of divisors of a positive integer $n$. A classical problem in analytic number theory is given by the asymptotic behavior of the divisor sum $\sum_{n \leq x} \frac{1}{d(n)}$, with Ramanujan having introduced an…
An asymptotic formula is proved for the k-fold divisor function averaged over homogeneous polynomials of degree k in k-1 variables coming from incomplete norm forms.
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…
Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…
Let $b > a > 0$. We prove the following asymptotic formula $$\sum_{n\ge 0} \big\lvert\{x/(n+a)\} - \{x/(n+b)\}\big\rvert = \frac{2}{\pi}\zeta(3/2)\sqrt{cx} + O(c^{2/9}x^{4/9}),$$ with $c=b-a$, uniformly for $x \ge 40 c^{-5}(1+b)^{27/2}$.
We prove that $$ \sum_{p \leq x} \frac{1}{\tau(p-1)} \asymp \frac{x}{(\log x)^{3/2}}, \quad \quad \sum_{n \leq x} \frac{1}{\tau(n^2+1)} \asymp \frac{x}{(\log x)^{1/2}}, $$ where $\tau(n)=\sum_{d|n}1$ is the number of divisors of $n$, and…
For a fixed $\theta\neq 0$, we define the twisted divisor function $$ \tau(n, \theta):=\sum_{d\mid n}d^{i\theta}\ .$$ In this article we consider the error term $\Delta(x)$ in the following asymptotic formula $$ \sum_{n\leq x}^*|\tau(n,…
We provide upper bounds for the mean square integral $$ \int_X^{2X}(\Delta_k(x+h) - \Delta_k(x))^2 dx \qquad(h = h(X)\gg1, h = o(x) {\roman{as}} X\to\infty) $$ where $h$ lies in a suitable range. For $k\ge2$ a fixed integer, $\Delta_k(x)$…