Listing 5 shows the refactored prime-number tester.
清单5展示了重构的质数检验器。
Listing 10 shows the refactored prime-number tester.
清单10显示了重构的质数检验器。
Once I have extracted this class, I can refactor both the functional classifier and prime-number tester to use it.
一旦提取了该类之后，我就能通过同时重构函数分类器和质数检验器来使用它。
Finds a new method of channel multiplexing, which is named as prime-number division multiple, and uses its principles on telecommunication system.
提出一种新的信道复用技术——素数复用技术，并建立了以素数复用原理为基础的通信系统。
Once I've isolated and removed the duplicated code, both the number classifier and the prime-number tester are much simpler. Listing 4 shows the refactored number classifier.
当我隔离和移除重复代码后，数字分类器和质数检验器就变得更简单了。
The specific example that I employ verifies that a number is prime.
我使用的具体例子是检查一个数是否为素数。
Finding two prime factors of a very large number is a difficult task for most computers.
对于大多数计算机来说找到一个非常大的数字的两个素因子是一件是难的事。
A Rhino function: is this number prime?
Rhino函数：这个数字是素数吗？
If this number is ever zero, the number is not prime.
如果余数不为零，则该数不是素数。
This is the largest prime number that has been discovered (with the aid of a large computer) to date.
这是迄今为止发现的最大素数(借助于一台大型计算机)。
Professor Sujimoto's fame had increased after he had discovered what was, at the time, the largest prime number ever found.
杉本教授在发现了到那时为止所发现的最大素数之后名望已增大了。
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 prime number is an integer greater than or equal to 2 that has exactly two distinct natural number divisors, 1 and itself.
素数是指大于等于2且只有两个不同约数的整数：1和它自己。
质数是什么？
Together they formed the prime number Sujimoto had discovered — a number more than 42 million digits long.
它们一起组成了杉本发现的那个素数——超过4200万位长的一个数字。
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探测的时间数据累加起来。
A Simple Example: a Web-Based Prime Number generator.
一个简单的示例：基于Web的质数生成器。
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接口的类表示素数数据类型：该类负责检查一个给定的字符串是否为素数。
Maximum number of connections allowed. (Use a big prime number.)
允许最大的连接数。(使用较大的数。)
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表示。
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或它自身整除。
On the other hand, certain kinds of key distributions can cause data to cluster when the array size is not a prime number.
但是，当数组容量不是质数时，这种关键字的分布还是能够导致数据的聚集。
As integers get bigger, prime Numbers become rarer, but there is always a bigger prime number to be found.
整数越大，质数出现的频率会降低，但总是会有一个更大的质数出现。
Which number on the card is a prime number?
在卡片上哪一个数字是最初的数字？
If you 're wondering: If a prime number is discovered and no one is there to notice, is it really discovered?
你可能会想：如果一个质数被发现了，但没有被人注意到，那么它是被真正发现了吗？
The permutation law and decision method of prime number is an important question of the number theory.
素数的排列规律和鉴别方法一直是数论中研究的重要问题之一。
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.
目前已有的素数编码方法需要大量素数和大素数，为此提出一种改进的素数编码方法——最多亲兄弟素数，该方法不必每个节点都使用新素数。
To see why, imagine a situation where the table size is not a prime number.
为了考察为什么会有这个限制，假设表的容量不是质数。
To see why, imagine a situation where the table size is not a prime number.
为了考察为什么会有这个限制，假设表的容量不是质数。
应用推荐