All open problems
Source labels openChecked July 26, 2026

WikipediaNumber theory

First Hardy–Littlewood conjecture

Let P=(m1,,mk)P = (m_1, \dots, m_k) be a tuple of positive even integers. Let πP(n)\pi_P(n) denote the number of primes pnp\leq n such that (p,p+m1,,p+mk)(p, p + m_1, \dots, p + m_k) forms an admissible prime constellation. Let w(q;m1,,mk)w(q; m_1, \dots, m_k) denote the number of distinc...

Mathematical statement

Let P=(m1,,mk)P = (m_1, \dots, m_k) be a tuple of positive even integers. Let πP(n)\pi_P(n) denote the number of primes pnp\leq n such that (p,p+m1,,p+mk)(p, p + m_1, \dots, p + m_k) forms an admissible prime constellation. Let w(q;m1,,mk)w(q; m_1, \dots, m_k) denote the number of distinct residues of 0,m1,,mk0, m_1, \dots, m_k modulo qq, and let

CP=2kq primeq31w(q;m1,,mk)q(11q)k+1. C_P = 2 ^ k\prod_{\substack{q\ \text{prime} \\ q\geq 3}} \frac{1 - \frac{w(q; m_1, \dots, m_k)}{q}}{\left(1 - \frac{1}{q}\right)^{k+1}}.

Then

πP(n)CP2ndtlogk+1t. \pi_P(n)\sim C_P\int_2^n\frac{dt}{\log^{k+1}t}.

Statement source: Wikipedia statement material

Statement terms: CC-BY-SA-4.0

Attributed source material. Reuse must follow the linked attribution and share-alike terms.

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

first_hardy_littlewood_conjecture

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem first_hardy_littlewood_conjecture {k : } (m : Fin k.succ  ) :    FirstHardyLittlewoodConjectureFor m := 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