Prime Constellations

n-uples of consecutive prime numbers consecutive whose differences are given.

Example

(487, 491, 499, 503) and the differences 4 8 4
(487, 491, 499, 503) is a 4-uple of consecutive primes and the differences are, in order,
491-487 = 4, 499-491 = 8 and 503-499 = 4.
Use star * as joker, to represent any nonnull value.
The search is carried out in the table of the prime numbers from 1 to 500 000

Definitions

In the set of positive integers:
n is prime exactly two dividers (1 and n).
Twin primes have 2 for difference, prime cousins have 4 for difference.

Conjectures

One conjectures that there is an infinity of pairs of prime numbers twins.
The conjecture of Polignac is that for all k>0 fixed, there exists an infinity of pairs of
prime numbers of the form {p, p+2k}.
The conjecture of the constellations is that for any possible form given, there is an infinity
of constellations.
(p, p+2, p+4) is not a possible form, except for (3, 5, 7).
A form is possible when all the numbers of the sequence do not occupy all the classes
of congruence of a prime number.

Incompatibles conjectures:

The conjecture of the constellations and the conjecture of decrease of the densities
are incompatible
(D. Hensley and Ian Richard 1973)
Constellations
(Differences between consecutive primes)
Pattern for a constellation : 



Differences for a progression : 
(The primes are not necessarely consecutives)


While taking as model '2', one obtains the 4565 pairs of twins lower than 500 000.
The pairs of prime cousins are obtained by using the models '4' and '2 2'.
Which are the first sexy ones?
The corresponding sequences of the encyclopaedia of Sloane are A001359, A023200 et A023201.
See also the sequences A029710, A031924 ou A031926

Links

Primes
Prime links, Arithmetic links, Cryptography links, Number theory links"
Enumeration to 1.6*10^15 of the prime quadruplets    Thomas R. Nicely.
Goldbach Variations: Problems with Prime Numbers    Alessandro Zaccagnini.
Prime Constellation (prime patterns)
Hardy-Littlewood Conjectures.
k-Tuple Conjecture (prime patterns conjecture) Eric W. Weisstein MathWorld.
Admissible Prime Constellations   Tomás Oliveira e Silva.
Prime k-tuplets Collections des plus grands exemples connus de k-uples. (par Tony Forbes).
10 consecutive primes in arithmetic progression On March the second 1998 at 11.56 AM, Manfred Toplic.
The Largest Known Primes (A historic Prime Page resource since 1994!)
the Prime pages
A Polynomial-Time Algorithm Primality proving from the Prime pages. (Agrawal-Kayal-Saxena primality-proving theorem).

















Pour un premier contact, [utilisez ce formulaire] ou utilisez l'adresse de messagerie qui y figure. Merci d'indiquer la page précise du site "http//jm.davalan.org/...", cela m'aidera beaucoup. Ne joignez aucun document à votre message.
Jeux-et-Mathématiques n'est pas un site commercial. Aucun des liens placés sur ce site n'est rémunéré, ni non plus aucune des informations données.
Important : Si votre question a un quelconque rapport avec un travail personnel (Devoir TIPE Master...) , vous devez absolument me le préciser dès votre premier message et m'indiquer très précisément les limites des informations demandées. Vous devez aussi avertir la personne qui dirige éventuellement votre travail ou le corrige de cette communication et lui montrer les documents fournis.

J'essaie de répondre aux questions posées, mais ne lis pas les documents mathématiques amateurs, pas plus que je ne donne mon avis sur les démonstrations des conjectures de Collatz ou autres. Je ne lis pas les documents word, je ne corrige pas les programmes informatiques et depuis des années je n'utilise plus de tableur.

© (Copyright) Jean-Paul Davalan 2002-2014