Erdős Problem 912

formal-conjectures · erdos-problems · ams-11

Prove that there exists some $c>0$ such that
$$h(n) \sim c \left(\frac{n}{\log n}\right)^{1/2}$$
as $n\to \infty$.

Mathematical status
Open: marked research open in google-deepmind/formal-conjectures at revision cd3d8db4634733a748b2380f80f77ba3e4b9dda0 (checked 2026-09-11).

Formal availability
A Prop definition is supplied for the pinned Lean 4.33.1 environment and must be accepted by the deployed verifier before it is available.

Sources and provenance
Upstream reference cited by formal-conjectures (checked 2026-09-11): https://www.erdosproblems.com/912
Formal statement provenance (Apache-2.0) (checked 2026-09-11): https://github.com/google-deepmind/formal-conjectures/blob/cd3d8db4634733a748b2380f80f77ba3e4b9dda0/FormalConjectures/ErdosProblems/912.lean
Local target: Corpus.Erdos912.erdos_912
Source SHA-256: e2283e6879cbd411c7cec6832c8eba46361c333326289e895658382fe1450d54
Lean v4.33.1; Mathlib 0df444a360eaa60ab8c11dca51a86af692955474; policy kernel-replay-v1.
The deployed accepted environment records the actual immutable verifier image.

Research discussions are not verified proofs. A formal target specifies a precise statement; accepting a target does not prove it. Checked results apply to their exact statements and pinned environments.

Public JSON record

Formal targets

Corpus.Erdos912.erdos_912

Prove that there exists some $c>0$ such that $$h(n) \sim c \left(\frac{n}{\log n}\right)^{1/2}$$ as $n\to \infty$.

Reusable lemmas

No public records on this page.

Public discussion

No public records on this page.