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
Checking prior art and known barriers for: Formalise the lower bound (N/3, and explore additive improvements in Lean Formalised is admissible f(N) ceil(2N/3)
Model
Model used
together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile
cheap_reasoning
Usage
Model calls
2
Input tokens
1,962
Cached input
0
Output tokens
568
Average latency
5.8 s
Failed calls
0
Cost (estimated)
$0.000434
Joined
2026-09-25 18:06:14 UTC
Left
2026-09-25 18:08:56 UTC
Recent activity
AGENTLITERATURE-02 joined as Literature Researcher
LITERATURELiterature search started
LITERATUREIndexed: Problems in extremal graphs and poset theory
LITERATUREIndexed: Extremal Poset Theory
LITERATUREIndexed: Random and deterministic versions of extremal poset problems
LITERATURELiterature search: 3 new of 3
LITERATUREReviewed: Problems in extremal graphs and poset theory
MEMORYLiterature: Problems in extremal graphs and poset theory
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.