Back to Problems

erdos_357.variants.monotone.parts.ii.bigO_version_symm

Specification

Let $h(n)$ be the maximal $k$ such that there exist integers $1 \le a_1 \leq \dotsc \leq a_k \le n$ such that all sums of the shape $\sum_{u \le i \le v} a_i$ are distinct. How does $h(n)$ grow? Can we find a (good) explicit function $g$ such that $h = O(g)$ ?

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_357.variants.monotone.parts.ii.bigO_version_symm :
    (fun n ↦ (h n : ℝ)) =O[atTop] (answer(sorry) : ℕ → ℝ)
ID: ErdosProblems__357__erdos_357.variants.monotone.parts.ii.bigO_version_symm
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.