mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Miscellaneous Math (https://www.mersenneforum.org/forumdisplay.php?f=56)
-   -   Thread for posting tiny primes (https://www.mersenneforum.org/showthread.php?t=13650)

3.14159 2010-10-10 01:18

Lucky result; 8000 to 180000 on k * 396^3300 + 1.

I got a PRP on the second result;

[code]8006*396^3300+1 is composite: RES64: [5348C5C59D9EB175] (2.1188s+0.0002s)
8010*396^3300+1 is 3-PRP! (2.0658s+0.0003s)[/code]

Verification:

8010*396^3300 + 1 may be prime. (a = 2)
8010*396^3300 + 1 is prime! (a = 7) [8577 digits]

Items 2 and 20.

3.14159 2010-10-10 04:52

Submissions: 62453*396^6820+1 (17722 digits)

Verification:

Primality testing 62453*396^6820+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 31
Special modular reduction using zero-padded FFT length 8K on 62453*396^6820+1
Calling Brillhart-Lehmer-Selfridge with factored part 40.08%
62453*396^6820+1 is prime! (8.7051s+0.0147s)

3.14159 2010-10-10 12:10

Submissions: 171703*396^13900+1 (36114 digits)

Verification:

Primality testing 171703*396^13900+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 13
Special modular reduction using zero-padded FFT length 20K on 171703*396^13900+1
Calling Brillhart-Lehmer-Selfridge with factored part 40.08%
171703*396^13900+1 is prime! (50.5900s+0.0022s)

3.14159 2010-10-10 19:01

Submissions: 76935*396^3420+1 (8890 digits)

Verification:

Primality testing 76935*396^3420+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 7
Special modular reduction using zero-padded FFT length 4K on 76935*396^3420+1
Calling Brillhart-Lehmer-Selfridge with factored part 40.07%
76935*396^3420+1 is prime! (2.0378s+0.0008s)

3.14159 2010-10-10 20:14

95608*157^5820+1 (12786 digits)

Verification:

Primality testing 95608*157^5820+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using zero-padded FFT length 6K on 95608*157^5820+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.96%
95608*157^5820+1 is prime! (4.8558s+0.0015s)

CRGreathouse 2010-10-10 22:44

What's with all the small primes?

3.14159 2010-10-11 00:05

What small primes?

:lol:! Top-5k elitists..

Hey, look; Post #(37^2).

Batalov 2010-10-15 06:20

A sudoku ersatz:

Try to retrace my steps and prove that (10[SUP]12891[/SUP]+11)/3 is a prime. (the PRP is due to Lelio R Paula [Oct 2008])

lorgix 2010-10-16 11:02

Nothing big...

Just trying to get in the game.

(112393574355618506681^56-2)/7

1122digits

Input by me, identified as PRP by Syd's factordb, currently running Alpern's app (Rabin PRP atm base>1201 atm).

Mini-Geek 2010-10-16 11:51

[QUOTE=lorgix;233530]Input by me, identified as PRP by Syd's factordb, currently running Alpern's app (Rabin PRP atm base>1201 atm).[/QUOTE]

Please read [url]http://www.mersenneforum.org/showthread.php?p=230908#post230908[/url] and the posts around it. That Rabin PRP test that Alpertron's app does doesn't really prove the number prime (when the app decides to use APRT-CLE to prove it, then that really is proving it). It does prove that it's PRP to so many bases that the chance of it really being composite is EXTREMELY low, but it doesn't prove that it's prime with 100% certainty. How extremely low? [URL="http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Accuracy_of_the_test"]Wikipedia[/URL] cites "significantly smaller than 4[sup]-k[/sup]" where k is the number of bases that say it's PRP. In this case, significantly smaller than 4[sup]-1864[/sup]. For comparison, 4[sup]1864[/sup] is the same bit length as your PRP.
For a 100% certain proof, run Primo.

lorgix 2010-10-16 12:24

[QUOTE=Mini-Geek;233531]Please read [URL]http://www.mersenneforum.org/showthread.php?p=230908#post230908[/URL] and the posts around it. That Rabin PRP test that Alpertron's app does doesn't really prove the number prime (when the app decides to use APRT-CLE to prove it, then that really is proving it). It does prove that it's PRP to so many bases that the chance of it really being composite is EXTREMELY low, but it doesn't prove that it's prime with 100% certainty. How extremely low? [URL="http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Accuracy_of_the_test"]Wikipedia[/URL] cites "significantly smaller than 4[sup]-k[/sup]" where k is the number of bases that say it's PRP. In this case, significantly smaller than 4[sup]-1864[/sup]. For comparison, 4[sup]1864[/sup] is the same bit length as your PRP.
For a 100% certain proof, run Primo.[/QUOTE]

Thanks for the feedback. I'm sort of low on software since I don't know enough programming yet, but Primo has a handy GUI so I'm running it now.

I stopped Rabin after base 10091.

(Planning on learning a programming language, but I don't know which, and where to start. Most of my computing power go into finding factors in GIMPS, but with some programming skills I would branch out.)


All times are UTC. The time now is 22:03.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.