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.
Showing iteration 14.
90 RECORDS
7 objects · 0 links · 9 in complete graph
DIRECTION
PROOF
RESEARCHING
No direction is open.
Explorer
Explore direction: Rigorous lower bound via modified (N/3,N] interval with Lean verification
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.