Thread for posting tiny primes - Page 44

3.14159 · 2010-09-12, 18:44

I've been having some really bad luck with the ranges recently..

3.14159 · 2010-09-12, 20:46

Submissions: 3858 * p(30)#¹²⁰ + 1 (5584 digits)

Verification:

Primality testing 3858*p(30)#^120+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 131
Generic modular reduction using generic reduction FFT length 1792 on A 18549-bit number
Calling Brillhart-Lehmer-Selfridge with factored part 34.37%
3858*p(30)#^120+1 is prime! (1.5863s+0.0010s)

3.14159 · 2010-09-12, 23:50

Quote:

Originally Posted by 3.14159

I've been having some really bad luck with the ranges recently..

Bad luck keeps going. I recently had my first no-hit range in a while: k * 2¹⁸⁸⁹⁰ + 1; 60k to 80k.

Maybe I should go back to using unreasonably large ranges again.

3.14159 · 2010-09-12, 23:52

Also; Did anyone happen to find anything top-5000 worthy?

mdettweiler · 2010-09-13, 01:54

Quote:

Originally Posted by 3.14159

Also; Did anyone happen to find anything top-5000 worthy?

Not yet (at least not recently), but the k*211^n-1 search that my last prime came from is in top-5000 territory now. Namely, at n=~83K; I'm going until 100K. Hopefully I'll turn out something before then.

3.14159 · 2010-09-13, 20:35

Quote:

Originally Posted by Max

Not yet (at least not recently), but the k*211^n-1 search that my last prime came from is in top-5000 territory now. Namely, at n=~83K; I'm going until 100K. Hopefully I'll turn out something before then.

Is it part of a conjectured k search?

mdettweiler · 2010-09-13, 20:43

Quote:

Originally Posted by 3.14159

Is it part of a conjectured k search?

Not a conjectured k search per se; the conjectured k's have been known for a long time. It is part of a search to find a prime for each of the k's belowed the conjectured k--in other words, to prove the conjecture for that base. That's what Conjectures 'R Us primarily does (since for its scope, bases <1030 on both +1 and -1 sides, all of the conjectured k's have already been determined).

3.14159 · 2010-09-14, 02:00

Submissions: 698046 * 1999¹⁰⁴⁸⁰ + 1 (34599 digits)

Verification:
Primality testing 698046*1999^10480+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using zero-padded FFT length 20K on 698046*1999^10480+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.98%
698046*1999^10480+1 is prime! (49.1412s+0.0025s)

3.14159 · 2010-09-15, 01:06

Submissions: 147645 * 2⁵⁴⁰⁰⁰ + 1 (16261 digits)

Verification:
Primality testing 147645*2^54000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 13
Special modular reduction using zero-padded FFT length 5K on 147645*2^54000+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.97%
147645*2^54000+1 is prime! (4.8469s+0.0007s)

3.14159 · 2010-09-15, 01:16

I think I'll simply stockpile for top 5k-worthy primes.

The only active test is k * 2⁵⁵²⁶⁰⁰ + 1, which will become non-top 5k material in about 7-15 days; So I'll get rid of that.

3.14159 · 2010-09-17, 23:08

I'm pretty much on a long-stage sieving project; I've sieved up to 6.7 trillion for k * 2⁵⁹⁴⁸⁰⁰ + 1. From 1000000 candidates, I am down to a mere 37700 candidates.

Code:

19:12:07 37700 k's remaining. p=6735609053237 divides k=2189697

2010-09-15, 01:16	#483
3.14159 May 2010 Prime hunting commission. 2⁴×3×5×7 Posts	I think I'll simply stockpile for top 5k-worthy primes. The only active test is k * 2⁵⁵²⁶⁰⁰ + 1, which will become non-top 5k material in about 7-15 days; So I'll get rid of that. Last fiddled with by 3.14159 on 2010-09-15 at 01:35

2010-09-17, 23:08	#484
3.14159 May 2010 Prime hunting commission. 11010010000₂ Posts	I'm pretty much on a long-stage sieving project; I've sieved up to 6.7 trillion for k * 2⁵⁹⁴⁸⁰⁰ + 1. From 1000000 candidates, I am down to a mere 37700 candidates. Code: 19:12:07 37700 k's remaining. p=6735609053237 divides k=2189697 Last fiddled with by 3.14159 on 2010-09-17 at 23:15

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Prime posting thread, part 2. (With a catch.)	3.14159	Miscellaneous Math	55	2010-11-19 23:55
Tiny range request .... 555.1M	petrw1	LMH > 100M	1	2010-07-13 15:35
Other primes thread	nuggetprime	No Prime Left Behind	32	2009-10-21 21:48
Error: tiny factoring failed	10metreh	Msieve	26	2009-03-08 23:28
Tiny error on nfsnet pages.	antiroach	NFSNET Discussion	1	2003-07-08 00:27

2010-09-12, 18:44	#474
3.14159 May 2010 Prime hunting commission. 2⁴×3×5×7 Posts	I've been having some really bad luck with the ranges recently..

2010-09-12, 20:46	#475
3.14159 May 2010 Prime hunting commission. 11010010000₂ Posts	Submissions: 3858 * p(30)#¹²⁰ + 1 (5584 digits) Verification: Primality testing 3858p(30)#^120+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 131 Generic modular reduction using generic reduction FFT length 1792 on A 18549-bit number Calling Brillhart-Lehmer-Selfridge with factored part 34.37% 3858p(30)#^120+1 is prime! (1.5863s+0.0010s)

2010-09-12, 23:52	#477
3.14159 May 2010 Prime hunting commission. 2⁴×3×5×7 Posts	Also; Did anyone happen to find anything top-5000 worthy?

2010-09-14, 02:00	#481
3.14159 May 2010 Prime hunting commission. 2⁴×3×5×7 Posts	Submissions: 698046 * 1999¹⁰⁴⁸⁰ + 1 (34599 digits) Verification: Primality testing 6980461999^10480+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using zero-padded FFT length 20K on 6980461999^10480+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.98% 698046*1999^10480+1 is prime! (49.1412s+0.0025s)

2010-09-15, 01:06	#482
3.14159 May 2010 Prime hunting commission. 2⁴·3·5·7 Posts	Submissions: 147645 * 2⁵⁴⁰⁰⁰ + 1 (16261 digits) Verification: Primality testing 1476452^54000+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 13 Special modular reduction using zero-padded FFT length 5K on 1476452^54000+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.97% 147645*2^54000+1 is prime! (4.8469s+0.0007s)