Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:defines |
A prime k-tuple is a sequence of k integers such that, for some integer n, all n plus the elements of the tuple are simultaneously prime.
|
| gptkbp:example |
(0, 2) is a prime 2-tuple (twin primes)
(0, 2, 6) is a prime 3-tuple (prime triplet) (0, 2, 6, 8) is a prime 4-tuple (prime quadruplet) |
| gptkbp:field |
number theory
|
| gptkbp:hasConjecture |
Hardy-Littlewood k-tuple conjecture
|
| https://www.w3.org/2000/01/rdf-schema#label |
prime k-tuples
|
| gptkbp:property |
A prime k-tuple must avoid covering all residue classes mod any prime
No k-tuple can have all elements even except for k=1 |
| gptkbp:relatedTo |
gptkb:twin_primes
prime numbers prime constellation prime quadruplets prime triplets |
| gptkbp:seeAlso |
prime gap
admissible k-tuple prime pattern prime quintuplet prime sextuplet |
| gptkbp:bfsParent |
gptkb:Hardy–Littlewood_k-tuple_conjecture
|
| gptkbp:bfsLayer |
8
|