This preview shows page 1. Sign up to view the full content.
Unformatted text preview: H n . • It is the other half of Hilbert’s 8th Problem. • Solver will get million dollar prize from Clay Mathematics Institute. Primality Testing • The obvious brute force way to check whether a number n is prime takes √ n divisions. Thus, if n has k digits there will be about 10 k/ 2 divisions. • In 2002, 3 Indian mathematicians discovered the Agrawal-Kayal-Saxena primality test or AKS primality test that requires no more than Ck 12 + ε operations to check for primality....
View Full Document
This note was uploaded on 12/29/2011 for the course MATH 378 taught by Professor Wen during the Fall '10 term at SUNY Stony Brook.
- Fall '10