相关论文: Some Properties and Applications of Non-trivial Di…

For a fixed integer $k$, we define the multiplicative function \[D_{k,\omega}(n) := \frac{d(n)}{k^{\omega(n)}}, \]where $d(n)$ is the divisor function and $\omega (n)$ is the number of distinct prime divisors of $n$. The main purpose of…

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…

Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are…

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…

We define new generalized factorials in several variables over an arbitrary subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is a positive integer. We then study the properties of the fixed divisor…

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…

We solve the dual multijoint problem and prove the existence of so-called "factorisations" for arbitrary fields and multijoints of $k_j$-planes. More generally, we deduce a discrete analogue of a theorem due in essence to Bourgain and Guth.…

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$…

We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over the rationals.

A new integer deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/6+\varepsilon})$ arithmetic operations, is presented in this note. Equivalently, given the least $(\log N)/6$ bits of a factor of the balanced…

Ingham studied two types of convolution sums of the divisor function, namely the shifted convolution sum $\sum_{n \le N} d(n) d(n+h)$ and the additive convolution sum $\sum_{n < N} d(n) d(N-n)$ for integers $N, h$ and derived their…

Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…

In this paper, we consider the general divisor functions over Piatetski-Shapiro sequences. We can give some general results which contain some special divisor functions. Precisely, we extend the divisor problem over Piatetski-Shapiro…

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…

Integer factorization is a famous computational problem unknown whether being solvable in the polynomial time. With the rise of deep neural networks, it is interesting whether they can facilitate faster factorization. We present an approach…

In this paper, we study the sum of the divisor function over sets with digit restrictions.

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A positive integer $n$ is said to be $2$-near perfect when $\sigma(n)=2n+d_1+d_2$, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We show that there are no odd…

Let k be a field, n a positive integer, X a generic nxn matrix over k (i.e., a matrix (x_{ij}) of n^2 independent indeterminates over the polynomial ring k[x_{ij}]), and adj(X) its classical adjoint. It is shown that if char k=0 and n is…

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…