A Study of @-numbers

Abstract

This paper deals more generally with @-numbers defined as follows: Call `\textit{alpha number}' of order $(\underlineα,\barα)\in\mathbb{H}^2$, (denote its family by @$_{(\underlineα,\barα)\in\mathbb{H}^2; \mathcal{A}\subset \mathbb{N}}$) any $n\in\mathcal{A}\subset \mathbb{N}$ satisfying $σ_{\underlineα}(n) = αn^{\barα}$ where $σ_{\underlineα}(n)$ is sum of divisors function and $α\in\mathbb{H}$, the set of \textit{quaternions}. Specifically, if integer $n$ is such that $α=α_1/α_2,\ α_1,α_2\in\mathbb{Z}^+$ with $1\leq\max(α_1, α_2) \le ω(n),$ $\ \le τ(n), \ < n$ (where $ω(n)$ is the number of distinct prime factors of $n$, $τ(n)$ is the number of factors of $n$), then $n$ is respectively called strong, weak or very weak alpha number. We give some examples and conjecture that there is no odd strong alpha number of order $(1,1)$. The truthfulness of this assertion implies that there is no odd perfect and certain odd multi-perfect numbers. We give all the strong even alpha numbers of order $(1,1)$ below $10^5$ and then show that there is no odd strong alpha number of order $(1,1)$ below $10^5$, using some of our results motivated by some results of Ore and Garcia. With computer search this bound can easily be surpassed. In this paper, using Rossen, Schonfield and Sandor's inequalities, in addition to the aforementioned definition, we also bound the quotient $α_1/α_2 =α$ of order $(1,1)$, though a very weak bound. Some areas for future research are also pointed out as recommendations.