What is a PRP ?
A PRP is a probable prime number, a number that nobody knows how to prove
or disprove its primality.
Here are some criterions that can be used to recognize these numbers
:
- N does not have any prime factor up to 2^32.
- N cannot be trivially written into a product.
- Take 3 square-free consecutive bases such that (b1/N)=(b2/N)=(b3/N)= -1. N
should be such that b1^((N-1)/2)=b2^((N-1)/2)=b3^((N-1)/2)= -1 (mod N).
- Take a prime base such that (b/N)= -1 and b<>b1<>b2<>b3.
N should pass the strong test in base b.
- or more (if someone has got an idea) !!!
Submit your PRPs
See the Top discoverers
See the Latest PRPs
Search by form
|
Fatal error: Uncaught TypeError: Unsupported operand types: string - int in /var/www/html/prptop/prptop.php:82
Stack trace:
#0 {main}
thrown in /var/www/html/prptop/prptop.php on line 82