erdős #709
Let be minimal such that, for any of size , in any interval of consecutive integers there exist distinct such that .Obtain good bounds for , or even an asymptotic formula.
Worked, still open.
number theory · open · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let me rewrite your $f(n)$ in the language that makes the combinatorics visible, and then I’ll give the best unconditional bounds I know (and what’s believed to be the truth).
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
Create a formalisation here · link
status
open