mersenneforum.org Prime Constellations 2
 Register FAQ Search Today's Posts Mark Forums Read

 2015-11-07, 16:37 #1 MattcAnderson     "Matthew Anderson" Dec 2010 Oregon, USA 2·5·59 Posts Prime Constellations 2 Hi Math People Many of you may not know what prime constellations are. They are a subset of the k-tuples. Please see this reference. http://mathworld.wolfram.com/PrimeConstellation.html Also, I have written a webpage regarding Prime Constellations. https://sites.google.com/site/primeconstellations/ Additionally Tony forbes has written a webpage http://primerecords.dk/constellations.htm Hurray for Dana. Dana has written a software that will find prime numbers in prime constellations. He has made a list that is part of the Online Encyclopedia Of Integer Sequences (OEIS). See for example http://oeis.org/A213601 a list of 12-tuplets. The search software has been released. It is just not advertised the right way. Can someone point me to a software that runs on windows64 and can list prime numbers that are in k-tuple patterns? I want to augment the OEIS more. Regards Matt
2015-11-07, 16:40   #2
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

203008 Posts

Quote:
 Originally Posted by MattcAnderson Hi Math People Many of you may not know what prime constellations are. They are a subset of the k-tuples. Please see this reference. http://mathworld.wolfram.com/PrimeConstellation.html Also, I have written a webpage regarding Prime Constellations. https://sites.google.com/site/primeconstellations/ Additionally Tony forbes has written a webpage http://primerecords.dk/constellations.htm Hurray for Dana. Dana has written a software that will find prime numbers in prime constellations. He has made a list that is part of the Online Encyclopedia Of Integer Sequences (OEIS). See for example http://oeis.org/A213601 a list of 12-tuplets. The search software has been released. It is just not advertised the right way. Can someone point me to a software that runs on windows64 and can list prime numbers that are in k-tuple patterns? I want to augment the OEIS more. Regards Matt
if you input the pattern type you want you could make a 64 pari script.

2015-11-07, 17:26   #3
danaj

"Dana Jacobsen"
Feb 2011
Bangkok, TH

2×11×41 Posts

Quote:
 Originally Posted by science_man_88 if you input the pattern type you want you could make a 64 pari script.
This is all definitely possible in Pari/GP, but I don't think you'd use a one-liner such as the simple "isprime(n) && isprime(n+2) && isprime(n+6) && ..." That is quite slow.

Strawberry Perl plus download of latest code with the included cpan command suffices to use my software on Win64, including the threaded example script that will use all your cores. Alternately I could write a 20 line main() that read the parameters and called the function without using Perl -- I would just need something to compile as a static binary.

2015-11-07, 17:35   #4
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by danaj This is all definitely possible in Pari/GP, but I don't think you'd use a one-liner such as the simple "isprime(n) && isprime(n+2) && isprime(n+6) && ..." That is quite slow. Strawberry Perl plus download of latest code with the included cpan command suffices to use my software on Win64, including the threaded example script that will use all your cores. Alternately I could write a 20 line main() that read the parameters and called the function without using Perl -- I would just need something to compile as a static binary.
with parallell computation it can be turned into one in theory 2.7.4, 64 bit has parapply, pareval, parselect, parfor, parforprime, parvector, and parsum, for example, sure the way they are written to make it more efficient and will likely change. for example if enough primes can be generated and stored: parselect(r->r%2310==997,a) where a is the vector that stores the primes could be used to check the condition in the OEIS.

 2015-11-07, 18:01 #5 danaj   "Dana Jacobsen" Feb 2011 Bangkok, TH 2×11×41 Posts Using the 2310*i+997 to select and checking isprime for the constellation comes up at 6778 times slower than my program on a single thread. You need to expand your solution set from just "I can use parfor!". Bigger primorials will help, plus sieving. As for parselect, we don't want to generate all the primes and filter them. We'll be running to 1e23 or so at some point. The set of acceptable residues is much less dense than the primes.
2015-11-07, 18:08   #6
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by danaj Using the 2310*i+997 to select and checking isprime for the constellation comes up at 6778 times slower than my program on a single thread. You need to expand your solution set from just "I can use parfor!". Bigger primorials will help, plus sieving. As for parselect, we don't want to generate all the primes and filter them. We'll be running to 1e23 or so at some point. The set of acceptable residues is much less dense than the primes.
if CRG's assumptions about why my codes run slower with them it's because 1 thread = the same as using the non parallel instructions. looking at this
Quote:
 2.5 Load balancing. If the parallel tasks require varying time to complete, it is preferable to perform the slower ones first, when there are more tasks than available parallel threads. Instead of parvector(36,i,bnfinit(’x^i-2).no) doing parvector(36,i,bnfinit(’x^(37-i)-2).no) will be faster if you have fewer than 36 threads.
could also be at play.

 2015-11-07, 18:36 #7 Batalov     "Serge" Mar 2008 Phi(3,3^1118781+1)/3 3×3,019 Posts There is nothing more dangerous than little knowledge, sm88. A person can juggle jargon without understanding it for all day long (and even create a feeling in bystanders that a meaningful conversation is going on), but you should stop talking for a minute and listen to what DanaJ is saying. He is saying that thinking that simply calling parfor is a meaningless. Saying that "I can use parfor!" is the same as the proverbial example of getting 40 virgins to produce a child in 1 week, or claiming that to build a house in 1 minute you only need 36 thousand hammers and strike them all at once.
 2015-11-07, 21:05 #8 MattcAnderson     "Matthew Anderson" Dec 2010 Oregon, USA 2·5·59 Posts Hi Math People Thank you for your comments. I will repeat my request. I would like an executable program that will be able to find prime constellations. Private message me and I may be willing to pay money $. Regards Matt 2015-11-07, 21:36 #9 Xyzzy "Mike" Aug 2002 11101100001112 Posts Quote:  Originally Posted by MattcAnderson …I may be willing to pay money$.
https://www.bountysource.com/

 2015-11-07, 23:56 #10 MattcAnderson     "Matthew Anderson" Dec 2010 Oregon, USA 2×5×59 Posts https://sites.google.com/site/mattc1...mputer-project BountySource name matt123
2017-03-10, 04:22   #11
MattcAnderson

"Matthew Anderson"
Dec 2010
Oregon, USA

2·5·59 Posts
Matt's take at prime constellations redux

Hi Mersenneforum,

Attached are probably my last efforts on prime constellation mathematics.

Regards,

Matt
Attached Files
 Prime Producing Polynomial 2 26 2017.pdf (217.8 KB, 69 views) an interesting graph 5 (2).pdf (228.3 KB, 66 views)

 Similar Threads Thread Thread Starter Forum Replies Last Post MattcAnderson MattcAnderson 119 2018-03-14 20:22 CRGreathouse Software 10 2017-07-14 09:45 dabaichi News 561 2013-03-29 16:55 emily PrimeNet 3 2013-03-01 05:49 illman-q Miscellaneous Math 33 2004-09-19 05:02

All times are UTC. The time now is 07:26.

Wed Jul 8 07:26:41 UTC 2020 up 105 days, 4:59, 0 users, load averages: 1.59, 1.74, 1.59