
Glossary: Prime Pages: Top 5000: 
In mathematics, a ktuple is an ordered set of
k values (a vector of degree k):
(a_{1}, a_{2}, ..., a_{k}).When working in the context of prime numbers a ktuple usually refers to a ktuple of distinct integers which are used as the constant terms in a ktuple of linear polynomials: (x + a_{1}, x + a_{2}, ..., x + a_{k}).The central questions then are: How often are these polynomial simultaneously prime? For which integer values of x are they all prime? The twin prime conjecture is equivalent to conjecturing the translates of the 2tuple (0, 2) (the values of the pair of polynomials (x, x+2)) are simultaneously prime values infinitely often. What about the 2tuple (0, 1)? Always either x or x+1 is even, so this 2tuple takes on simultaneous prime values only when x = 1. Another example is the 3tuple (0, 2, 4), this one also can only take on simultaneous prime once, because 3 must always divide one of the three terms (x, x+2, x+4). This means one of these three terms must be 3. Look at this ktuple modulo 3 and the problem is apparent: (0, 2, 1)this is a complete residue system for the prime 3. This is the only thing (as far as in known) that can stop a ktuple from yielding simultaneous prime infinitely often! For this reason we say that a ktuple is admissible if it does not include the complete residue system of any prime. As a final example, consider the 5tuple (5, 7, 11, 13, 17). (Since we are interested in the translates of this tuple, we could equally well just consider (0, 2, 6, 8, 12).) If this contains the complete residue system of any prime, it must be a prime less than or equal to 5 (because there are just 5 terms). Modulo 2 the original tuple is (1, 1, 1, 1, 1), no problem there. Modulo 3 this is (2, 1, 2, 1, 2), again no problem. Modulo 5 we have (0, 2, 1, 3, 2), this omits 4, so again no problem. (5, 7, 11, 13, 17) is admissible. The JavaScript example linked below will automate this process for you.
See Also: PrimeKTuplet, PrimeConstellation Related pages (outside of this work)
References:
Chris K. Caldwell © 19992015 (all rights reserved)
