Related papers: Divisor-sum fibers

Let $s(n)$ denote the sum of proper divisors of an integer $n$. In 1992, Erd\H{o}s, Granville, Pomerance, and Spiro (EGPS) conjectured that if $\mathcal{A}$ is a set of integers with asymptotic density zero then $s^{-1}(\mathcal{A})$ also…

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

Let $s(n):= \sum_{d\mid n,~d<n} d$ denote the sum of the proper divisors of $n$. It is natural to conjecture that for each integer $k\ge 2$, the equivalence \[ \text{$n$ is $k$th powerfree} \Longleftrightarrow \text{$s(n)$ is $k$th…

We introduce a variation on the prime divisor function $B(n)$ of Alladi and Erd\H{o}s, a close relative of the sum of proper divisors function $s(n)$. After proving some basic properties regarding these functions, we study the dynamics of…

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

The sum of proper divisors function $s(n)$ has been studied for more than 2000 years. In this paper we study statistical properties of the related function $S_s(n) := \sum_{d \mid n} s(d)$. This function arises from a generalization of 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$…

For any real number $s$, let $\sigma_s$ be the generalized divisor function, i.e., the arithmetic function defined by $\sigma_s(n) := \sum_{d \, \mid \, n} d^s$, for all positive integers $n$. We prove that for any $r > 1$ the topological…

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…

For any positive integer $n$, let $\sigma (n)$ be the sum of all positive divisors of $n.$ In this paper, it is proved that the set of positive integers $ n $ for which $ \sigma(30n+1)\geq \sigma(30n) $ has a density less than $ 0.0371813,…

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…

It is conjectured that the sum $$ S_r(n)=\sum_{k=1}^{n} \frac{k}{k+r}\binom{n}{k} $$ for positive integers $r,n$ is never integral. This has been shown for $r\le 22$. In this note we study the problem in the ``$n$ aspect" showing that the…

We consider the sum-of-digits functions $s_2$ and $s_3$ in bases $2$ and $3$. These functions just return the minimal numbers of powers of two (resp. three) needed in order to represent a nonnegative integer as their sum. A result of the…

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

We study the triple convolution sum of the divisor function given by $$\sum_{n\leq x} d(n)d(n-h)d(n+h)$$ for $h\neq 0$ and $d(n)$ denotes the number of positive divisors of $n$. Based on algebraic and geometric considerations, Browning…

We prove that any set $A\subset \mathbb{N}$ of positive upper density contains a finite $S\subset A$ such that $\sum_{n\in S}\frac{1}{n}=1$, answering a question of Erd\H{o}s and Graham.

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

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…

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…