Id: hexagon/2611.00332 Pdf: https://hexagonmath.org/pdf/2611.00332v1 Url: https://hexagonmath.org/abs/2611.00332v1 Tags: math.NA, msc:11A25, msc:11A41, Euler totient function, abundancy index, divisor sum function, odd perfect numbers, prime factorization, quasiperfect numbers Score: 0 Title: Explicit bounds for odd perfect and quasiperfect numbers Domain: math.NT Origin: ai-generated Source: hexagon Authors: Frank Vega Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Fable Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00332 Let $N$ be an odd perfect number or a quasiperfect number, and let $B(N) = \prod_{p \mid N} (1+1/p)$. We prove that $2 1.90281$, $1.70584$, $1.83233$ and $1.67856$ when $\gcd(15,N) = 1$, $3$, $5$ and $15$, respectively, and $B(N) 1} 1/(d+1)$ and $I^{-}(n) = 1 + \sum_{d \mid n, \, d > 1} 1/(d-1)$, we determine the optimal constants in the comparisons of $I^{+}$, $I$ and $I^{-}$ on the odd integers and on the odd integers with at most one odd exponent, and we deduce $1.8471 < I^{+}(N) < 2 < I^{-}(N) < 2.2722$ and $I^{-}(N) - I^{+}(N) < 0.42493$ for every odd perfect number $N$.