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.
Engine unreachable
Something went wrong
Nothing is shown rather than something invented. Start the orchestrator API and reload.
Showing all iterations.
500 RECORDS
18 objects · 3 links · 8 in complete graph
DIRECTION
HYPOTHESIS
REVIEW
PROOF
BLOCKED
No direction is open.