Explicit bounds for odd perfect and quasiperfect numbers

Primarily AI-generated textHuman understanding: all partsmath.NT — Number Theorymath.NA — Numerical Analysis

Contributed by Frank Vega

Version 2 / Nov 12, 2026 / CC BY 4.0

Abstract

Let NN be an odd perfect number or a quasiperfect number, and let B(N)=∏p∣N(1+1/p)B(N) = \prod_{p \mid N} (1+1/p). We prove that 2<N/φ(N)<2.173722 < N/\varphi(N) < 2.17372 and that 105∤N105 \nmid N, and we obtain explicit two-sided bounds for B(N)B(N) according to the value of gcd⁡(15,N)\gcd(15,N). For an odd perfect number NN, they give B(N)>1.90281B(N) > 1.90281, 1.705841.70584, 1.832331.83233 and 1.678561.67856 when gcd⁡(15,N)=1\gcd(15,N) = 1, 33, 55 and 1515, respectively, and B(N)<1.84348B(N) < 1.84348, 1.935491.93549 and 1.841251.84125 when gcd⁡(15,N)=3\gcd(15,N) = 3, 55 and 1515. We also bound the abundancy indices of Nrad⁡(N)N \operatorname{rad}(N) and N/rad⁡(N)N/\operatorname{rad}(N) and the functions σ±\sigma^{\pm}, φ+\varphi^{+} and ψ+\psi^{+} of S\'andor and Atanassov at NN, and we bound the number kk of distinct prime factors of NN from below in terms of its least prime factor. If p1<⋯<pkp_{1} < \cdots < p_{k} are the prime factors of NN and mim_{i} is the part of NN composed of p1,…,pi−1p_{1}, \dots, p_{i-1}, then pi<2+2(k−i+1)I(mi)2/(4−I(mi)2)p_{i} < 2 + 2(k-i+1) I(m_{i})^{2}/(4 - I(m_{i})^{2}), where I(n)=σ(n)/nI(n) = \sigma(n)/n; in particular p1<2k/3+2p_{1} < 2k/3 + 2. For a quasiperfect number NN we prove that ∑p∣N1/p<log⁡I(N)\sum_{p \mid N} 1/p < \log I(N), that p4∣Np^{4} \mid N for every prime factor p≡3(mod8)p \equiv 3 \pmod{8} and p6∣Np^{6} \mid N for every prime factor p≡5(mod8)p \equiv 5 \pmod{8}, that rad⁡(N)≤N1/2\operatorname{rad}(N) \leq N^{1/2}, with rad⁡(N)≤N1/2/3\operatorname{rad}(N) \leq N^{1/2}/3 if 3∣N3 \mid N, and that two quasiperfect numbers differ by more than 4⋅1035/24 \cdot 10^{35/2}. Assuming the ABCABC conjecture, rad⁡(σ(N))≥cεN1/2−ε\operatorname{rad}(\sigma(N)) \geq c_{\varepsilon} N^{1/2-\varepsilon}, only finitely many pairs of an even perfect number and a quasiperfect number lie at a given distance, and no three perfect or quasiperfect numbers lie in an interval of fixed length infinitely often. Finally, for the shifted abundancy indices I+(n)=1+∑d∣n, d>11/(d+1)I^{+}(n) = 1 + \sum_{d \mid n, \, d > 1} 1/(d+1) and I−(n)=1+∑d∣n, d>11/(d−1)I^{-}(n) = 1 + \sum_{d \mid n, \, d > 1} 1/(d-1), we determine the optimal constants in the comparisons of I+I^{+}, II and I−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.27221.8471 < I^{+}(N) < 2 < I^{-}(N) < 2.2722 and I−(N)−I+(N)<0.42493I^{-}(N) - I^{+}(N) < 0.42493 for every odd perfect or quasiperfect number NN.

Provenance statement

The author used Claude (Anthropic) to write the verification script experiments.py of Section 22, to generate parts of the text of this manuscript, and in working out and checking several of the arguments. The experiments were run by the author. After using this tool, the author reviewed and edited the code and the content as needed and takes full responsibility for the content of the publication.
AI provenance filesexperiments.py · 45 KB

Tools used

Anthropic
Claude FableVersion 5.2

References

  1. Apostol, Tom M. Introduction to Analytic Number Theory. Springer-Verlag. 1976DOI
  2. Chen, Feng-Juan; Chen, Yong-Gao. On the index of an odd perfect number. Colloquium Mathematicum, vol. 136, no. 1, pp. 41–49. 2014DOI
  3. Cohen, Graeme L. On odd perfect numbers. The Fibonacci Quarterly, vol. 16, no. 6, pp. 523–527. 1978DOI
  4. Dickson, Leonard Eugene. History of the Theory of Numbers. Carnegie Institution of Washington, no. 256. 1919
  5. Dimitrov, Stoyan. Inequalities involving arithmetic functions. Lithuanian Mathematical Journal, vol. 64, no. 4, pp. 421–452. 2024DOI
  6. Dris, Jose Arnaldo B. The abundancy index of divisors of odd perfect numbers. Journal of Integer Sequences, vol. 15, no. 4, pp. Article 12.4.4. 2012link
  7. Grün, Otto. Über ungerade vollkommene Zahlen. Mathematische Zeitschrift, vol. 55, pp. 353–354. 1952link
  8. Hagis Jr, Peter; Cohen, Graeme L. Some results concerning quasiperfect numbers. Journal of the Australian Mathematical Society, vol. 33, no. 2, pp. 275–286. 1982DOI
  9. Hardy, G. H.; Wright, E. M. An Introduction to the Theory of Numbers. Oxford University Press. 2008
  10. Harris, Charles R.; Millman, K. Jarrod; van der Walt, Stéfan J.; Gommers, Ralf; Virtanen, Pauli; Cournapeau, David; Wieser, Eric; Taylor, Julian; Berg, Sebastian; Smith, Nathaniel J.; Kern, Robert; Picus, Matti; Hoyer, Stephan; van Kerkwijk, Marten H.; Brett, Matthew; Haldane, Allan; del Río, Jaime Fernández; Wiebe, Mark; Peterson, Pearu; Gérard-Marchant, Pierre; Sheppard, Kevin; Reddy, Tyler; Weckesser, Warren; Abbasi, Hameer; Gohlke, Christoph; Oliphant, Travis E. Array programming with NumPy. Nature, vol. 585, no. 7825, pp. 357–362. 2020DOI
