20111017, 15:03  #1 
Tribal Bullet
Oct 2004
3^{2}·5·79 Posts 
Primality proving of DB factors?
I used factordb for the first time last week (it's awesome, BTW) but I've been asked about whether the factors reported prime in the DB are proved to be so. Does the server use Primo when a new factor is reported, or something?

20111017, 15:16  #2 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
10892_{10} Posts 
I don't use the site. I do know that, users have been taking groups of numbers that were probable primes and using primo and providing certificates. Numbers that are only Probably prime are indicated as such.
http://www.factordb.com/status.html Last fiddled with by Uncwilly on 20111017 at 15:17 
20111017, 15:41  #3 
"Frank <^>"
Dec 2004
CDP Janesville
2×1,061 Posts 
Under 300 digits, primes are proved (I assume) with APRT. At the 300 digit level and above, it uses either PRIMO certs or N1/N+1 (or combined) proofs.

20111017, 18:04  #4 
Oct 2004
Austria
2482_{10} Posts 
The factordb also distinguishes between proven primes and probable primes  if a "prime" is not proven prime, the factordb outputs it as PRP.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Unit Differences for Primality Proving  Trejack  Miscellaneous Math  11  20160512 04:15 
Use Pepin's Tests for proving primality of Mersenne numbers ?  T.Rex  Math  12  20160403 22:27 
Primality proving  CRGreathouse  Software  13  20110130 14:30 
"New primality proving test from Alex Petrov"  ewmayer  Math  11  20070423 19:07 
fastest general number primalityproving algorithm?  ixfd64  Math  3  20031217 17:06 