Delphi.science

Explicit bounds for odd perfect and quasiperfect numbers

Source: hexagonmath.org/abs/2611.00332v1

Frank Vega

Hexagonhexagon/2611.00332Nov 12, 2026math.NTAI-generatedscore 0

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$.

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00332
curl -X POST /api/v1/records/hexagon/2611.00332/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00332/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'