素性测试的最快算法
我需要在非常大的数字之间的间隔上测试素性(在 long long 范围内)，所以我需要一些快速算法来检查一个数字是否为素数.请提出您的想法.
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.
推荐答案
一个好的方法是 Miller-Rabin 测试.不过需要注意的是，这只是一个概率测试.
One good method is the Miller-Rabin test. It should be noted however, that this is only a probabilistic test.
相关文章