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 5.
70 RECORDS
7 objects · 0 links · 2 in complete graph
DIRECTION
PROOF
BLOCKED
No direction is open.