质数是什么？
Which number on the card is a prime number?
在卡片上哪一个数字是最初的数字？
A Simple Example: a Web-Based Prime Number generator.
一个简单的示例：基于Web的质数生成器。
Maximum number of connections allowed. (Use a big prime number.)
允许最大的连接数。(使用较大的数。)
To see why, imagine a situation where the table size is not a prime number.
为了考察为什么会有这个限制，假设表的容量不是质数。
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表示。
I in this principle, in a fortuitous thinking, I whim, can use other symbols instead of odd number and odd prime number?
我本着这样的思想原则，在一次偶然思考中，我偶然想到，能不能利用其它符号代替奇合数和奇素数呢？
On the other hand, certain kinds of key distributions can cause data to cluster when the array size is not a prime number.
但是，当数组容量不是质数时，这种关键字的分布还是能够导致数据的聚集。
111 can be obtained from its largest prime number factor, 37, like so: First, subtract 37 from its reverse (73) and you get 36.
111可以从它的最大素数因子37来获得，就像这样：先把37的颠倒数73减去37，就会得到36。
The algorithm of distinguishing prime number is improved on the basis of Eratosthenes' sieve method and Fermat 's minor theorem.
在筛法和费尔马小定理的基础上，利用索阶乘及判别数对如何判别一个整数是否是一个素数的算法加以改进。
The private key and public key are the function of a pair of big prime number (decimal number between 100 and 200 bit or larger).
其公开密钥和私人密钥是一对大素数（100到200个十进制数或更大）的函数。
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或它自身整除。
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或它自身整除。
应用推荐