mersenneforum.org Sierpinski/Riesel Base 5: Post Primes Here
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2005-06-21, 11:06 #67 axn     Jun 2003 112518 Posts 136588*5^22917-1 is prime!
 2005-06-22, 03:43 #68 axn     Jun 2003 17·281 Posts 43156*5^44135-1 is prime!
 2005-06-23, 03:35 #69 axn     Jun 2003 17×281 Posts 294698*5^47110-1 is prime!
 2005-07-18, 16:55 #70 jaat     Jul 2005 2·32 Posts Another one bites the dust Prime 9164*5^40892-1 Is there some other way to check these are primes. As the test has some chance of being wrong.(Am i right?) 8494 and 38348 completed upto 50k without any luck. Btw, Is there some statistics/guesses as to how many will fall till say 50k? I got 2/4. jaat
2005-07-18, 17:54   #71
rogue

"Mark"
Apr 2003
Between here and the

177216 Posts

Quote:
 Originally Posted by jaat Another one bites the dust Prime 9164*5^40892-1 Is there some other way to check these are primes. As the test has some chance of being wrong.(Am i right?)
Yes, you can use WinPFGW to do a primality test with the -tp switch (or -tm for a +1 number). No, unless there is a bug in the software or if there were a hardware problem, the number is prime.

2005-07-19, 09:40   #72
geoff

Mar 2003
New Zealand

13·89 Posts

Quote:
 Originally Posted by jaat Btw, Is there some statistics/guesses as to how many will fall till say 50k? I got 2/4.
From the Sierpinski data so far I would guess that a little more than 1 in 3 candidates will be eliminated by finding a prime with an exponent between 20,000 and 50,000. The 4 candidates you worked on were of average combined weight, so I would say you did just a little better than average to eliminate 2.

(I moved the last two messages from the reservations thread)

 2005-07-19, 20:21 #73 jaat     Jul 2005 2×32 Posts Thanks to both Rogue and geoff for answering the queries. I checked both the numbers with the WinPFGW and they are prime. It is also nice to know that one can knock a very large fraction of them very quickly. I'll get back to them soon. jaat
 2005-08-14, 05:31 #74 geoff     Mar 2003 New Zealand 13×89 Posts I wondered if any of the primes we find could be one of a pair of twin primes of the form k*5^n+/-1. Since in any three consecutive integers one must be divisible by 3, for both k*5^n+1 and k*5^n-1 to be prime, k must be divisible by 3. It turns out that this is possible for just one of the k we are currently testing, the Riesel candidate k=151026. Of the primes already found, the two largest twin primes of this form were 110538*5^139+/-1 and 136674*5^172+/-1.
 2005-09-15, 07:29 #75 OmbooHankvald     May 2005 Copenhagen, Denmark 12116 Posts Hey all. I was wondering: Is this project still "alive"? There is not a lot going on in the forum and only geoff has found primes in the last month, so I started to wonder how many people (or GHz) are working on this problem? I think I'll get back here when I'm finished with my 2721...
 2005-09-17, 15:16 #76 geoff     Mar 2003 New Zealand 13·89 Posts I have a part time 2.66GHz P4 that I split between this project and PSP, it usually does 8-10 hours per week. It is quiet at the moment, but that is OK, there is no rush :-)
 2005-10-11, 07:47 #77 axn     Jun 2003 12A916 Posts 99356*5^34994-1 is prime!

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Citrix Sierpinski/Riesel Base 5 16 2017-02-09 15:55 sweety439 Conjectures 'R Us 32 2016-12-16 22:31 rogue Conjectures 'R Us 11 2007-12-17 05:08 michaf Conjectures 'R Us 2 2007-12-17 05:04 michaf Conjectures 'R Us 49 2007-12-17 05:03

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

Wed Nov 25 07:38:52 UTC 2020 up 76 days, 4:49, 4 users, load averages: 0.87, 1.09, 1.21

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.