
Glossary: Prime Pages: Top 5000: 
GIMPS has discovered a new largest known prime number: 2^{82589933}1 (24,862,048 digits) Prime constellations of length k are the shortest admissible ktuples of primes. That is, a ktuple is admissible unless there is a prime q < k, which always divides the product of the terms. Below we illustrate this tricky definition with a couple examples. Suppose we want to find prime constellations of length two. The pattern (p, p+1) is not admissible, because either p or p+1 would be even, so one of these would have to be the prime 2. The pattern (p, p+2) is admissible (both p and p+2 can be odd), so prime constellations of length two fit the pattern (p, p+2). Examples: (3,5), (5,7), (11,13), (17,19), and (29,31). Of course, we call primes that fit this pattern twin primes. Now let us find a prime constellation of length three. The primes in our pattern must differ by at least two (so we are not forcing one of them to be two). So we might try (p, p+2, p+4). But one of these three must be divisible by 3, so this also is not admissible. Finally, we consider
Prime constellations of length four (prime qradruples) must fit the single pattern (p, p+2, p+6, p+8). (Examples: (5,7,11,13), (11,13,17,19)). If the length is five or six we have the patterns: (p, p+2, p+6, p+8, p+12), (p, p+4, p+6, p+10, p+12), and (p, p+4, p+6, p+10, p+12, p+16). It is conjectured that there are infinitely many of each admissible prime constellation (see the prime ktuple conjecture). The first link below contains more information, including lists of admissible patterns of larger lengths, as well as the largest known prime constellations of lengths 2, 3, 4, ..., 17.
See Also: PrimeKTuplet Related pages (outside of this work)
References:
Chris K. Caldwell © 19992019 (all rights reserved)
