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
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.
Explorer
Explore direction: Formalise in Lean the verified lemma that (N/3,N] satisfies the condition
Blocked: Model provider unavailable
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.