20080331, 19:59  #12 
May 2007
Kansas; USA
10,597 Posts 
On Sierp base 3, I've now reached k=9M and n=25K.
I've now added a new Sierp base 3 reservations page. 28 k's are remaining as shown on the page. I will likely start a big sieve after we reach 100 k's remaining. 
20080401, 16:34  #13 
May 2007
Kansas; USA
10,597 Posts 
On Sierp base 3, I'm now up to k=10M and n=25K. 36 k's remaining as shown on the Sierp base 3 reservations page.
I'm taking a break for ~23 weeks from this base and then will resume testing by kvalue to n=25K until there are 100 k's remaining. That will probably happen between k=15M and 20M. Gary 
20080408, 17:28  #14 
Quasi Admin Thing
May 2005
2^{2}×3^{5} Posts 
Base 3 sierpinski sieve reservation.
Hi Gary. Reserving k 110M120M for base3 sierpinski conjecture. Thanks for your help. When this range is done, I may consider start a riesel conjecture sieveing. Thanks again. Looking forward to submit my few thousands k's :)
EDIT: Whoops forgot to mention that I take it to 25,000 n! Last fiddled with by gd_barnes on 20080414 at 07:06 Reason: Corrected reservation from k=110M1110M to 110M120M 
20080408, 20:56  #15  
May 2007
Kansas; USA
10100101100101_{2} Posts 
Quote:
I'm assuming that you mean k=110M111M (instead of 110M1110M). 110M111M is what your sample script showed in the PM that you sent me. If so, for a k=1M range, there should be less than 2030 k's remaining. Base 3 is a VERY prime base! After you're done, you may find that you want to reserve a larger range. For example, for the range of k=9M10M for me, there were only 8 k's remaining after a search to n=25K. Of course with higher k's, there will be less chance of each kvalue having a small prime so you should have more than that but not many more. Gary 

20080411, 14:04  #16 
Quasi Admin Thing
May 2005
2^{2}·3^{5} Posts 
Hi Gary
I would appreciate if you wrote me down for k=110M to 120M, since I'm working on these 5 ranges. If you would then please tell me if only equal k's has to be tested for the base3 rieselconjecture, then I would like to start a huge attack on this base. Also can I still use the same code in the input file (just changing plus to minus)? But please put me down for the specific k range. Maybe I just rambeled in my reservation. Either way I would like to attack the riesel base3 conjecture when I sometime next week completes this 10M k range :) Thanks for all your understanding and support. Regards KEP Last fiddled with by KEP on 20080411 at 14:30 Reason: To much rambeling and to little fact :) 
20080411, 19:52  #17  
May 2007
Kansas; USA
10597_{10} Posts 
Quote:
OK, I will change your reservation from k=110M111M to 110M120M. I responded to your PM on the Riesel conjecture. The script on the input file would be the same except 1 instead of +1. Like the Sierp conjecture, only even k's need to be tested so no change there. But there is a slight change on the command line. Instead use: input.txt f100 l100k.txt tp The tp switch tells it to prove the primality of "1" numbers vs. "+1" numbers. Good luck and thank you for attacking these huge bases! Gary 

20080411, 20:48  #18 
A Sunny Moo
Aug 2007
USA (GMT5)
3·2,083 Posts 
Actually, no. tp signifies that PFGW should do an N+1 test (as opposed to an N1 test with just plain t), which can be used for numbers that an N1 test can't prove primality for. (I've run into those occasionally.) Both N1 and N+1 tests are not dependent on any form of number, so either should work for both +1 and 1 numbers.

20080411, 21:22  #19  
Jun 2003
5275_{10} Posts 
Quote:
Since N+1 factorization of a "1" number is trivial, it makes sense to use N+1 for "1" (and N1 for "+1" numbers). 

20080411, 21:25  #20  
A Sunny Moo
Aug 2007
USA (GMT5)
3·2,083 Posts 
Quote:


20080412, 07:34  #21  
Sep 2002
Database er0rr
3^{2}·443 Posts 
Quote:
Also: why are you not using a sieve instead of "f"? 

20080412, 09:25  #22  
Quasi Admin Thing
May 2005
2^{2}·3^{5} Posts 
Quote:
"input.txt l5M.txt" and when done sieving I will use this command line: "pfgw.log tp" this will be sufficient and very time consuming, since a lot of tests can very fast be verified up to max n or 25,000 which is my limit :) So thanks Paul, and of course also to you Gary for helping out that much you did. Maybe if we implemented these lines at all tests, we would really start to see some improvement in speed. Anyway I'll now continue the Base3 attack and launch the major attack from Wednesday, maybe earlier, if I see the Sierpinski range complete in early time :) Thanks and take care everyone. KEP! Ps. Gary you doesn't have to reply to my PMs regarding my problem which is now solved, but if you do that prior to reading this post its also OK, since one enjoys reading science stuff and other peoples solutions to issues occorring :) 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 632 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1415  20220125 19:13 
Bases 251500 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  2377  20220125 01:08 
Bases 33100 reservations/statuses/primes  Siemelink  Conjectures 'R Us  1715  20220123 14:23 
Bases 101250 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  967  20220123 14:21 
Riesel base 3 reservations/statuses/primes  KEP  Conjectures 'R Us  1130  20211216 04:43 