mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
Thread Tools
Old 2015-06-13, 08:03   #353
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

101·103 Posts
Default

19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
gd_barnes is offline   Reply With Quote
Old 2015-06-13, 08:07   #354
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×32×19 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
Good one!
Puzzle-Peter is offline   Reply With Quote
Old 2015-06-13, 08:33   #355
unconnected
 
unconnected's Avatar
 
May 2009
Russia, Moscow

259310 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
Congratulations!
Nice one!
unconnected is online now   Reply With Quote
Old 2015-06-13, 12:42   #356
MyDogBuster
 
MyDogBuster's Avatar
 
May 2008
Wilmington, DE

22·23·31 Posts
Default

Quote:
Originally Posted by gd_barnes
19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
2 hits in 1 at bat. Not bad. We may even solve one of this even-odd thingys someday. Nice

Last fiddled with by MyDogBuster on 2015-06-13 at 12:43
MyDogBuster is offline   Reply With Quote
Old 2015-06-13, 19:33   #357
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

3C616 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
Carefull, the next one might be Mega

Congratulation on a nice find, now there remains exactly 170 k's for SR 2, 4, 8, 16, 32, 64, 128, 256, 512 and 1024 and only 4 more Riesel k primes then a nice round 100 Riesel (base 2 or power of 2) k's remain b<=1024

Last fiddled with by KEP on 2015-06-13 at 19:34
KEP is offline   Reply With Quote
Old 2015-06-15, 20:01   #358
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

11048 Posts
Default Nice success, Gary!

Quote:
Originally Posted by gd_barnes View Post
19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
Many congrats, Gary, for this nice success!

Here is my present status for Sierpinski even n's :

k = 23451 is tested up to n = 3,706,628 base two (1,116,053 decimal digits), no prime, continuing, perhaps still for a long time...
but, as you saw, we may be rewarded for our patience!
Best Regards,
Jean
P.S. The file is now sieved up to 880 T
Jean Penné is offline   Reply With Quote
Old 2015-07-03, 20:19   #359
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3×2,083 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever!
A belated congrats...glad to see another of these knocked out (especially two at once)!

Last fiddled with by mdettweiler on 2015-07-03 at 20:19
mdettweiler is offline   Reply With Quote
Old 2015-08-03, 06:00   #360
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

22×5×29 Posts
Default A Liskovets-Gallot theorem proven!

02/08/2015,
The Liskovets-Gallot conjecture for Proth numbers and even exponents becomes a theorem!
I found :
Starting Proth prime test of 23451*2^3739388+1 (1125673 decimal digits)
Using all-complex AMD K10 FFT length 320K, Pass1=256, Pass2=1280, a = 5
23451*2^3739388+1 is prime! (1125673 decimal digits) Time : 15201.590 sec.
LLR Program - Version 3.8.16, using Gwnum Library Version 28.7
CPU Information:
AMD Phenom(tm) II X4 965 Processor
CPU speed: 3411.23 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 512 KB

03/08/2015,
I verified (with a 32bit machine):
Starting Proth prime test of 23451*2^3739388+1
Using all-complex AMD K8 FFT length 320K, Pass1=256, Pass2=1280, a = 5
23451*2^3739388+1 is prime! (1125673 decimal digits) Time : 63583.482 sec.
CPU Information:
AMD Sempron(tm) Processor 3000+
CPU speed: 1004.70 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 128 KB

This is also my first megaprime, and a nice present for a week after my 80th birthday!
Best Regards,
Jean
Jean Penné is offline   Reply With Quote
Old 2015-08-03, 07:07   #361
unconnected
 
unconnected's Avatar
 
May 2009
Russia, Moscow

50418 Posts
Default

Very nice find, congratulations!

unconnected is online now   Reply With Quote
Old 2015-08-03, 08:07   #362
MyDogBuster
 
MyDogBuster's Avatar
 
May 2008
Wilmington, DE

285210 Posts
Default

WOW. One of those even-odd thingys is solved. Nice Jean Happy-B'day
MyDogBuster is offline   Reply With Quote
Old 2015-08-03, 08:31   #363
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

375510 Posts
Default

Jean, congrats on finding your first mega-prime
paulunderwood is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Bases 501-1030 reservations/statuses/primes KEP Conjectures 'R Us 3913 2021-07-26 09:58
Bases 251-500 reservations/statuses/primes gd_barnes Conjectures 'R Us 2300 2021-07-25 07:38
Bases 6-32 reservations/statuses/primes gd_barnes Conjectures 'R Us 1397 2021-07-25 07:07
Bases 101-250 reservations/statuses/primes gd_barnes Conjectures 'R Us 905 2021-07-18 16:55
Bases 33-100 reservations/statuses/primes Siemelink Conjectures 'R Us 1691 2021-07-06 18:50

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


Tue Jul 27 09:26:04 UTC 2021 up 4 days, 3:55, 0 users, load averages: 1.98, 2.04, 1.84

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.