mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > MattcAnderson

Reply
 
Thread Tools
Old 2017-10-15, 21:39   #23
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

7×89 Posts
Default

Hi Internet,

Today I made some more examples about k-tuples.
You can see my Google Sites webpage.

https://sites.google.com/site/3tuples/

I am open to feedback.

Regards,
Matt
MattcAnderson is offline   Reply With Quote
Old 2017-10-18, 03:43   #24
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

7·89 Posts
Default

Hi Internet,

Here is a Maple page for a prime cluster.

Regards,
Matt
Attached Files
File Type: pdf 3 prime procedure.pdf (208.4 KB, 169 views)
MattcAnderson is offline   Reply With Quote
Old 2018-07-30, 19:00   #25
danaj
 
"Dana Jacobsen"
Feb 2011
Bangkok, TH

2×3×151 Posts
Default

Two Algorithms to Find Primes in Patterns

It isn't clear how efficient their code is for tuplets compared to mine. They ran with 150 cores and parallelize in the inner loop. I ran with 4 cores and parallelize at the outermost level for braindead simplicity (e.g. the sieve is serial but I run N ranges at a time). Extrapolating the time on my 4-thread Macbook to range and cores comes out to nearly the same time as they report, but that's a lot of extrapolation.

Their wheel is significantly larger than mine. I restrict mine based on space and to some extent speed (larger is not always faster, but it really depends on many factors including the depth and speed of primality testing, where I suspect my testing is faster than theirs).

My code just does clusters of {p,p+A,p+B,p+C,...} for any user entered A,B,C,.... Theirs also does things like {p,Ap+A',Bp+B',...} so they can look for Cunningham chains.
danaj is offline   Reply With Quote
Old 2018-07-31, 23:11   #26
bhelmes
 
bhelmes's Avatar
 
Mar 2016

28710 Posts
Default

Quote:
Originally Posted by MattcAnderson View Post
Attached are probably my last efforts on prime constellation mathematics.

Please try to do a little bit more math,


the polynomial f(n)=n²+n+41 has the discriminant b²-4ac=-163 if you consider f(n)=an²+bn+c,
therefore you could also use the polynomial f(n)=n²+163 with the same discriminant
all primes with p|f(n) "appear" double periodically and can be sieved out by division.


If you are looking for some other quadratic polynomial my website may help you, especially http://devalco.de/poly_sec.php and

for the special polynomial f(n)=n²+163

http://devalco.de/basic_polynomials/...?a=1&b=0&c=163


I hope you will find some new ideas.


Greetings from the quadratic polynomials
Bernhard
bhelmes is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! dabaichi News 571 2020-10-26 11:02
Prime Constellations MattcAnderson MattcAnderson 119 2018-03-14 20:22
Prime constellations? CRGreathouse Software 10 2017-07-14 09:45
disk died, prime work lost forever? where to put prime? on SSD or HDD? emily PrimeNet 3 2013-03-01 05:49
The 40th known Mersenne prime, 220996011-1 is not PRIME! illman-q Miscellaneous Math 33 2004-09-19 05:02

All times are UTC. The time now is 12:10.

Mon Nov 30 12:10:45 UTC 2020 up 81 days, 9:21, 4 users, load averages: 1.79, 1.52, 1.54

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.