🔢 mathematics

Certified Minimal-Prime Branch Closures for Odd Perfect Numbers

This paper presents a certified proof establishing the closure of the five minimal-prime branches ( $q=5,7,11,13,17$ ) for odd perfect numbers by combining exact $q$ -adic valuation constraints with lower-prime avoidance, verified through a specific frozen certificate release, while explicitly noting that the existence of odd perfect numbers remains unproven and other prime branches remain unaddressed.

Original authors: Marco Mantovanelli

Published 2026-07-07

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Marco Mantovanelli

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Great Prime Hunt: Closing the Doors on "Odd Perfect Numbers"

Imagine you are a detective trying to find a very specific, mythical creature called an Odd Perfect Number.

In the world of math, a "perfect number" is like a perfectly balanced scale. If you take a number, find all the smaller numbers that divide into it evenly (its divisors), and add them all up, the total should equal exactly twice the original number.

Example: The number 6 is perfect. Its divisors are 1, 2, and 3. $1 + 2 + 3 = 6$ . And $6 \times 2 = 12$ ? No, wait—the rule is that the sum of divisors equals 2 times the number. So for 6: $1+2+3+6 = 12$ . Yes!
The Mystery: We know even perfect numbers exist (like 6, 28, 496). But for centuries, no one has ever found an Odd Perfect Number. No one has even proven they don't exist. They are the "unicorns" of number theory.

This paper, by Marco Mantovanelli, doesn't prove that unicorns don't exist. Instead, it does something very specific: it locks the doors to five specific rooms where a unicorn might be hiding.

The "Smallest Prime" Detective Work

Every number is built from "prime bricks" (like 2, 3, 5, 7, 11, etc.).

If a number is odd, it can't use the brick "2".
The paper focuses on the smallest brick used to build the number. Let's call this the "Key Brick."

The author asks: "What if the Key Brick is 5? What if it's 7? What if it's 11, 13, or 17?"

The Analogy of the Hotel:
Imagine a giant hotel where every room represents a possible Odd Perfect Number.

The Key Brick determines which floor you are on.
If the Key Brick is 3, you are on the 3rd floor.
If the Key Brick is 5, you are on the 5th floor.
If the Key Brick is 7, you are on the 7th floor.

The paper does not say the hotel is empty. It admits we haven't checked the 3rd floor (Key Brick = 3) or the floors above 17.

However, the paper claims to have completely searched and locked the doors to the 5th, 7th, 11th, 13th, and 17th floors. It proves that if you try to build a perfect number using 5 as your smallest brick, the math simply falls apart. The same goes for 7, 11, 13, and 17.

How Did They Do It? (The "Balance Scale" and the "Forbidden List")

The author uses two main tools to prove these floors are empty:

1. The Balance Scale (The Valuation Balance)
Think of the equation $\sigma(N) = 2N$ as a balance scale.

On one side, you have the sum of all the divisors.
On the other, you have twice the number.
For the scale to balance, the "weight" contributed by the smallest prime (the Key Brick) must be perfectly matched by the other primes.
The author calculates exactly how much "weight" the Key Brick needs. Then, they look at the other bricks to see if they can provide that weight.

2. The Forbidden List (Lower-Prime Avoidance)
This is the clever part.

If the Key Brick is 5, then the number cannot be built with the brick 3. (Because 3 is smaller than 5, and 5 is supposed to be the smallest).
So, when the author checks if the other bricks can balance the scale, they have a strict rule: "No 3s allowed!"
They try to build the number using only bricks 5 and up. They try every possible combination.
The Result: Every single time they try to balance the scale without using a 3, the math breaks. Either the scale tips too far, or they are forced to use a brick that is forbidden, or they run out of bricks.

The "Certificate" System: A Digital Audit

The paper is not just a story; it's a massive, computer-checked audit.

Imagine a giant spreadsheet (a "Certificate") that lists every single possible way to build a number on the 5th floor.
The author wrote a computer program to check every single line of that spreadsheet.
For every line, the program says: "This fails because it needs a 3," or "This fails because the numbers get too big," or "This fails because the math equation has no solution."
The paper provides the digital "receipts" (files and code) so anyone can run the program and see the same results. It's like a bank audit where every transaction is verified by a machine.

What About the Other Floors?

The author is very careful not to overclaim.

The 3rd Floor (Key Brick = 3): This is a special case. Because 3 is the smallest odd prime, there is no "Forbidden List" below it. The rules are different, so this paper doesn't touch it.
Floors 19 and up: There are too many combinations to check with this specific method right now. The author says, "We closed the first five difficult floors. The rest are left for future detectives."

The Bottom Line

This paper is a certified proof that Odd Perfect Numbers cannot exist if their smallest prime factor is 5, 7, 11, 13, or 17.

It doesn't prove that Odd Perfect Numbers don't exist at all. It just proves that if they do exist, they must be built with a smallest prime of 3 (which is a different, unsolved puzzle) or a very large prime (19 or higher).

Think of it as the author clearing out five specific, crowded attics in a haunted house, proving with a flashlight and a checklist that no ghosts are hiding in those specific rooms. The house might still be haunted, but those five rooms are definitely empty.

Technical Summary: Certified Minimal-Prime Branch Closures for Odd Perfect Numbers

Problem Statement
The paper addresses the classical open problem of the existence of odd perfect numbers (OPNs), defined as positive odd integers $N$ satisfying $\sigma(N) = 2N$ , where $\sigma$ is the sum-of-divisors function. While extensive literature has established global lower bounds for $N$ and the number of its prime factors, a complete nonexistence proof remains elusive. This work focuses specifically on the "minimal-prime branch" problem: determining whether an OPN can exist where the smallest prime divisor, $q = \min\{p : p \mid N\}$ , takes specific small values.

