mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   No Prime Left Behind (https://www.mersenneforum.org/forumdisplay.php?f=82)
-   -   no twin left behind? (https://www.mersenneforum.org/showthread.php?t=13382)

Mini-Geek 2010-05-07 11:58

no twin left behind?
 
I was just thinking about this again:
[URL]http://www.mersenneforum.org/showthread.php?t=12591[/URL] (looking for twin primes by searching the 'other side', i.e. swapping -1 and +1, of a known prime)
But the top 5000 list has so many different prime forms, and is only accessible through text or HTML (both of which would not be terribly easy to extract the essentials from) it'd be non-trivial to get a list of candidates to test. So then I thought of NPLB: tons of primes, all in the form k*2^n-1, all in a central DB that can pick out the k and n for me. Easy!
I'd like to apply this idea to [URL="http://www.noprimeleftbehind.net/stats/index.php?content=prime_list"]the full list of NPLB primes[/URL]. NPLB has found 6604 (as of this writing) primes for -1, and I'd like to find if any of those have a twin on the +1 side. I could try to download all the pages and extract the k and n, but I figured it'd be easier to ask one of you with DB access to dump the list for me. :smile: (consider it requested :smile: preferably in the NewPGen format of one "k n" per line)
6604 candidates of all sizes before any sieving is sure to reduce to a handful of testable candidates. TBH I'm not too hopeful that such a twin does exist, but it'd be such an easy check it's almost a waste to look for new primes to find their twins before checking old primes to see if they have twins.

kar_bon 2010-05-07 13:24

You can also obtain an even greater list from my RieselPrimeDatabase for download [url=http://www.rieselprime.de/Downloads.htm]here[/url]!

I've just updated this list (and the twins-list, too). It's in the npg-format sorted by n-values for all primes in all summary-pages.

science_man_88 2010-05-07 13:55

stupid mouse failure lol (using mousekeys).

(10:46) gp > for(n=1,10,for(k=1,10,if(isprime(k*2^n-1) && isprime(k*2^n+1),print(k"*"2"^"n"+ or -1"))))
2*2^1+ or -1
3*2^1+ or -1
6*2^1+ or -1
9*2^1+ or -1
1*2^2+ or -1
3*2^2+ or -1
9*2^3+ or -1
6*2^5+ or -1
3*2^6+ or -1
9*2^7+ or -1
(10:46) gp >

this what you want ?

kar_bon 2010-05-07 14:54

[QUOTE=science_man_88;214256]this what you want ?[/QUOTE]

No, I think not!

Those small twins are all known (see list at download or the summary-pages).

He was asking of higher n-levels say n~500000 for any prime of the form k*2^n-1.
Test those k/n-pairs if the number k*2^n+1 is prime, too! The Riesel-side (-1) is known to be prime for many values here but none has ever tested the '+1'-side!
OTOH the chance for finding a new twin by testing only these primes is very low.

mdettweiler 2010-05-07 15:12

[quote=Mini-Geek;214240]I was just thinking about this again:
[URL]http://www.mersenneforum.org/showthread.php?t=12591[/URL] (looking for twin primes by searching the 'other side', i.e. swapping -1 and +1, of a known prime)
But the top 5000 list has so many different prime forms, and is only accessible through text or HTML (both of which would not be terribly easy to extract the essentials from) it'd be non-trivial to get a list of candidates to test. So then I thought of NPLB: tons of primes, all in the form k*2^n-1, all in a central DB that can pick out the k and n for me. Easy!
I'd like to apply this idea to [URL="http://www.noprimeleftbehind.net/stats/index.php?content=prime_list"]the full list of NPLB primes[/URL]. NPLB has found 6604 (as of this writing) primes for -1, and I'd like to find if any of those have a twin on the +1 side. I could try to download all the pages and extract the k and n, but I figured it'd be easier to ask one of you with DB access to dump the list for me. :smile: (consider it requested :smile: preferably in the NewPGen format of one "k n" per line)
6604 candidates of all sizes before any sieving is sure to reduce to a handful of testable candidates. TBH I'm not too hopeful that such a twin does exist, but it'd be such an easy check it's almost a waste to look for new primes to find their twins before checking old primes to see if they have twins.[/quote]
If you want I can dump the DB's list for you rather easily, but it sounds like Karsten's list might be even better, since it contains ALL known Riesel primes rather than just NPLB's. If you'd still like to get the DB's list, though, let me know.

science_man_88 2010-05-07 15:34

[QUOTE=kar_bon;214260]No, I think not!

Those small twins are all known (see list at download or the summary-pages).

He was asking of higher n-levels say n~500000 for any prime of the form k*2^n-1.
Test those k/n-pairs if the number k*2^n+1 is prime, too! The Riesel-side (-1) is known to be prime for many values here but none has ever tested the '+1'-side!
OTOH the chance for finding a new twin by testing only these primes is very low.[/QUOTE]

I am annoyed by mousekeys and it may take hours for my pari code to do this if I could use message boxes in win32 assembly good I'd try that.

the hard part is a prime check loop I think if I use Iczelion's win32 ASM tutorials. I did buy a ASM book though but it's for HLA might have to adapt it to win32, or someone else can try this as I suck at it lol.

mdettweiler 2010-05-07 15:47

[quote=science_man_88;214268]I am annoyed by mousekeys and it may take hours for my pari code to do this if I could use message boxes in win32 assembly good I'd try that.[/quote]
If you don't mind my asking, why bother using MouseKeys in the first place (since if it's that annoying, I'm assuming you don't need it for accessibility reasons)? :huh:

science_man_88 2010-05-07 15:50

[QUOTE=mdettweiler;214271]If you don't mind my asking, why bother using MouseKeys in the first place (since if it's that annoying, I'm assuming you don't need it for accessibility reasons)? :huh:[/QUOTE] I'm using mousekeys because my mouse stopped working so outside of speech it's the only way I know to have a way to click thinks.

Mini-Geek 2010-05-07 15:53

[quote=kar_bon;214253]You can also obtain an even greater list from my RieselPrimeDatabase for download [URL="http://www.rieselprime.de/Downloads.htm"]here[/URL]!

I've just updated this list (and the twins-list, too). It's in the npg-format sorted by n-values for all primes in all summary-pages.[/quote]
That should work great, thanks. :smile: I'll see if I can find any twins that aren't already known.
[quote=science_man_88;214256]this what you want ?[/quote]
No, what Karsten said.
[quote=mdettweiler;214261]If you want I can dump the DB's list for you rather easily, but it sounds like Karsten's list might be even better, since it contains ALL known Riesel primes rather than just NPLB's. If you'd still like to get the DB's list, though, let me know.[/quote]
Unless for some reason there're any primes in the DB but not in Karsten's list, no I don't need NPLB's list. Thanks anyway.

Mini-Geek 2010-05-07 17:55

Status update: I'm currently at n=119k. I've found a decent number of twins that aren't in Karsten's list, but the largest is only 42932385 832 ([URL="http://factordb.com/search.php?id=165336191"]42932385*2^832-1[/URL] and [URL="http://factordb.com/search.php?id=165336190"]+1[/URL] for FactorDB entries), which at 259 digits is not even close to making any notable twin prime lists. I'll send the full list of total and new twins when I'm done checking all numbers.

kar_bon 2010-05-07 18:00

[QUOTE=Mini-Geek;214280]I've found a decent number of twins that aren't in your list, but the largest is only 42932385 832 (...) I'll send the full list of total and new twins when I'm done checking all numbers.[/QUOTE]

Good job! So I can eliminate some missings/errors from my database then!


All times are UTC. The time now is 14:39.

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