Prime integers can be efficiently found using a primality test.

使用素数测试可以有效地找到素数整数。

Of course, much more efficient algorithms for testing primality exist, but this one is the easiest to understand.

当然还有效率更高的素数测试方法，不过这种算法最容易理解。

Based on some basic theorems in theory of Numbers this program takes advantage of probabilistic algorithm to test a large number for primality.

基于初等数论中的一些基本定理，本程序利用概率算法，快速判定一个大数是否为素数。