The paper isolates and attempts to close the branches for $q \in \{5, 7, 11, 13, 17\}$ . It explicitly clarifies that these are minimal-prime assertions; a closure of the $q=5$ branch, for instance, proves that no OPN exists with 5 as its smallest prime divisor (implying $3 \nmid N$ ), but does not rule out OPNs divisible by 5 if 3 is also a factor (which would fall under the $q=3$ branch). The cases $q=3$ and $q \ge 19$ are explicitly excluded from the scope of this work.

Methodology
The approach utilizes a "branch-and-bound" certification strategy driven by local $q$ -adic valuations and lower-prime avoidance constraints. The methodology proceeds through the following logical layers:

Valuation Balance: Based on Euler's form $N = \pi^\alpha M^2$ (where $\pi$ is the Euler prime), the paper establishes a $q$ -adic valuation balance equation. For a minimal prime $q$ , the valuation $v_q(\sigma(N)) = v_q(2N) = v_q(N)$ must be supplied entirely by the divisor sums of other prime powers in $N$ , as $\sigma(q^{e_q}) \equiv 1 \pmod q$ .
Lower-Prime Avoidance: Since $q$ is the minimal prime, no prime $\ell < q$ can divide $N$ . Consequently, for every prime power $p^e$ in the factorization of $N$ , the condition $v_\ell(\sigma(p^e)) = 0$ must hold. This creates a strict "avoidance" filter that eliminates many potential configurations.
Input Witnesses and Coverage Splits: The proof identifies "input witnesses"—primes $p \neq q$ in the support of $N$ that contribute to the $q$ -adic valuation balance. The paper classifies these witnesses by their order modulo $q$ (denoted $d = \text{ord}_q(p)$ ). This leads to a finite "coverage split" of the branch into sub-cases (e.g., non-Euler witnesses of specific orders, or the Euler prime acting as a witness).
Reduced Cofactors and Forced Primes: For each sub-case, the paper analyzes the "reduced cofactor" (the cyclotomic factor $\Phi_d(p)$ $Φ_{d} (p)$ divided by the necessary power of $q$ $q$ ).
- If the cofactor has a prime divisor $\ell < q$ , the branch is refuted by lower-prime avoidance.
- If the cofactor has a prime divisor $r > q$ , this prime is "forced" into the support of $N$ . This forces a new constraint on the structure of $N$ .
- If the cofactor is a "pure" case (e.g., a power of 2), it is handled via specific Diophantine filters or tail certificates.
Tail Control and Certificates: For branches that are not immediately refuted or forced into a contradiction, the paper employs "tail envelopes." These use the inequality $H(K_{env}) \left(\frac{B}{B-1}\right)^M < 2$ , where $H$ is the product of prime factors $(p/(p-1))$ , $B$ is a lower bound for remaining primes, and $M$ is an upper bound on the count of remaining primes. If this product is less than 2, the branch cannot contain an OPN.

The proof is hybrid: the logical framework (lemmas, coverage splits, and theorems) is handwritten, while the exhaustive verification of the finite branches is performed by machine-readable certificates (JSONL files and Python verifiers).

Key Contributions

Formal Certification of Five Branches: The paper provides a complete, machine-verifiable closure of the minimal-prime branches for $q = 5, 7, 11, 13, 17$ .
Uniform Mechanism: It establishes a uniform "forced-or-pure" mechanism for handling these branches, reducing complex arithmetic problems to finite coverage splits and tail-control inequalities.
Reproducible Certificate Release: The author releases a frozen set of certificates ( $C_{small}$ ) containing the specific data (factorizations, order records, tail counts) required to verify the closures. This includes a "verifier contract" that separates the handwritten mathematical logic from the machine-checked arithmetic data.
Detailed Audit Model: The $q=5$ branch is presented as a detailed audit model, demonstrating the full derivation from the initial split to the final tail-control certificates, serving as a template for the other branches.

Results
The main theorem (Theorem 1.1 and Theorem 14.1) states that, relative to the certificate release $C_{small}$ , there is no odd perfect number $N$ such that $\min\{p : p \mid N\} \in \{5, 7, 11, 13, 17\}$ .

Specifically:

$q=5$ : The branch is split into three children ( $Q5E2, Q5E1, Q5N$ ) based on the Euler prime's residue and the existence of non-Euler witnesses. All sub-branches are closed via finite window checks, parametric tail certificates, and pure-family exclusions.
$q=7, 11, 13, 17$ : These branches are closed by verifying that their respective "strict frontier" leaves (the terminal nodes of the coverage splits) are either refuted by lower-prime avoidance, forced into a tail-controlled state, or eliminated by pure Diophantine screens (e.g., solving equations like $\Phi_5(x) = 11^c$ ).

Significance and Scope
The paper claims significance as a "certificate theorem" rather than a new global lower bound for $N$ . It does not prove that odd perfect numbers do not exist; it only proves that they cannot exist with 5, 7, 11, 13, or 17 as their smallest prime divisor.

The author emphasizes the modularity of the result:

It isolates the minimal-prime problem from the full OPN problem.
It provides a reproducible, machine-auditable framework for verifying specific arithmetic obstructions.
It leaves the $q=3$ branch (which lacks lower-prime avoidance constraints) and the $q \ge 19$ branch (requiring separate treatment of input orders) as open problems for future work.

The work relies on existing global filters (e.g., Nielsen's lower bounds on the number of prime factors) only as consistency checks, while the actual closures are driven by the valuation-labeled cyclotomic input and the finite certificates provided in the release.