mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > No Prime Left Behind

Reply
 
Thread Tools
Old 2013-09-17, 18:29   #1
CannOfPrimes
 
Sep 2013

1 Posts
Default Binary Palindromic Primes

Can we be certain that all theorized PalPrimes of this nature are actually Prime.

10000.............000001 (uneven number of binary digits)

101
10001
1000001
CannOfPrimes is offline   Reply With Quote
Old 2013-09-17, 18:48   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

23×5×227 Posts
Default

Only Generalized Fermat numbers (in base 10 in this case), can be prime:
10N+1, where N=2n.

And even these are very rarely prime. It is conjectured that there's only a finite number of them.

You can see the start of the series here and here.
Batalov is offline   Reply With Quote
Old 2013-09-18, 11:44   #3
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

100111110000002 Posts
Default

Quote:
Can we be certain that all theorized PalPrimes of this nature are actually Prime.
To clarify further:

At this time, we can be certain that only 2 of them are prime. The only known primes in this series are for n=1 and 2, i.e. 10^1+1 and 10^2+1 or simply 11 and 101. All n's have been tested up to n=2^24-1.

In a synopsis, this means that all 10^n+1 where n<2^24 have effectively been tested for primality, which only required that 24 tests be run, i.e. n=2^0, 2^1, 2^2, 2^3, etc. up to 2^23.

It is unlikely that there are any more primes in this series but there is no way to prove that with current technology and knowledge.

Last fiddled with by gd_barnes on 2013-09-18 at 21:32
gd_barnes is offline   Reply With Quote
Old 2013-09-18, 21:40   #4
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

26×3×53 Posts
Default

Serge,

I have a new long-term project for you. I see that you were the one who proved that 10^(2^23)+1 is composite way back in 2008. How about you test to see if 10^(2^24)+1 is composite? (16777217 digits)


Gary
gd_barnes is offline   Reply With Quote
Old 2013-09-18, 22:25   #5
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

23·5·227 Posts
Default

I actually have, -- as well as all composite cofactors in the same range (for all five bases up to n<=25 iirc). I've done that back in 2008, 2009. (Note that you have to use base other than 3 for GFN'(3,n).)

I have reported them, too. But I guess, W.Keller didn't know me too well back then and wrote back that he will not post them just yet, and will wait for someone else to repeat that.

Of course that was before I found three Fermat factors for him in a row. I think he might have trusted my results better if I submitted PRP test results after that. I am fine with only me knowing the true character of those numbers, though. ;-)
Batalov is offline   Reply With Quote
Old 2013-09-18, 23:39   #6
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

26·3·53 Posts
Default

Quote:
Originally Posted by Batalov View Post
I actually have, -- as well as all composite cofactors in the same range (for all five bases up to n<=25 iirc). I've done that back in 2008, 2009. (Note that you have to use base other than 3 for GFN'(3,n).)

I have reported them, too. But I guess, W.Keller didn't know me too well back then and wrote back that he will not post them just yet, and will wait for someone else to repeat that.

Of course that was before I found three Fermat factors for him in a row. I think he might have trusted my results better if I submitted PRP test results after that. I am fine with only me knowing the true character of those numbers, though. ;-)
Oh wow, that is impressive. Let me see if I understand you correctly: You have tested both 10^(2^24)+1 and 10^(2^25)+1 and have proven that they are composite and you did this in 2008/2009? (!!) The latter one is over 33M digits and must have taken months, especially that long ago.

Assuming so, I can kind of see why he wants a doublecheck but I'm surprised that he doesn't change their "character" to composite (with perhaps a question mark besides it like GIMPS does until all doublechecks below a prime are complete) and show somewhere that a doublecheck is needed.
gd_barnes is offline   Reply With Quote
Old 2013-09-19, 01:49   #7
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

23·5·227 Posts
Default

These are not hard problems. You put
[Worker #1]
PRP=1,10,33554432,1

in worktodo.txt and
ThreadsPerTest=6 (or 8)
in local.txt, and you will be done in no time on a computer with ECC memory.
As you know, people already ran LL tests on 2^383838383-1, so this is tiny compared to that.
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Binary Multitasking a1call Lounge 8 2016-12-03 21:20
Happy Palindromic day! ET_ Lounge 4 2012-02-21 18:20
Would you use a 'fat binary' of GMP-ECM? jasonp GMP-ECM 8 2012-02-12 22:25
2-d binary representation only_human Miscellaneous Math 9 2009-02-23 00:11
Palindromic Primes S80780 Math 5 2003-04-13 23:49

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

Mon Aug 10 12:26:25 UTC 2020 up 24 days, 8:13, 3 users, load averages: 1.50, 1.78, 1.88

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.