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.
6 agents · 0 working · 2 blocked
RESEARCHING
No direction is open.
Explorer
Explore direction: Recursive interval-splitting with rigorous upper bounds via dynamic programming
Blocked: The model returned an unusable response
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.