The realization of RSA, contains a large prime number class, very practical.
说明：RSA的实现，内含有一个大素数类，很实用。
Furthermore, machining method of prime number teeth gear beyond 100 is expatiated.
并阐述了大于100的质数齿齿轮的加工方法。
This is the largest prime number that has been discovered (with the aid of a large computer) to date.
这是迄今为止发现的最大素数(借助于一台大型计算机)。
And the generation of big prime number and the googol computation are also solved in this system.
在系统的实现过程中，还主要解决了大素数的生成以及大数运算等问题。
Together they formed the prime number Sujimoto had discovered — a number more than 42 million digits long.
它们一起组成了杉本发现的那个素数——超过4200万位长的一个数字。
The permutation law and decision method of prime number is an important question of the number theory.
素数的排列规律和鉴别方法一直是数论中研究的重要问题之一。
As integers get bigger, prime Numbers become rarer, but there is always a bigger prime number to be found.
整数越大，质数出现的频率会降低，但总是会有一个更大的质数出现。
In the square below, each row, each column and the two diagonals can be read as a five digit prime number.
在下面的方格中，每行，每列，以及两条对角线上的数字可以看作是五位的素数。
The prime number is a natural number that has exactly two different divisors, i. e. 1 is not a prime number.
质数是指仅有两个约数的自然数，例如，1不是一个质数。
If you 're wondering: If a prime number is discovered and no one is there to notice, is it really discovered?
你可能会想：如果一个质数被发现了，但没有被人注意到，那么它是被真正发现了吗？
This paper gives a fast arithmetic for the RSA which includes finding the big prime number and the fast Euclid.
本文给出了实现RSA的快速算法，包括寻找大素数和欧几里德的快速实现。
Professor Sujimoto's fame had increased after he had discovered what was, at the time, the largest prime number ever found.
杉本教授在发现了到那时为止所发现的最大素数之后名望已增大了。
A prime number is an integer greater than or equal to 2 that has exactly two distinct natural number divisors, 1 and itself.
素数是指大于等于2且只有两个不同约数的整数：1和它自己。
So in the case of the primecalc__done probe, the prime number would be arg0 and whether the number is a prime would be arg1.
因此，对于primecalc__done探测，素数是arg0，不确定是否是素数则用arg1表示。
On the other hand, certain kinds of key distributions can cause data to cluster when the array size is not a prime number.
但是，当数组容量不是质数时，这种关键字的分布还是能够导致数据的聚集。
The algorithm of distinguishing prime number is improved on the basis of Eratosthenes' sieve method and Fermat 's minor theorem.
在筛法和费尔马小定理的基础上，利用索阶乘及判别数对如何判别一个整数是否是一个素数的算法加以改进。
The second part is to analyse case students. This part focuses on skills and drills for the chapter of prime number through case study.
第二部分是案例分析，通过案例分析重点探讨了“素数”一章的技能训练。
According to Chen's prime number representation method, this paper improves the method of calculating safety prime number to increase the speed of the RSA.
根据素数的陈氏表示法改进RSA公钥密码体制中的安全素数寻找方法，以提高RSA算法的运行速度。
The number 5, for example, when viewed among the natural, or counting, numbers is one of those elemental creatures: a prime number, divisible only by 1 and itself.
比如数字5，在自然数或计数中，它是一个基本的数字：质数，只能被1或它自身整除。
Generally, this problem is reduced to quadratic residue problem of modulo a big prime number. But this reduction is not applicable to Optimal Extension Fields (OEF).
一般而言，该问题归结为模大素数的二次剩余问题，但这种归结不能用于最优扩域OEF。
The existing prime number labeling method needed a number of primes and some big primes, therefore, an improved prime number labeling method-most brothers prime was proposed.
目前已有的素数编码方法需要大量素数和大素数，为此提出一种改进的素数编码方法——最多亲兄弟素数，该方法不必每个节点都使用新素数。
This script aggregates the timing data from the start probe to the done probe, using a predicate to identify whether the calculation was ultimately for a prime or non-prime number.
这个脚本使用谓词区分最终结果为素数和非素数的计算，把从start探测到done探测的时间数据累加起来。
The paper discusses what the arithmetical compliment of the power denoted by the exponent function (EP 'function) is and a new method of judging prime number with EP 'function.
给出余指函数的定义，应用余指函数得出素数判定的一种新判别方法。
You could also write code that USES a positive integer's factors to determine if it is a prime number (defined as an integer greater than 1 whose only factors are 1 and the number itself).
您还可以编写代码，用一个正整数的因子来确定它是否为素数(定义为大于1的整数，该数字仅有的因子为1和本身)。
A class that implements the org.relaxng.datatype.Datatype interface to represent the prime datatype: This class is responsible for verifying that a given string is, in fact, a prime number.
实现or g . relaxng .datatype . datatype接口的类表示素数数据类型：该类负责检查一个给定的字符串是否为素数。
This paper introduces the process about encryption and decryption of RSA encryption algorithm, and analyzes testing prime number and producing privacy key and security of RSA algorithm.
论述了RSA加密算法的过程，分析了算法中素数测试、密钥产生和现阶段的安全性。
The method can control and manage the dynamic data grid overall situation ground, can trigger the data mining by order, can scoop out data using association rules by prime number saving.
该方法采用数据网格树对动态数据网格进行全局控制和管理，采用挖掘作业命令的形式触发域挖掘作业，采用素数存储的方法进行了关联规则挖掘。
The method can control and manage the dynamic data grid overall situation ground, can trigger the data mining by order, can scoop out data using association rules by prime number saving.
该方法采用数据网格树对动态数据网格进行全局控制和管理，采用挖掘作业命令的形式触发域挖掘作业，采用素数存储的方法进行了关联规则挖掘。
应用推荐