我需要在非常大的數字之間的間隔上測試素性(在 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.
