Fastest primality test

Posted by Grigory Javadyan on Stack Overflow See other posts from Stack Overflow or by Grigory Javadyan
Published on 2010-12-20T20:30:52Z Indexed on 2010/12/21 12:54 UTC
Read the original article Hit count: 314

Filed under:
|
|
|

Hi.

Could you suggest a fast, deterministic method that is usable in practice, for testing if a large number is prime or not?

Also, I would like to know how to use non-deterministic primality tests correctly. For example, if I'm using such a method, I can be sure that a number is not prime if the output is "no", but what about the other case, when the output is "probably"? Do I have to test for primality manually in this case?

Thanks in advance.

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about math