First Hardy–Littlewood conjecture
Let be a tuple of positive even integers. Let denote the number of primes such that forms an admissible prime constellation. Let denote the number of distinc...
Mathematical statement
Let be a tuple of positive even integers. Let denote the number of primes such that forms an admissible prime constellation. Let denote the number of distinct residues of modulo , and let
Then
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
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