Erdős Problem #779
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: falsifiable (not automatically the live result).
Subject areas: number theory, primes.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Multiply the first \(n\) primes together, obtaining the primorial \(P\). Erdős Problem #779 asks whether there is always a later prime \(q\) which is smaller than \(P\) but has the property that \(P+q\) is also prime.
This is a quantified conjecture about every integer \(n>1\). It is labelled FALSIFIABLE: a single fully checked value of \(n\) for which every candidate fails would disprove it. No such counterexample is established in the sources checked. Falsifiable is a \logical classification, not the same thing as disproved.
A small example
For \(n=2\), the first two primes are 2 and 3, so \(P=6\). The candidate \(q=5\) satisfies \(3<5<6\), and \(P+q=11\) is prime. Thus the conjecture holds for this one case.
The next checks are equally concrete: \(n=3\) gives \(P=30\), candidate \(q=7\), and \(P+q=37\); \(n=4\) gives \(P=210\), candidate \(q=13\), and \(P+q=223\). In each example both \(q\) and \(P+q\) must be checked for primality.
The simple fact that \(\gcd(P,P+q)=1\) follows whenever \(q\) is a later prime, since it is coprime to every factor of \(P\). But coprimality with \(P\) does not make \(P+q\) prime. This is precisely the gap between Euclid-style arguments and the desired result.
What is known
Let \(p_1<p_2<\cdots<p_n\) be the first \(n\) primes, and write
$$
P_n=\prod_{i=1}^n p_i.
$$
The assertion is
$$
\forall n>1\quad \exists q\text{ prime}: \quad p_n<q<P_n,\qquad P_n+q\text{ prime}.
$$
A witness is admissible only if the strict inequalities hold. The maintained problem #779 attributes the conjecture to Deaconescu and reports a finite verification for \(n\leq1000\), but this audit did not inspect the original computational record or its primality certificates. It separately attributes a stronger prediction that a witness can be chosen with \(q\) polynomially bounded in \(n\). That is conjectural, not established by the reported finite tests.
A heuristic treats the primality of \(P+q\) for candidate primes as roughly random with chance \(1/\log P\). Such estimates can help prioritize numerical experiments. However, the events share strong arithmetic structure, so a naive independence approximation is not a proof.
The pinned FormalConjectures provider includes a file for #779, but the presence of a Lean statement is not evidence that its definition matches every quantifier above, nor that a proof has been formally checked.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: falsifiable not disproved; strict interval two primality predicates. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Re\produce the finite witness table with deterministic primality checks, \lo\gging \(n\), \(p_n\), \(P_n\), \(q\) and \(P_n+q\). Verify the pinned Lean statement for the first-prime index, strict inequalities, and the two prime predicates. Exhaust all candidates \(p_n<q<P_n\) before labelling any instance a counterexample. Do not infer a general result from the initial tested instances.
Sources and claim boundaries
- Erdős #779 and authenticated source return.
- Protected formal provider: google-deepmind/formal-conjectures at commit
85f863718beeec7b58a3a1926ee92e3472bc2020,FormalConjectures/ErdosProblems/779.lean. Statement equivalence and any Lean proof are NOT verified. - Historical [Gu83] and Deaconescu finite results: cited only via maintained catalogue, original sources pending. No mathematical certification or editorial admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2050 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.