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

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number…

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

For each $s\in \mathbb R$ and $n\in \mathbb N$, let $\sigma_s(n) = \sum_{d\mid n}d^s$. In this article, we give a comparison between $\sigma_s(an+b)$ and $\sigma_s(cn+d)$ where $a$, $b$, $c$, $d$, $s$ are fixed, the vectors $(a,b)$ and…

Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential…

This paper investigates the randomness properties of a function of the divisor pairs of a natural number. This function, the antecedents of which go to very ancient times, has randomness properties that can find applications in…

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

In this paper, we are interested in the limit theorem question for sums of indicator functions. We show that in every aperiodic dynamical system, for every increasing sequence $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

In [arXiv:1504.07804], Keating, Rodgers, Roditty-Gershon and Rudnick established relationships of the mean-square of sums of the divisor function $d_k(f)$ over short intervals and over arithmetic progressions for the function field $\mathbb…

This research explores the sum of divisors - $\sigma(n)$ - and the abundancy index given by the function $\frac{\sigma(n)}{n}$. We give a generalization of amicable pairs - feebly amicable pairs (also known as harmonious pairs), that is…

We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta method due to Li, Rydin-Myerson, and…

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…

Let $N$ be any fixed positive integer and define \begin{align*} S_N(x)=\sum_{m, n \leq x}d(n^2+Nm^2), \end{align*} where $d(n)$ is the divisor function. We evaluate asymptotically $S_N(x)$ for several $N$, extending earlier works of Gafurov…

Recently, Andrews and Ghosh Dastidar (Ramanujan J. \textbf{69}, Art. No. 26, 2026) studied two interesting functions $SOME(n)$ and $DSOME(n)$, where $SOME(n)$ is the sum of all the odd parts in the partitions of $n$ minus the sum of all…

Let $\sum_{d|n}$ denote sum over divisors of a positive integer $n$, and $t_{r}(n)$ denote the number of representations of $n$ as a sum of $r$ triangular numbers. Then we prove that $$…

In a one-page fragment published with his lost notebook, Ramanujan stated two double series identities associated, respectively, with the famous Gauss Circle and Dirichlet Divisor problems. The identities contain an "extra" parameter, and…

We use the rationality of the generalized $h^{th}$ convergent functions, $Conv_h(\alpha, R; z)$, to the infinite J-fraction expansions enumerating the generalized factorial product sequences, $p_n(\alpha, R) =…

Given an arithmetical function $f$, by $f(a, b)$ and $f[a, b]$ we denote the function $f$ evaluated at the greatest common divisor $(a, b)$ of positive integers $a$ and $b$ and evaluated at the least common multiple $[a, b]$ respectively. A…

Additive divisor sums play a prominent role in the theory of the moments of the Riemann zeta function. There is a long history of determining sharp asymptotic formula for the shifted convolution sum of the ordinary divisor function. In…