Related papers: A summation involving the number of divisors funct…

Here, we discuss QCD predictions on multiplicities in parton and dipole approaches. The most general treatment is based on the notion of the generating functions. The generating function G is defined as $G(u,y)=\sum_nu^nP_n(y)$, where $P_n$…

Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…

We consider the asymptotic expansion of the Mathieu-Bessel series \[S_{\nu,\gamma}^{\mu}(a,b)=\sum_{n=1}^\infty \frac{n^\gamma K_\nu(nb/a)}{(n^2+a^2)^\mu}, \qquad (\mu>0, \nu\geq 0, b>0, \gamma\in {\bf R})\] as $|a|\to\infty$ in…

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

Let $\phi(n)$denote Euler's phi function. We study the distribution of the numbers $gcd(n,\phi(n))$ and their divisors. Our results generalize previous results of Erd\H{o}s and Pollack.

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

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…

We evaluate the asymptotic size of various sums of G\'al type, in particular $$S( \mathcal{M}):=\sum_{m,n\in\mathcal{M}} \sqrt{(m,n) \over [m,n]},$$ where $\mathcal{M}$ is a finite set of integers. Elaborating on methods recently developed…

We give a reciprocity formula for a two-variable sum where the variables satisfy a linear congruence condition. We also prove that such sum is a measure of how well a rational is approximable from below and show that the reciprocity formula…

Let $R_{m, \mathrm{sq-full}}(N)$ be a representation function for the sum of a prime and a square-full number. In this article, we prove an asymptotic formula for the sum of $R_{m, \mathrm{sq-full}}(N)$ over positive integers $N$ in a short…

In the study of Ramanujan sums, the so-called regular $A$-function is a set-valued multiplicative function that tracks certain subsets of the divisor sets of natural numbers. McCarthy provided a generalization of the Ramanujan sum using…

In this paper, we prove the following result: {quote} Let $\A$ be an infinite set of positive integers. For all positive integer $n$, let $\tau_n$ denote the smallest element of $\A$ which does not divide $n$. Then we have $$\lim_{N \to +…

The Landau-Selberg-Delange (LSD) method gives an asymptotic formula for the partial sums of a multiplicative function $f$ whose prime values are $\alpha$ on average. In the literature, the average is usually taken to be $\alpha$ with a very…

In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…

Let $\ba=(a_1,a_2,\ldots,a_k)$, where $a_j \ (j=1,\ldots,k)$ are positive integers such that $a_1 \leq a_2 \leq \cdots \leq a_k$. Let $d(\ba;n)=\sum_{n_1^{a_1}\cdots n_k^{a_k}=n}1$ and $\Delta(\ba;x)$ be the error term of the summatory…

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

This article establishes a new upper bound on the function $\sigma^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and…