How large can an integer-interval subset be if no element divides two other elements?
RESEARCHING
9 h 14 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 bounds you can justify, and formalise in Lean any lemma you actually prove.
Number theoryIteration 57 of 57Started 2026-09-25 11:13:58 UTC
Reading the landscape around: Exact computation via ILP/SAT and extremal set census
Model
Model used
together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile
cheap_reasoning
Usage
Model calls
2
Input tokens
1,873
Cached input
0
Output tokens
508
Average latency
4.5 s
Failed calls
0
Cost (estimated)
$0.000405
Joined
2026-09-25 18:17:20 UTC
Left
2026-09-25 18:20:14 UTC
Recent activity
AGENTLITERATURE-01 joined as Literature Researcher
LITERATURELiterature search started
LITERATURELiterature search: 3 new of 3
LITERATUREReviewed: An Upper Bound on the Divisor Counting Function
MEMORYLiterature: An Upper Bound on the Divisor Counting Function
LITERATURELiterature search started
LITERATUREIndexed: Figure 6: The Büchi automata built by Algorithm 2 for the sat-set computation of ELTL formulae.
LITERATUREIndexed: Vertex cover and Independent set (stable set): Exploiting the difficulty of SAT (satisfiability) computation to make computing optimal solutions easy
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.