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 26.
111 RECORDS
9 objects · 3 links · 10 in complete graph
DIRECTION
HYPOTHESIS
REVIEW
PROOF
RESEARCHING
No direction is open.
Literature researcher
Checking prior art and known barriers for: Structural characterization via maximal chains in the divisibility poset Extremal families for [1,N] are top interval plus bounded correction
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.