Fastest algorithm for primality test

Posted by dada on Stack Overflow See other posts from Stack Overflow or by dada
Published on 2010-04-06T16:43:37Z Indexed on 2010/04/06 16:53 UTC
Read the original article Hit count: 395

Filed under:
|
|
|

I need to test primality on intervals between numbers which are really big (in the range of long long), so i need some fast algorithm for checking if a number is prime or not. Please suggest your ideas.

© Stack Overflow or respective owner

Related posts about c++

Related posts about math