素数测试问题,



如果把乘、除法（包括取模）看成常数时间，

则算法的时间复杂度为 (k)=  (log m)=O(log n)。

而当n极大时，与n在同一数量级的两个数相乘除，

不超过O(log2n)次二进制位操作。

∴算法的时间复杂性为O(log3n)二进制位操作

-Prime test,

If the multiplication, division ( including the modulus as a constant time ),

The time complexity of the algorithm is ( k ) = ( log m ) = O ( log n ).

And when the N-pole greatly, and N in the same order of magnitude of two numbers multiplication and division,

Not more than O ( log2n ) binary bit operations.

Now the time complexity of the algorithm is O ( log3n ) binary operation