All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 357: Big Theta Version

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

Mathematical statement

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

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_357.variants.monotone.parts.ii.bigTheta_version

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_357.variants.monotone.parts.ii.bigTheta_version :    (fun n  (h n : )) =Θ[atTop] (answer(sorry) :   ) := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References