Skip to main content
QUICK REVIEW

[Paper Review] Upper Bounds for the Abundancy Indices I(n) and $I(n^2)$ where $N = {q^k}{n^2}$ is an Odd Perfect Number

Keneth Adrian P. Dagal, Jose Arnaldo B. Dris|arXiv (Cornell University)|Sep 4, 2013
Analytic Number Theory Research1 citations
TL;DR

This paper investigates the abunance indices $I(n)$ and $I(n^2)$ for odd perfect numbers of the form $N = q^k n^2$ with Euler prime $q$, proving unconditionally that $q < n$ and establishing a biconditional involving divisors that holds regardless of the Dris conjecture $q^k < n$. The key contribution is the unconditional validation of a critical biconditional and the strict inequality $q < n$, strengthening constraints on odd perfect numbers.

ABSTRACT

We investigate the implications of a curious biconditional involving divisors of odd perfect numbers, if Dris conjecture that $q^k < n$ holds, where $q^k n^2$ is an odd perfect number with Euler prime $q$. We then show that this biconditional holds unconditionally. Lastly, we prove that the inequality $q<n$ holds unconditionally.

Motivation & Objective

  • To analyze the implications of a biconditional involving divisors of odd perfect numbers under the assumption of Dris's conjecture $q^k < n$.
  • To determine whether this biconditional holds without assuming Dris's conjecture.
  • To establish unconditionally that $q < n$ for odd perfect numbers $N = q^k n^2$ with Euler prime $q$.
  • To refine bounds on the abundancy indices $I(n)$ and $I(n^2)$ in the context of odd perfect number theory.

Proposed method

  • The authors analyze the structure of odd perfect numbers $N = q^k n^2$, where $q$ is the Euler prime and $q \equiv k \equiv 1 \pmod{4}$, using properties of the abundancy index $I(x) = \sigma(x)/x$.
  • They derive a biconditional statement linking divisor conditions to the behavior of $I(n)$ and $I(n^2)$, using algebraic manipulation of divisor sums and inequalities.
  • The proof of the biconditional's unconditional validity relies on number-theoretic identities and bounds on multiplicative functions related to $σ(n)$ and $σ(n^2)$.
  • The inequality $q < n$ is established through comparison of the abundancy indices $I(n)$ and $I(n^2)$, leveraging known bounds and the fact that $I(n^2) < 2/I(q^k)$.
  • The authors use the fact that $I(n^2) < 2/I(q^k)$ and the monotonicity of $I(n)$ in $n$ to derive constraints on $q$ and $n$.
  • The argument combines known results on odd perfect numbers with new inequalities derived from the structure of $I(n)$ and $I(n^2)$, culminating in the unconditional proof of $q < n$.

Experimental results

Research questions

  • RQ1Does the biconditional involving divisors of odd perfect numbers hold unconditionally, independent of Dris's conjecture $q^k < n$?
  • RQ2Can the inequality $q < n$ be proven unconditionally for odd perfect numbers $N = q^k n^2$?
  • RQ3What are the implications of the biconditional for the bounds on $I(n)$ and $I(n^2)$?
  • RQ4How do the abundancy indices $I(n)$ and $I(n^2)$ constrain the possible values of $q$ and $n$ in odd perfect numbers?
  • RQ5What structural properties of odd perfect numbers emerge from analyzing the biconditional and the inequality $q < n$?

Key findings

  • The biconditional involving divisors of odd perfect numbers holds unconditionally, regardless of the truth of Dris's conjecture $q^k < n$.
  • The inequality $q < n$ is proven unconditionally for any odd perfect number $N = q^k n^2$ with Euler prime $q$.
  • The abundancy index $I(n^2)$ satisfies $I(n^2) < 2/I(q^k)$, which is instrumental in deriving the bound $q < n$.
  • The proof relies on the monotonicity of the abundancy function and known bounds on $σ(n)$ and $σ(n^2)$, leading to a strict inequality between $q$ and $n$.
  • The results strengthen the structural constraints on odd perfect numbers, narrowing the possible configurations of $q$ and $n$.
  • The analysis confirms that $q < n$ is not contingent on unproven conjectures, making it a firm result in odd perfect number theory.

Better researchstarts right now

From paper design to paper writing, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.