sets of 3 primes
 

Hi all,

See this webpage regarding sets of 3 primes.

[URL="https://sites.google.com/site/3tuples/"]here[/URL]

All primes greater than 2 are odd. Similarly all primes greater than 3 are not divisible by 3.

For what it's worth.

Matt

[QUOTE=MattcAnderson;470012]Hi all,

See this webpage regarding sets of 3 primes.

[URL="https://sites.google.com/site/3tuples/"]here[/URL]

All primes greater than 2 are odd. Similarly all primes greater than 3 are not divisible by 3.

For what it's worth.

Matt[/QUOTE]

seems to be missing the word consecutive see: [url]http://mathworld.wolfram.com/PrimeConstellation.html[/url]

MathWorld is, not surprisingly, not quite right. They mean to say consecutive primes, as "consecutive numbers" is obviously wrong.

The OEIS Wiki has a better page than Mathworld:

[url]https://oeis.org/wiki/Prime_constellations[/url]

It separates the idea of a cluster from a constellation. Matt's page starts by talking about the standard triplets but then notes we can also find 3-clusters. These are not consecutive primes.

[code]# replace ... by your list of a,b,... for p,p+a,p+b,...
# perl -Mntheory=:all -E 'say for sieve_prime_cluster(<from>,<to>, ...);
# e.g. one of Matt's clusters:'
perl -Mntheory=:all -E 'say for sieve_prime_cluster(0,1000,102,246);'

# or this random meaningless one:
perl -Mntheory=:all -E 'say for sieve_prime_cluster(0,1e6, 102,246,384,512,770,896);'[/code]

The isprime methods are easy to program in a lot of languages (trivial in Pari/GP for instance). The method in the Perl module finds admissable residues, sieves them, then does final primality tests on the remainders. It's fairly fast for large clusters. It is certainly not unique or the first to do it.

Hi all,

Thanks for the good post Dana. I appreciate it.

Regards,
Matt