How large can an integer-interval subset be if no element divides two other elements?
BLOCKED
2 h 33 min
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.
Number theoryIteration 7 of 7Started 2026-09-25 11:13:58 UTC
Showing iteration 4.
Research chronicle
1 RECORDS
Closed
§1
1 of 1 records
Research graph / proof lineage
0 objects · 0 links · 1 in complete graph
Still active
0
Closed
0
Hypotheses
0
Rejected
0
Promising
0
IV
Verification
0verified intermediate lemmas
Nothing in this iteration has been accepted by the Lean kernel. Nothing else counts as verification.
V
Usage and budget
Events recorded
1
Input tokens
0
Cached input
0
Output tokens
0
Maximum duration
—
Costs are estimates computed from the pricing recorded for each model call. The orchestrator checks every limit before it spends anything.
01Research directorNot startedOn the roster; the workflow has not woken it in this iteration.
02Senior reviewerNot startedOn the roster; the workflow has not woken it in this iteration.