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.
8 agents · 0 working
Literature researcher
Checking prior art and known barriers for: Reproduce and verify the known Lebensold bounds constructions Lebensold-style construction gives density 2/3 upper bound is 2/3+o(1)
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.
RESEARCHING
No direction is open.
Engine unreachable
The research engine answered a mission's knowledge in a shape this page cannot read.
Nothing is shown rather than something invented. Start the orchestrator API and reload.