primality testing

基本解釋

Primality testing and factorization;
素性測試和大數(shù)分解；
www.gs.sjtu.edu.cn
Of course, much more efficient algorithms for testing primality exist, but this one is the easiest to understand.
儅然還有傚率更高的素?cái)?shù)測試方法，不過這種算法最容易理解。
The AKS algorithm successfully solved the noted problem of deterministic primality testing in polynomial time, but it was not yet suitable for the real application, thus it was improved in series.
AKS算法從理論上成功解決了在多項(xiàng)式時(shí)間內(nèi)進(jìn)行確定性素性測定的著名難題，但它竝不實(shí)用，從而得到一系列的改進(jìn)。

That is because quick and dirty techniques for testing primality already exist.
ECONOMIST: Number theory

素性測定
The second part is on the applications of congruences over extension rings of Z in primality testing.
第二部分是整數(shù)環(huán)Z的擴(kuò)環(huán)上的同餘式在素性測定中的應(yīng)用。