mersenneforum.org Thread for posting tiny primes
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2013-09-21, 18:43 #925 3.14159     May 2010 Prime hunting commission. 24·3·5·7 Posts Bumping: 209610*5325760+1 (44423 digits) Primality testing 209610*53^25760+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Special modular reduction using zero-padded AMD K10 type-1 FFT length 20K, Pass1=80, Pass2=256 on 209610*53^25760+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.99% 209610*53^25760+1 is prime! (117.0467s+0.0208s)
 2013-09-23, 03:10 #926 3.14159     May 2010 Prime hunting commission. 32208 Posts More primes: 80256*630766+1 (23946 digits) Primality testing 80256*6^30766+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 80256*6^30766+1 Running N-1 test using base 23 Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 80256*6^30766+1 Running N-1 test using base 29 Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 80256*6^30766+1 Calling Brillhart-Lehmer-Selfridge with factored part 61.30% 80256*6^30766+1 is prime! (52.2363s+0.0048s) 28301*228657+1 (8632 digits) Primality testing 28301*2^28657+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 28301*2^28657+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.95% 28301*2^28657+1 is prime! (1.3308s+0.0056s) Part of a range for k * 3^14500 + 1: Code: Primality testing 30146*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Special modular reduction using all-complex FFT length 2K on 30146*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 30146*3^14500+1 is prime! (1.0725s+0.0044s) Primality testing 30922*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Special modular reduction using all-complex FFT length 2K on 30922*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 30922*3^14500+1 is prime! (1.0759s+0.0055s) Primality testing 33768*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 11 Special modular reduction using all-complex FFT length 1536 on 33768*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.95% 33768*3^14500+1 is prime! (0.8555s+0.0045s) Primality testing 41736*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Special modular reduction using all-complex FFT length 2K on 41736*3^14500+1 Running N-1 test using base 13 Special modular reduction using all-complex FFT length 2K on 41736*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.94% 41736*3^14500+1 is prime! (2.0989s+0.0052s) Primality testing 41878*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 41878*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 41878*3^14500+1 is prime! (1.0593s+0.0051s) Primality testing 55492*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Special modular reduction using all-complex FFT length 2K on 55492*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 55492*3^14500+1 is prime! (1.0714s+0.0083s) Primality testing 64892*3^14500+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Special modular reduction using all-complex FFT length 2K on 64892*3^14500+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 64892*3^14500+1 is prime! (1.0628s+0.0083s)
 2013-09-23, 12:11 #927 3.14159     May 2010 Prime hunting commission. 24×3×5×7 Posts moar: 93283*295606+1 (28786 digits) Primality testing 93283*2^95606+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 93283*2^95606+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.98% 93283*2^95606+1 is prime! (49.2659s+0.0040s) edit: range for k * 2^23380 + 1 Code: Primality testing 75555*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 11 Special modular reduction using all-complex FFT length 2K on 75555*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 75555*2^23380+1 is prime! (0.8516s+0.0037s) Primality testing 78073*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 78073*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 78073*2^23380+1 is prime! (0.8585s+0.0032s) Primality testing 94893*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 7 Special modular reduction using all-complex FFT length 2K on 94893*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 94893*2^23380+1 is prime! (0.8495s+0.0037s) Primality testing 112525*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 112525*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 112525*2^23380+1 is prime! (0.8538s+0.0034s) Primality testing 122065*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 122065*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 122065*2^23380+1 is prime! (0.8529s+0.0037s) Primality testing 122851*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 122851*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 122851*2^23380+1 is prime! (0.8502s+0.0034s) Primality testing 128305*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 128305*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 128305*2^23380+1 is prime! (0.8536s+0.0034s) Primality testing 141817*2^23380+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Special modular reduction using all-complex FFT length 2K on 141817*2^23380+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 141817*2^23380+1 is prime! (0.8488s+0.0035s) Last fiddled with by 3.14159 on 2013-09-23 at 12:46
 2013-09-23, 15:17 #928 3.14159     May 2010 Prime hunting commission. 168010 Posts moar stuff: 319629*280790+1 (24326 digits) Primality testing 319629*2^80790+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Special modular reduction using all-complex AMD K10 type-1 FFT length 8K, Pass1=32, Pass2=256 on 319629*2^80790+1 Calling Brillhart-Lehmer-Selfridge with factored part 99.98% 319629*2^80790+1 is prime! (15.6100s+0.0039s) Last fiddled with by 3.14159 on 2013-09-23 at 15:18
 2013-09-23, 16:20 #929 3.14159     May 2010 Prime hunting commission. 24×3×5×7 Posts About the thread's name change, I'd post something top5000 worthy, but I'd need to get back to you in roughly 6 ~ 10 years. Last fiddled with by 3.14159 on 2013-09-23 at 16:23
