Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.04365

Certified Minimal-Prime Branch Closures for Odd Perfect Numbers

Marco Mantovanelli
View original source ↗Read source document ↗Export metadata ↓

Abstract

For an odd perfect number $N$, write $q=\min\{p:p\mid N\}$ for its smallest prime divisor. This paper proves a certified branch-closure theorem for the five minimal-prime branches $q=5,7,11,13,17$. The proof combines the exact $q$-adic valuation balance for $\sigma(N)=2N$ with lower-prime avoidance: primes below $q$ cannot occur in the support and therefore cannot divide any divisor-sum factor. These constraints reduce each branch to a finite first-input coverage split and then to terminal forced-or-pure cofactor records. The terminal records are checked by the frozen certificate release C-small-2026-07, consisting of JSONL certificate bundles, Python verifier scripts, expected terminal outputs, and SHA256 hashes. The $q=5$ branch is presented as the detailed audit model, while the branches $q=7,11,13,17$ are closed by the same forced-or-pure mechanism. The result is scoped: it does not prove nonexistence of odd perfect numbers, and the branches $q=3$ and $q\ge 19$ remain outside the paper.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Marco Mantovanelli. 2026-07-05. Certified Minimal-Prime Branch Closures for Odd Perfect Numbers. https://doi.org/10.13140/rg.2.2.33682.82888

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