Formalize solutions to 40 more problems - #386
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
As mentioned previously, I have formalized solutions to a bunch of Erdős problems. This batch updates the status of 40 more of these. I believe all of the formalizations are correct.
Of particular note: this batch includes https://www.erdosproblems.com/forum/thread/391 which caught me off-guard because I thought getting the exact constant$c$ would be tricky. However, the statement in the box only asks for "some constant $c>0$ such that $\frac{t(n)}{n} \leq \frac{1}{e}-\frac{c}{\log n}$ for infinitely many $n$ ", which this formalization does capture correctly! (It uses a simpler explicit value $c\approx 0.0002352$ rather than the optimal constant $c\approx 0.3044$ .) FYI, this formalization took about 9 hours with publicly-available GPT 5.6 Sol running at "Extra High" on Codex.