← Explore Harbor-Index
hle

hle-interval-coverage-bound

18 trials · 0% solve rate · task definition on Harbor Hub ↗

TN 17FN 1

Instruction

Let MM denote the smallest positive integer such that for any real numbers a1,a2,,a100000[0,1]a_1, a_2, \dots, a_{100000} \in [0,1], there exist real numbers x0,x1,x2,,x100000[1+10M,110M]x_0, x_1, x_2, \dots, x_{100000} \in [-1+10^{-M},1-10^{-M}] satisfying the property that xi1xi=ai|x_{i-1} - x_i| = a_i for each 1i1000001 \le i \le 100000. Find MM.

Write your answer to /logs/artifacts/response.txt in exactly this format:

Explanation: <your reasoning>
Answer: <your final answer>
Confidence: <your confidence as a percentage, e.g. 85%>

You have up to 30 minutes (1800 seconds) to complete this task. Do not cheat by using online solutions or hints specific to this task.

Trials

modeloutcomereward
DeepSeek V4terminus-2TN0.00view →
Gemini 3.1gemini-cliTN0.00view →
Gemini 3.1terminus-2TN0.00view →
GLM 5.2claude-codeTN0.00view →
GLM 5.2terminus-2TN0.00view →
GPT-5.5codexTN0.00view →
GPT-5.5terminus-2TN0.00view →
Kimi K2.6claude-codeTN0.00view →
Kimi K2.6terminus-2TN0.00view →
MiMo V2.5claude-codeTN0.00view →
MiMo V2.5terminus-2TN0.00view →
MiniMax M3claude-codeTN0.00view →
MiniMax M3terminus-2TN0.00view →
Opus 4.8claude-codeTN0.00view →
Opus 4.8terminus-2TN0.00view →
Qwen3.7claude-codeTN0.00view →
Qwen3.7terminus-2TN0.00view →
DeepSeek V4claude-codeFN0.00view →