BigInteger Multitasking Agrawal, Kayal, and Saxena (AKS) Primality Test

The Agrawal, Kayal, and Saxena (AKS) Primality Test is a deterministic and polynomial time algorithm for proving the primality of a large integer. It also can determine if a large integer is composite that is the number is composed of two or more nontrivial factors.

C# (277.4 KB)
 
 
 
 
 
(0)
153 times
Add to favorites
6/19/2016
E-mail Twitter del.icio.us Digg Facebook
Sign in to ask a question


  • why does this not work for smaller primes?
    1 Posts | Last post February 20, 2018
    • App reports 100000000019 = 2^36 + 31280523283 as composite. What gives?