{-1,1}-perfect numbers: a certified window to 10⁶, seven negative signs, and the least counterexample to Ross's Conjecture 17
Abstract
Ross calls n an S-perfect number of the first kind when the divisors of n strictly between 1 and n can be given coefficients from S so that 1+Σⱼλⱼdⱼ=n; for S={-1,1} this is a signed-divisor, or subset-sum, condition. He conjectured that every odd nonsquare n with σ(n) ≥ 2n is {-1,1}-perfect, with computational evidence to 10⁴; the conjecture was disproved by Campbell in July 2026, who produced counterexamples ap with a an odd square, σ(a) ≥ 2a, and p>σ(a) prime. Neither paper bounds the least counterexample. We prove, by exhibiting and re-checking a signing certificate for each of the 1989 admissible n, that every odd nonsquare n ≤ 10⁶ with σ(n) ≥ 2n is {-1,1}-perfect — a hundred times the published range — and, in the same sweep, that seven negative coefficients always suffice there, a refinement neither source considers and one that is not a theorem in waiting: the minimum number of negative coefficients needed is already 29 somewhere below 2.6 · 10⁸. We give a self-contained modulus certificate refuting n₀=253 277 325=3²5²7² · 22973, which is the least member of Campbell's construction and is about 6810 times smaller than the instance he prints; and we record an exhaustive search, run twice in independent implementations and outside the formal development, which finds n₀ to be the least counterexample of any shape and finds exactly 61 counterexamples below 2.6 · 10⁸, all of the form 11025p with p prime, 22973 ≤ p ≤ 23581. Ross's two printed lists are reproduced and completed over n ≤ 80. All statements below except those explicitly labelled as computations outside the development are machine-checked in Lean 4; S[sec:verif] says exactly what the machine checks. We also record plainly that the arXiv posting arXiv:2512.04417 of Ross's paper is a republication of the 2024 journal article and that the two texts differ: the journal prints the verification range 10⁴, the posting prints no range at all.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-09-07 03:53 UTC
File fingerprint
058c57efcff42cdc088d039e832a78415bad4141541f36eb525f21ce5af2113a
Claim ledger
Stated results
PM1candidate2026-09-03
Kernel-bound window: every odd non-square n <= 10⁶ with sigma(n) >= 2n is -1,1-perfect, so the least counterexample to Ross's Conjecture 17 exceeds 10⁶
PM2known2026-09-03
253277325 = 3²*5²*7²*22973 is odd, non-square, abundant and NOT -1,1-perfect: a machine-checked counterexample to Ross's Conjecture 17, and the least member of Campbell's family
PM3known2026-09-03
The two necessary conditions: a -1,1-perfect n has sigma(n) even and sigma(n) >= 2n
PM4candidate2026-09-03
Every odd non-square n <= 10⁶ with sigma(n) >= 2n has a -1,1-presentation with at most SEVEN coefficients equal to -1
PM5known data2026-09-03
Ross's two printed lists reproduced AND completed over n <= 80: the -1,1-perfect n <= 80 are exactly his fifteen, and the sigma(n) >= 2n exceptions are exactly 18, 20, 36, 72
PM6routine2026-09-03
Negative controls: each hypothesis of the window theorem is load-bearing, and a wrong certificate is rejected
PM7candidate2026-09-03
The least counterexample to Ross's Conjecture 17 is 253277325; exactly 61 odd non-square n <= 2.6*10⁸ with sigma(n) >= 2n fail, and every one of them is 11025*p with p prime in [22973, 23581]
This ledger entry is reported in prose and is not bound to a Lean theorem.PM8known2026-09-03
Campbell's subset-sum criterion formalised, and Nat.divisors identified with a trial-division list so that a window sweep costs Theta(N^(3/2)) instead of Theta(N²)
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Ross (J. Integer Seq. 27 (2024), Article 24.7.5; posted to arXiv 4 Dec 2025 as arXiv:2512.04417) defines, verbatim:
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7