Show all 30 referencesShow fewer references
  1. Hertlein, Alexander. Robin's Inequality for New Families of Integers. Integers, vol. 18. 2018
  2. Holdener, Judy A. Conditions equivalent to the existence of odd perfect numbers. Mathematics Magazine, vol. 79, no. 5, pp. 389–391. 2006DOI
  3. Johansson, Fredrik; others. mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 1.3.0). 2023. https://mpmath.org/link
  4. Kühnel, Ullrich. Verschärfung der notwendigen Bedingungen für die Existenz von ungeraden vollkommenen Zahlen. Mathematische Zeitschrift, vol. 52, pp. 202–211. 1950
  5. Laatsch, Richard. Measuring the abundancy of integers. Mathematics Magazine, vol. 59, no. 2, pp. 84–92. 1986DOI
  6. Lagarias, Jeffrey Clark. An Elementary Problem Equivalent to the Riemann Hypothesis. The American Mathematical Monthly, vol. 109, no. 6, pp. 534–543. 2002DOI
  7. Luca, Florian; Pomerance, Carl. On the radical of a perfect number. New York Journal of Mathematics, vol. 16, pp. 23–30. 2010link
  8. Mandal, Sagar. A note on newly introduced arithmetic functions φ+\varphi^{+} and σ+\sigma^{+}. Notes on Number Theory and Discrete Mathematics, vol. 31, no. 2, pp. 404–409. 2025DOI
  9. Meurer, Aaron; Smith, Christopher P.; Paprocki, Mateusz; Čertík, Ondřej; Kirpichev, Sergey B.; Rocklin, Matthew; Kumar, A. T.; Ivanov, Sergiu; Moore, Jason K.; Singh, Sartaj; Rathnayake, Thilina; Vig, Sean; Granger, Brian E.; Muller, Richard P.; Bonazzi, Francesco; Gupta, Harsh; Vats, Shivam; Johansson, Fredrik; Pedregosa, Fabian; Curry, Matthew J.; Terrel, Andy R.; Roučka, Štěpán; Saboo, Ashutosh; Fernando, Isuru; Kulal, Sumith; Cimrman, Robert; Scopatz, Anthony. SymPy: symbolic computing in Python. PeerJ Computer Science, vol. 3, pp. e103. 2017DOI
  10. Nielsen, Pace. Odd perfect numbers, Diophantine equations, and upper bounds. Mathematics of Computation, vol. 84, no. 295, pp. 2549–2567. 2015DOI
  11. Nielsen, Pace P. Odd perfect numbers have at least nine distinct prime factors. Mathematics of Computation, vol. 76, no. 260, pp. 2109–2126. 2007DOI
  12. Norton, Karl K. Remarks on the number of factors of an odd perfect number. Acta Arithmetica, vol. 6, no. 4, pp. 365–374. 1960DOI
  13. Ochem, Pascal; Rao, Michaël. Odd perfect numbers are greater than 10150010^{1500}. Mathematics of Computation, vol. 81, no. 279, pp. 1869–1877. 2012DOI
  14. Ochem, Pascal; Rao, Michaël. On the number of prime factors of an odd perfect number. Mathematics of Computation, vol. 83, no. 289, pp. 2435–2439. 2014DOI
  15. Rosser, J. Barkley; Schoenfeld, Lowell. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, vol. 6, no. 1, pp. 64–94. 1962DOI
  16. Ryan, Richard F. A simpler dense proof regarding the abundancy index. Mathematics Magazine, vol. 76, no. 4, pp. 299–301. 2003DOI
  17. Sándor, József; Atanassov, Krassimir T. Some new arithmetic functions. Notes on Number Theory and Discrete Mathematics, vol. 30, no. 4, pp. 851–856. 2024
  18. Stanton, William G.; Holdener, Judy A. Abundancy ``outlaws'' of the form σ(N)+tN\frac{\sigma(N)+t}{N}. Journal of Integer Sequences, vol. 10, no. 9, pp. Article 07.9.6. 2007link
  19. Weiner, Paul A. The abundancy ratio, a measure of perfection. Mathematics Magazine, vol. 73, no. 4, pp. 307–310. 2000DOI
  20. Zelinsky, Joshua. The Sum of the Reciprocals of the Prime Divisors of an Odd Perfect or Odd Primitive Non-Deficient Number. Integers, vol. 25, pp. #A59. 2025DOI

Version history

  1. v1 · 32 pagesSubmitted by Frank VegaInitial depositSupersededNov 11, 2026
  2. v2 · 36 pagesSubmitted by Frank VegaSubmitted as a new versionCurrentNov 15, 2026