![]() |
![]() |
#1 |
Tribal Bullet
Oct 2004
32·5·79 Posts |
![]()
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?
|
![]() |
![]() |
![]() |
#2 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
1089210 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 2011-10-17 at 15:17 |
![]() |
![]() |
![]() |
#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 N-1/N+1 (or combined) proofs.
|
![]() |
![]() |
![]() |
#4 |
Oct 2004
Austria
248210 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 | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Unit Differences for Primality Proving | Trejack | Miscellaneous Math | 11 | 2016-05-12 04:15 |
Use Pepin's Tests for proving primality of Mersenne numbers ? | T.Rex | Math | 12 | 2016-04-03 22:27 |
Primality proving | CRGreathouse | Software | 13 | 2011-01-30 14:30 |
"New primality proving test from Alex Petrov" | ewmayer | Math | 11 | 2007-04-23 19:07 |
fastest general number primality-proving algorithm? | ixfd64 | Math | 3 | 2003-12-17 17:06 |