Is the prime patterns conjecture true?
Basic
5
Ṁ912101
83%
chance
1D
1W
1M
ALL
Let S be a finite set of integers. Then S is the pattern for a set of prime numbers P if there is some n such that P = { n + s | s ∈ S}.
S is admissible if it doesn't intersect all of the residue classes mod p for any prime p. The prime patterns conjecture states that any finite, admissible set is the pattern for infinitely many sets of primes. In other words, for any admissible S, there are infinitely many values of n for which n + s₁, n + s₂, ..., n + sₖ are all prime (where s₁, s₂, ..., sₖ are the elements of S).
This is a generalization of all of the following conjectures:
/JosephNoonan/is-de-polignacs-conjecture-true
/NcyRocks/are-there-infinitely-many-twin-prim
/JosephNoonan/are-there-infinitely-many-cousin-pr
This question is managed and resolved by Manifold.
Get
1,000
and3.00
Related questions
Related questions
Is the Unique Games Conjecture true?
65% chance
Is Hadwiger's conjecture true?
58% chance
Is Haborth's Conjecture true?
70% chance
Is Goodman's Conjecture true?
71% chance
Is Beal's conjecture true?
60% chance
Is the abc conjecture correct?
80% chance
Is Rudin's conjecture true?
69% chance
Is the strong Rudin's conjecture true?
64% chance
Is the Hodge conjecture true?
80% chance
Is the gold partition conjecture true?
73% chance