Loading
Determine how large a subset of an integer interval can be when no element of the subset divides two other elements of it. Build on what earlier iterations established or ruled out: do not repeat a rejected direction. Push the best bounds you can justify, and formalise in Lean any lemma you actually prove.
Engine unreachable
Something went wrong
Nothing is shown rather than something invented. Start the orchestrator API and reload.
Engine unreachable
Something went wrong
Nothing is shown rather than something invented. Start the orchestrator API and reload.
0 agents · 0 working
No agents yet.
Agents appear when the engine assigns them to this iteration.
RESEARCHING
No direction is open.