·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
Prime integers can be efficiently found using a primality test.
使用素数测试可以有效地找到素数整数。
youdao
Based on some basic theorems in theory of Numbers this program takes advantage of probabilistic algorithm to test a large number for primality.
基于初等数论中的一些基本定理,本程序利用概率算法,快速判定一个大数是否为素数。
However, if Dr Agrawal's primality test can be extended to factoring numbers, it would mean a rejigging of modern cryptography.
ECONOMIST: Number theory
Instead, mathematicians turn to other, indirect, methods that can test for primality without factorisation.
应用推荐
模块上移
模块下移
不移动