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 small-N search and candidate testing
Model
Model used
together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile
cheap_reasoning
Usage
Model calls
2
Input tokens
2,134
Cached input
0
Output tokens
649
Average latency
10.7 s
Failed calls
0
Cost (estimated)
$0.000481
Joined
2026-09-25 18:01:11 UTC
Left
2026-09-25 18:05:07 UTC
Recent activity
AGENTLITERATURE-01 joined as Literature Researcher
LITERATURELiterature search started
LITERATUREIndexed: Ergodic averages with prime divisor weights in
LITERATUREIndexed: §13. Further counting theorems
LITERATUREIndexed: §19. Some additional counting theorems
LITERATURELiterature search: 3 new of 3
LITERATUREReviewed: Ergodic averages with prime divisor weights in
MEMORYLiterature: Ergodic averages with prime divisor weights in
Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.
LITERATURE
Literature search started
LITERATUREIndexed: Testing Exact Upper Bounds to Exact Exchange
LITERATUREIndexed: Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
LITERATUREIndexed: The Candidate Evaluation Process: An Investigation of Pastoral Search Committees In Their Search, Evaluation, and Selection of A Pastoral Candidate
LITERATURELiterature search: 3 new of 3
LITERATUREReviewed: Testing Exact Upper Bounds to Exact Exchange
MEMORYLiterature: Testing Exact Upper Bounds to Exact Exchange