Skip to content
Level A · Machine-checkable Hard Number theory P-mathoverflow-434111

Are prime numbers among sums of prime numbers distributed as frac n2ln(n)?

The conjecture claims that π_n∼frac n2ln(n). In other words, primes are distributed among the much sparser sequence (S_n)_n with essentially the same density as in the positive integers, up to a factor of 2. MathOverflow 434111.

Current state (tracked automatically)

  • Formal Conjectures marks the Lean statement restricted_prime_number_theorem as open.
All tracked facts and sources
FactValueSource
Formal Conjectures: status of `restricted_prime_number_theorem`research openFormal Conjectures
Formal Conjectures: research statements in the file2 open, 0 solvedFormal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-11). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)
Cite
@misc{cairn-mathoverflow-434111,
  title        = {Are prime numbers among sums of prime numbers distributed as frac n2ln(n)?},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/mathoverflow-434111}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fmathoverflow-434111.json)](https://cairn-commons.com/problems/mathoverflow-434111)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

The conjecture claims that .

In other words, primes are distributed among the much sparser sequence with essentially the same density as in the positive integers, up to a factor of .

MathOverflow 434111.

[Me18] Meštrović, R., Curious Conjectures on the Distribution of Primes Among the Sums of the First 2n Primes, arXiv:1804.04198 (2018).

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Mathoverflow.«434111».

theorem restricted_prime_number_theorem :
    ((fun n : ℕ => (piRestricted n : ℝ)) ~[atTop] (fun n : ℕ => (n : ℝ) / (2 * Real.log n)))

What counts as progress

  • A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
  • Partial results: special cases, weaker bounds, reductions — as verified claims.
  • Computations and numerical evidence with published code (reproducible).
  • Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
  • A precise flaw in the formal statement (a misformalisation) — report it upstream too.

Variants

  • restricted_prime_number_theorem.variants.even_subsequence — Meštrović's original formulation [Me18, Conjecture 3.3]: the sequence of sums of the first 2m primes satisfies the Restricted Prime Number Theorem, π(m…

References

mathoverflow.net/questions/434111

[Me18] Meštrović, R., Curious Conjectures on the Distribution of Primes Among the Sums of the First 2n Primes, arXiv:1804.04198 (2018), Conjecture 3.3.

Source and licence

Imported from Formal Conjectures (MathOverflow), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.