2013-09-23, 16:31   #930
paulunderwood

Sep 2002
Database er0rr

2×33×67 Posts

Quote:
 Originally Posted by 3.14159 If you're willing to post some, post away. Please refrain from posting the decimal expansion of the number you're submitting, and please ensure the following: 1. Has no factors below 230 2. Passes a pseudoprimality test (Recommendation: 1-3 bases) 3. Is not a "small" prime. (Please ensure it is ≥ 1000 digits.)
Can we go back to these rules? I have ~261,601,878 titanic prps I could prove and post here not decimally expanded.

Last fiddled with by paulunderwood on 2013-09-23 at 16:33

 2013-09-23, 18:26 #931 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 41×229 Posts There is a certain demand for small and even very small (but not totally random) primes in the Conjectures 'R Us and No Prime Left Behind subforums (and others). For example: here, or here, or here. M.Kamada is also interested in small primes and PRPs: one can take any series (here for example) and extend it. In contrast, if one wants to do numbers that are not of interest to anyone else, then the only way to get people excited is to get the reasonably big (to enter top-5000 or, a bit easier target, the PRP Lifchitz site). There needs to be a system that these numbers support ...or else of course one can simply start an endless Pari/GP loop Code: p=10^1567; while(1,p=nextprime(p+1);print(p)) and get a cookie every time it will print something.
 2013-09-24, 00:06 #932 3.14159     May 2010 Prime hunting commission. 24×3×5×7 Posts Bumping with this: 5397*10!^1250+1 is 3-PRP! (15.6527s+0.0013s) (8204 digits) Last fiddled with by 3.14159 on 2013-09-24 at 00:14
 2013-09-24, 16:54 #933 3.14159     May 2010 Prime hunting commission. 168010 Posts Anyone want to prove this one for me? 14^5650 + 189373 is PRP, 6476 digits. Last fiddled with by 3.14159 on 2013-09-24 at 16:54
 2013-09-24, 17:37 #934 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 41·229 Posts I will gladly prove yours, after you will prove mine: 14^9217-189373 It's a deal of your lifetime, don't miss it! (Took me a whole of five minutes to find it, too. It must be very valuable!)
2013-09-24, 19:42   #935
3.14159

May 2010
Prime hunting commission.

24·3·5·7 Posts

Quote:
 Originally Posted by Batalov I will gladly prove yours, after you will prove mine: 14^9217-189373 It's a deal of your lifetime, don't miss it! (Took me a whole of five minutes to find it, too. It must be very valuable!)
would do, but not havings of ecpp.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post 3.14159 Miscellaneous Math 55 2010-11-19 23:55 petrw1 LMH > 100M 1 2010-07-13 15:35 nuggetprime No Prime Left Behind 32 2009-10-21 21:48 10metreh Msieve 26 2009-03-08 23:28 antiroach NFSNET Discussion 1 2003-07-08 00:27

All times are UTC. The time now is 04:25.

Sat Apr 17 04:25:17 UTC 2021 up 8 days, 23:06, 0 users, load averages: 1.28, 1.43, 1.86

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.