相关论文: Divisor Functions and the Number of Sum Systems

Inspired by a very recent work of A. {\DH}uri\'c, S. Jev{\dj}eni\'c and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings, that includes all of the classical definitions already known in the literature. We…

A unitary divisor $c$ of a positive integer $n$ is a positive divisor of $n$ that is relatively prime to $\displaystyle{\frac{n}{c}}$. For any integer $k$, the function $\sigma_k^*$ is a multiplicative arithmetic function defined so that…

For any complex number $c$, let $\sigma_c\colon\mathbb N\rightarrow\mathbb C$ denote the divisor function defined by $\sigma_c(n)=\displaystyle{\sum_{d|n}d^c}$ for all $n\in\mathbb N$, and define $R(c)=\{\sigma_c(n)\in\mathbb C\colon…

The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

We investigate the density properties of generalized divisor functions $\displaystyle f_s(n)=\frac{\sum_{d|n}d^s}{n^s}$ and extend the analysis from the already-proven density of $s=1$ to $s\geq0$. We demonstrate that for every $s>0$, $f_s$…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We…

We study the mean square of sums of the $k$th divisor function $d_k(n)$ over short intervals and arithmetic progressions for the rational function field over a finite field of $q$ elements. In the limit as $q\rightarrow\infty$ we establish…

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and…

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…

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…

A Lambert series generating function is a special series summed over an arithmetic function $f$ defined by \[ L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \sum_{m \geq 1} (f \ast 1)(m) q^m. \] Because of the way the left-hand-side…

We extend several celebrated methods in classical analysis for summing series of complex numbers to series of complex matrices. These include the summation methods of Abel, Borel, Ces\'aro, Euler, Lambert, N\"orlund, and Mittag-Leffler,…

We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}\tau\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a…

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…

In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordell\'{e}s \cite{Bo} and Liu-Wu-Yang \cite{LWY}.

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…