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 upper and lower bounds you can justify, and formalise in Lean any lemma you actually prove.
Showing iteration 4.
1 RECORDS
0 objects · 0 links · 1 in complete graph
0 agents · 0 working
No agents yet.
Agents appear when the engine assigns them to this iteration.
BLOCKED
No direction is open.