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 known results about the abundancy index. We establish that not all numbers are feebly amicable with at least one other number. We generate data using the R programming language and give some questions and conjectures.
Similar papers 1
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 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...
August 24, 2020
The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor function. It measures the extent to which a number is highly divisible into parts, such that the parts are highly divisible into subparts, so on. Just as the divisor function motivates the abundant and perfect numbers, the recursive divisor...
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, 2017
For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable pair is a pair of distinct positive integers each of which is the sum of the proper divisors of the other. Gmelin (1917) conjectured that there is no relatively prime amicable pairs and Artjuhov (1975) and Borho (1974) proved that for any fix...
March 24, 2017
In this note, we investigate properties of the ratio $D(n)/n$, which we will call the deficiency index. We will discuss some concepts recast in the language of the deficiency index, based on similar considerations in terms of the abundancy index.
December 31, 2010
Two numbers $m$ and $n$ are considered amicable if the sum of their proper divisors, $s(n)$ and $s(m)$, satisfy $s(n) = m$ and $s(m) = n$. In 1981, Pomerance showed that the sum of the reciprocals of all such numbers, $P$, is a constant. We obtain both a lower and an upper bound on the value of $P$.
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...
August 14, 2013
We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.
November 9, 2012
Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural question in this direction to find a first integer, if exists, which violates this inequality. Following this process, we introduce a new sequence of numbers and call it as extremely abundant numbers. In this paper we show that the Riemann hyp...