![]() |
|
|
#1 |
|
Nov 2004
Florianopolis - Brazil
3×5 Posts |
Does any DC project use the AKS Primality Test for determining if a number is prime or not?
|
|
|
|
|
|
#2 | |
|
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
101010000111002 Posts |
Quote:
Paul |
|
|
|
|
|
|
#3 |
|
Aug 2002
1010000002 Posts |
It runs in Polynomial time. That doesn't mean it's particularily fast.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Modifying the Lucas Lehmer Primality Test into a fast test of nothing | Trilo | Miscellaneous Math | 25 | 2018-03-11 23:20 |
| New Mersenne primality test | Prime95 | Miscellaneous Math | 19 | 2014-08-23 04:18 |
| there is another way to test the primality of a no | shawn | Miscellaneous Math | 5 | 2007-07-17 17:55 |
| N-1 primality test | Citrix | Math | 3 | 2005-09-19 15:06 |
| A primality test for Fermat numbers faster than Pรฉpin's test ? | T.Rex | Math | 0 | 2004-10-26 21:37 |