论文部分内容阅读
基于初等数论中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。利用本程序可以快速地找到最接近所预期值的大素数。
Based on some elementary theorems in elementary number theory, this program uses probabilistic algorithms to quickly determine whether a large number is a prime number or not. Use this program to quickly find the largest prime numbers closest to the expected value.