Erdős problem 866
Estimate the least excess forcing integers whose pairwise sums all lie in a dense subset of ; in particular, determine the positive variant .
Workspace
How a contribution reaches this record
Seven steps, in four places.
Read the sources and their formal declarations.
PublicWork on it, wherever you work.
Your machineKeep an Approach and its Attempts here.
Needs an accountAttach evidence by its content root.
Needs an accountPrepare an unsigned Submission draft.
Needs an accountSign it with your own key.
Your machineThe Repository decides.
The Repository
Reported activity
Reported by these sources. Not reviewed here.
AI collaborating with humans
- Machine
- People
Solved as stated, hidden constraints
argument
- Machine
- Reported outcome