Back to Problems

erdos_1063.variants.exp_upper_bound

Specification

The least common multiple bound implies $n_k \le \exp((1 + o(1))k)$.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_1063.variants.exp_upper_bound :
    ∃ f : ℕ → ℝ, Tendsto f atTop (𝓝 0) ∧
      ∀ k, (n k : ℝ) ≤ exp ((1 + f k) * k)
ID: ErdosProblems__1063__erdos_1063.variants.exp_upper_bound
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.