June 3, 2013
Let \sigma(n) = \sum_{d \mid n}d be the usual sum-of-divisors function. In 1933, Davenport showed that that n/\sigma(n) possesses a continuous distribution function. In other words, the limit D(u):= \lim_{x\to\infty} \frac{1}{x}\sum_{n \leq x,~n/\sigma(n) \leq u} 1 exists for all u \in [0,1] and varies continuously with u. We study the behavior of the sums \sum_{n \leq x,~n/\sigma(n) \leq u} f(n) for certain complex-valued multiplicative functions f. Our results cover many of the more frequently encountered functions, including \varphi(n), \tau(n), and \mu(n). They also apply to the representation function for sums of two squares, yielding the following analogue of Davenport's result: For all u \in [0,1], the limit \[ \tilde{D}(u):= \lim_{R\to\infty} \frac{1}{\pi R}\#\{(x,y) \in \Z^2: 0<x^2+y^2 \leq R \text{ and } \frac{x^2+y^2}{\sigma(x^2+y^2)} \leq u\} \] exists, and \tilde{D}(u) is both continuous and strictly increasing on [0,1].
Similar papers 1
March 20, 2016
A positive integer $n$ is called an abundant number if $\sigma (n)\ge 2n$, where $\sigma (n)$ is the sum of all positive divisors of $n$. Let $E(x)$ be the largest number of consecutive abundant numbers not exceeding $x$. In 1935, P. Erd\H os proved that there are two positive constants $c_1$ and $c_2$ such that $c_1\log\log\log x\le E(x)\le c_2\log\log\log x$. In this paper, we resolve this old problem by proving that, $E(x)/\log \log\log x$ tends to a limit as $x\to +\infty...
March 28, 2018
The abundancy index of a positive integer is the ratio between the sum of its divisors and itself. We generalize previous results on abundancy indices by defining a two-variable abundancy index function as $I(x,n)\colon\mathbb{Z^+}\times\mathbb{Z^+}\to\mathbb{Q}$ where $I(x,n)=\frac{\sigma_x(n)}{n^x}$. Specifically, we extend limiting properties of the abundancy index and construct sufficient conditions for rationals greater than one that fail to be in the image of the functi...
November 18, 2010
Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows unbounded. The same result holds if $\sigma(n)/n$ is replaced by $n/\phi(n)$, where $\phi(n)$ is Euler's totient function.
June 2, 2021
A positive integer $n$ is called perfect if $ \sigma(n)=2n$, where $\sigma(n)$ denote the sum of divisors of $n$. In this paper we study the ratio $\frac{\sigma(n)}{n}$. We define the function Abundancy Index $I:\mathbb{N} \to \mathbb{Q}$ with $I(n)=\frac{\sigma(n)}{n}$. Then we study different properties of the Abundancy Index and discuss the set of Abundancy Index. Using this function we define a new class of numbers known as superabundant numbers. Finally, we study superab...
June 17, 2015
We begin by introducing an interesting class of functions, known as the Schemmel totient functions, that generalizes the Euler totient function. For each Schemmel totient function $L_m$, we define two new functions, denoted $R_m$ and $H_m$, that arise from iterating $L_m$. Roughly speaking, $R_m$ counts the number of iterations of $L_m$ needed to reach either $0$ or $1$, and $H_m$ takes the value (either $0$ or $1$) that the iteration trajectory eventually reaches. Our first ...
April 23, 2021
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 $m,n$ such that $\frac{n}{\sigma(n)}+ \frac{m}{\sigma(m)}=1$. We first give some groundwork in introductory number theory, then the goal of the paper is to determine if all numbers are feebly amicable with at least one other number by using kn...
September 7, 2021
In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function $\beta.$ We improve previous results when $f=\varphi$ and derive new estimates when $f=\Psi, f=\sigma$ and $f=\beta.$
December 17, 2013
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.
June 20, 2011
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading factors of the infinite product over zeta-functions. If rooted at the Dirichlet series for powers, for sums-of-divisors and for Euler's totient, the inheritance of multiplicativity through Dirichlet convolution or ordinary multiplication of pairs...
September 14, 2004
Let $\phi(\cdot)$ and $\sigma(\cdot)$ denote the Euler function and the sum of divisors function, respectively. In this paper, we give a lower bound for the number of positive integers $m\le x$ for which the equation $m=n-\phi(n)$ has no solution. We also give a lower bound for the number of $m\le x$ for which the equation $m=\sigma(n)-n$ has no solution. Finally, we show the set of positive integers $m$ not of the form $(p-1)/2-\phi(p-1)$ for some prime number $p$ has a posi...