Other Primes - Page 4

Kosmaj · 2007-11-09, 02:30

Posts about k*10^n-1 moved to another thread.

Please post new messages on this topic there.

gd_barnes · 2007-12-14, 21:18

Hi all...

Come check out the new "Conjectures 'R Us" prime search effort here. There's plenty of bases and k's for everyone to search and have fun.

Gary

Cruelty · 2007-12-26, 19:13

Check this out... if this is part of primegrid, then we will fall to #5 I guess... (in terms of score)

mdettweiler · 2007-12-26, 19:21

Quote:

Originally Posted by Cruelty

Check this out... if this is part of primegrid, then we will fall to #5 I guess... (in terms of score)

I don't see PrimeGrid in the prover code...though I can't imagine why someone would be searching for Woodall primes outside of PrimeGrid (since they would be duplicating a lot of work, especially the sieving work). It's roughly in the range that PrimeGrid is searching, though, so I wouldn't be surprised if it was a PrimeGrid thing, just that the finder forgot to include PrimeGrid in his prover code. (I'm sure if that's the case, though, the Prime Pages people will fix it.)

Kosmaj · 2007-12-26, 21:46

Cruelty

We can sustain this one, still 4th, but not the next larger one.

Cruelty · 2007-12-27, 00:29

Quote:

Originally Posted by Kosmaj

We can sustain this one, still 4th, but not the next larger one.

That is why we are all waiting for your k=7 prime

+ some other megabit primes are long overdue from me

Kosmaj · 2008-01-17, 00:31

Congrats to Richard (L185) on a huge prime
3139*2^3321905-1

only 3 digits shy of one million digits! He found the 9th SoB prime in 2005 (4847*2^3321063+1, 999744 digits) and is currently ranked 14th person by score.

Retep · 2008-02-02, 15:09

Prof. Cooper found another very large prime:
7 * 2^3015762+1 (907836 digits).

By the way, can I somewhere find an overview how fast the different forms of numbers can be tested at the moment (for a example a comparison of the forms k*2^n-1, k*2^n+1, k*b^n+/-1)?

Kosmaj · 2008-02-03, 14:03

Yes, that's his largest prime after two Mersennes.
We are now waiting to see is it a Fermat or a GF divisor, I'm sure he is now working on those tests.

As for the processing speed, when b=2, both -1 and +1 are about the same for the given k. When b>2 it's much slower (except, of course when b is a power of 2).

Cruelty · 2008-03-08, 23:32

4*3^311835-1 (148784 digits)
Attached is a list of primes for k=4 b=3.

Kosmaj · 2008-03-10, 04:55

Cruelty

Congrats on a nice effort and a nice prime!

I remember that prof. Iskra had a special speed-up for
a^2*3^n+1, (n odd)

and found a number of large primes. I just found that his article is now available free of charge! The Corollary 2.3 won't be difficult to implement uisng GMP...

2007-12-14, 21:18	#35
gd_barnes "Gary" May 2007 Overland Park, KS 7²×241 Posts	New Conjectures 'R Us prime search effort Hi all... Come check out the new "Conjectures 'R Us" prime search effort here. There's plenty of bases and k's for everyone to search and have fun. Gary

2007-12-26, 19:13	#36
Cruelty May 2005 2²×11×37 Posts	Check this out... if this is part of primegrid, then we will fall to #5 I guess... (in terms of score) Last fiddled with by Cruelty on 2007-12-26 at 19:14

2008-01-17, 00:31	#40
Kosmaj Nov 2003 7046₈ Posts	Congrats to Richard (L185) on a huge prime 31392^3321905-1 only 3 digits shy of one million digits! He found the 9th SoB prime in 2005 (48472^3321063+1, 999744 digits) and is currently ranked 14th person by score. Last fiddled with by Kosmaj on 2008-01-17 at 00:31

2008-02-02, 15:09	#41
Retep Oct 2007 3²·11 Posts	. Prof. Cooper found another very large prime: 7 * 2^3015762+1 (907836 digits). By the way, can I somewhere find an overview how fast the different forms of numbers can be tested at the moment (for a example a comparison of the forms k2^n-1, k2^n+1, kb^n+/-1)? Last fiddled with by Retep on 2008-02-02 at 15:10*

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Distribution of Mersenne primes before and after couples of primes found	emily	Math	35	2022-12-21 16:32
Mersenne Primes p which are in a set of twin primes is finite?	carpetpool	Miscellaneous Math	4	2022-07-14 02:29
Patterns in primes that are primitive roots / Gaps in full-reptend primes	mart_r	Prime Gap Searches	14	2020-06-30 12:42
Conjecture about Mersenne primes and non-primes v2	Mickey1	Miscellaneous Math	1	2013-05-30 12:32
possible primes (real primes & poss.prime products)	troels munkner	Miscellaneous Math	4	2006-06-02 08:35

2007-11-09, 02:30	#34
Kosmaj Nov 2003 7046₈ Posts	Posts about k*10^n-1 moved to another thread. Please post new messages on this topic there.

2007-12-26, 21:46	#38
Kosmaj Nov 2003 7046₈ Posts	Cruelty We can sustain this one, still 4th, but not the next larger one.

2008-02-03, 14:03	#42
Kosmaj Nov 2003 2·1,811 Posts	Yes, that's his largest prime after two Mersennes. We are now waiting to see is it a Fermat or a GF divisor, I'm sure he is now working on those tests. As for the processing speed, when b=2, both -1 and +1 are about the same for the given k. When b>2 it's much slower (except, of course when b is a power of 2).

2008-03-10, 04:55	#44
Kosmaj Nov 2003 2×1,811 Posts	Cruelty Congrats on a nice effort and a nice prime! I remember that prof. Iskra had a special speed-up for a^2*3^n+1, (n odd) and found a number of large primes. I just found that his article is now available free of charge! The Corollary 2.3 won't be difficult to implement uisng GMP...