primality

基本解釋

Primality testing and factorization;
素性測(cè)試和大數(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ù)測(cè)試方法，不過(guò)這種算法最容易理解。
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)行確定性素性測(cè)定的著名難題，但它竝不實(shí)用，從而得到一系列的改進(jìn)。

Instead, mathematicians turn to other, indirect, methods that can test for primality without factorisation.
ECONOMIST: Number theory
However, if Dr Agrawal's primality test can be extended to factoring numbers, it would mean a rejigging of modern cryptography.
ECONOMIST: Number theory
That is because quick and dirty techniques for testing primality already exist.
ECONOMIST: Number theory