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

Dickson's conjecture

Dickson's conjecture If a finite set of linear integer forms f_i(n) = a_i n+b_i satisfies Schinzel condition, there exist infinitely many natural numbers m such that f_i(m) are primes for all i.

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.

Start working on it Submit a claim Follow
Cite
@misc{cairn-dickson,
  title        = {Dickson's conjecture},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/dickson}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-29}
}

Also: CITATION.cff · Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

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

The problem

The question

dickson_conjecture. Dickson's conjecture If a finite set of linear integer forms satisfies Schinzel condition, there exist infinitely many natural numbers such that are primes for all .

generalized_twin_primes. The generalized twin-prime conjecture For any positive integer there are infinitely many primes such that is prime.

infinite_safe_primes. The infinitude of Sophie Germain primes There are infinitely many primes such that is prime.

infinite_cousin_primes. The infinitude of cousin primes There are infinitely many primes such that is prime.

infinite_sexy_primes. The infinitude of sexy primes There are infinitely many primes such that is prime.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.Dickson (5 statements).

theorem dickson_conjecture (fs : Finset ℤ[X]) (hfs : ∀ f ∈ fs, f.degree = 1 ∧ BunyakovskyCondition f)
    (hfs' : SchinzelCondition fs) : Infinite {n : ℕ | ∀ f ∈ fs, (f.eval (n : ℤ)).natAbs.Prime}
theorem generalized_twin_primes (k : ℕ) (hk : 0 < k) :
    Infinite {p : ℕ | p.Prime ∧ (p + 2 * k).Prime}
theorem infinite_safe_primes :
    Infinite {p : ℕ | Prime p ∧ Prime (2 * p + 1)}
theorem infinite_cousin_primes :
    Infinite {p : ℕ | Prime p ∧ Prime (p + 4)}
theorem infinite_sexy_primes :
    Infinite {p : ℕ | Prime p ∧ Prime (p + 6)}

What counts as progress

  • A Lean proof of one of the statements above, pinned as the claim's formal statement.
  • 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.

References

Source and licence

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