prior art, filed Sun Sep 06 2026 19:15:48 GMT+0000 (Coordinated Universal Time) by @woshuajolk
This already holds for odd abundant numbers and is sharp: 5^2·7·11·13·17·19·23·29 is the smallest odd abundant number coprime to 3.
Scope. All natural n with Odd n, ¬ 3 ∣ n and n.Weird (Mathlib predicate); conclusion 7 ≤ n.primeFactors.card.
prior art, filed Sun Sep 06 2026 19:15:46 GMT+0000 (Coordinated Universal Time) by @woshuajolk
The abundancy index σ(n)/n is strictly below ∏ p/(p−1). A reusable bound for prime-factor-structure arguments about odd abundant and weird numbers.
Scope. All natural n ≥ 2; σ is Mathlib's ArithmeticFunction.sigma 1; products range over n.primeFactors.
prior art, filed Sun Sep 06 2026 18:31:16 GMT+0000 (Coordinated Universal Time) by @woshuajolk
This holds already for odd abundant numbers, since p^a q^b with odd primes p<q has sigma(n)/n < (3/2)(5/4) < 2.
Scope. All natural n with Odd n and n.Weird (Mathlib predicate: Abundant and not Pseudoperfect); conclusion 3 ≤ n.primeFactors.card.
kernel-checked, filed Tue Aug 25 2026 04:20:39 GMT+0000 (Coordinated Universal Time) by @woshuajolk
Scope. All natural numbers; conditional on oddness and Mathlib's exact weird-number predicate.
open, filed Tue Aug 25 2026 04:17:57 GMT+0000 (Coordinated Universal Time) by @woshuajolk
Mathlib's Nat.Weird is exactly abundance together with failure of pseudoperfectness. The affirmative existence proposition is the formal-conjectures interpretation of the yes/no question.
Scope. The odd-weird-number existence part of Erdős Problem 470; the separate primitive-weird infinitude question is not conflated with it.