# Prime k-tuple

﻿
Prime k-tuple

In number theory, a prime "k"-tuple is an ordered set of values (i.e. a vector) representing a repeatable pattern of prime numbers. A "k"-tuple is represented as ("a", "b", ...) to represent any set of values ("n" + "a", "n" + "b", ...) for all values of "n". In practice, 0 is usually used for the lowest value of the "k"-tuple. A prime "k"-tuple is one which may be used to represent patterns of prime numbers. [Chris Caldwell, [http://primes.utm.edu/glossary/page.php?sort=ktuple "The Prime Glossary: k-tuple"] at The Prime Pages.]

Several of the shortest "k"-tuples are known by other common names:

 (0, 2) twin primes (0, 4) cousin primes (0, 6) sexy primes (0, 2, 6), (0, 4, 6) prime triplets (0, 6, 12) sexy prime triplets (0, 2, 6, 8) prime quadruplets (0, 6, 12, 18) sexy prime quadruplets (0, 2, 6, 8, 12), (0, 4, 6, 10, 12) quintuplet primes (0, 4, 6, 10, 12, 16) sextuplet primes

A prime "k"-tuple is sometimes referred to as an admissible "k"-tuple. In order for a "k"-tuple to be admissible, it must not include the complete modulo residue (i.e. the values 0 through "p" − 1) of any prime "p" less than or equal to "k". For example, the complete modulo residue of "p" = 3 is 0, 1, and 2, so the numbers in a "k"-tuple modulo 3 would have to include at most two of these values to be admissible; otherwise the resulting numbers would always include a multiple of 3 and therefore could not all be prime unless one of the numbers is 3 itself. Although (0, 2, 4) is not admissible it does produce the single set of primes, (3, 5, 7). Some inadmissible "k"-tuples have more than one all-prime solution. The smallest of these is (0, 2, 8, 14, 26), which has two solutions: (3, 5, 11, 17, 29) and (5, 7, 13, 19, 31).

Prime constellations

A prime "k"-tuple with the smallest possible maximum value "s" is a prime constellation. For all "n" &ge; "k" this will always produce consecutive primes. [MathWorld|urlname=PrimeConstellation|title=Prime Constellation]

The first few prime constellations are:

"k""s"Constellation smallest [Tony Forbes, [http://anthony.d.forbes.googlepages.com/ktmin.txt "Smallest Prime k-tuplets"] .]
22(0, 2)(3, 5)
36(0, 2, 6)
(0, 4, 6)
(5, 7, 11)
(7, 11, 13)
48(0, 2, 6, 8)(5, 7, 11, 13)
512(0, 2, 6, 8, 12)
(0, 4, 6, 10, 12)
(5, 7, 11, 13, 17)
(7, 11, 13, 17, 19)
616(0, 4, 6, 10, 12, 16)(7, 11, 13, 17, 19, 23)
720(0, 2, 6, 8, 12, 18, 20)
(0, 2, 8, 12, 14, 18, 20)
(11, 13, 17, 19, 23, 29, 31)
(5639, 5641, 5647, 5651, 5653, 5657, 5659)
826(0, 2, 6, 8, 12, 18, 20, 26)
(0, 2, 6, 12, 14, 20, 24, 26)
(0, 6, 8, 14, 18, 20, 24, 26)
(11, 13, 17, 19, 23, 29, 31, 37)
(17, 19, 23, 29, 31, 37, 41, 43)
(88793, 88799, 88801, 88807, 88811, 88813, 88817, 88819)
930(0, 2, 6, 8, 12, 18, 20, 26, 30)
(0, 4, 6, 10, 16, 18, 24, 28, 30)
(0, 2, 6, 12, 14, 20, 24, 26, 30)
(0, 4, 10, 12, 18, 22, 24, 28, 30)
(11, 13, 17, 19, 23, 29, 31, 37, 41)
(13, 17, 19, 23, 29, 31, 37, 41, 43)
(17, 19, 23, 29, 31, 37, 41, 43, 47)
(88789, 88793, 88799, 88801, 88807, 88811, 88813, 88817, 88819)

A prime constellation is sometimes referred to as a prime "k"-tuplet, but some authors reserve that term for instances which are not part of longer "k"-tuplets.

The first Hardy-Littlewood conjecture predicts that the asymptotic frequency of any prime constellation can be calculated. While the conjecture is unproven it is considered likely to be true.

Prime arithmetic progressions

A prime "k"-tuple of the form (0, "n", 2"n", ...) is said to be a prime arithmetic progression. In order for such a "k"-tuple to meet the admissibility test, n must be a multiple of the primorial of "k". [MathWorld|urlname=PrimeArithmeticProgression|title=Prime Arithmetic Progression]

References

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

• prime constellation — noun An ordered set of prime numbers having a constant difference between successive elements Syn: prime cluster, prime k tuple, prime k tuplet …   Wiktionary

• Mersenne prime — Named after Marin Mersenne Publication year 1536[1] Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite …   Wikipedia

• Cuban prime — A cuban prime is a prime number that is a solution to one of two different specific equations involving third powers of x and y. The first of these equations is: and the first few cuban primes from this equation are (sequence A002407 in OEIS): 7 …   Wikipedia

• List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

• Primes in arithmetic progression — In number theory, the phrase primes in arithmetic progression refers to at least three prime numbers that are consecutive terms in an arithmetic progression, for example the primes (3, 7, 11) (it does not matter that 5 is also prime). There are… …   Wikipedia

• Dominance order — Example of dominance ordering of partitions of n. Here, n = 6, nodes are partitions of 6, edges indicate that the upper node dominates the lower node. While this particular partial ordering is graded, this is not true for the dominance ordering… …   Wikipedia

• Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… …   Wikipedia

• cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction …   Universalium

• Second Hardy-Littlewood conjecture — In number theory, the second Hardy Littlewood conjecture concerns the number of primes in intervals. If pi;( x ) is the number of primes up to and including x then the conjecture states that: pi;( x + y ) le; pi;( x ) + pi;( y )where x , y ge;… …   Wikipedia