Prime integers can be efficiently found using a primality test.
使用素数测试可以有效地找到素数整数。
Based on some basic theorems in theory of Numbers this program takes advantage of probabilistic algorithm to test a large number for primality.
基于初等数论中的一些基本定理，本程序利用概率算法，快速判定一个大数是否为素数。
Based on some basic theorems in theory of Numbers this program takes advantage of probabilistic algorithm to test a large number for primality.
基于初等数论中的一些基本定理，本程序利用概率算法，快速判定一个大数是否为素数。
应用推荐