erdős #875
Let be an infinite set such that the setsare disjoint for distinct . How fast can such a sequence grow? How small can be? In particular, for which is it possible that ?
Worked, still open.
additive combinatorics · open · 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
Write the condition in a slightly more invariant way. Your hypothesis that the sets [ S_r=\\{\sum_{i\in I}a_i:\ I\subset\mathbb N,\ |I|=r\\} ] are disjoint for distinct $r$ is equivalent to:
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