质数是什么？
Which number on the card is a prime number?
在卡片上哪一个数字是最初的数字？
To see why, imagine a situation where the table size is not a 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?
你可能会想：如果一个质数被发现了，但没有被人注意到，那么它是被真正发现了吗？
On the other hand, certain kinds of key distributions can cause data to cluster when the array size is not a prime number.
但是，当数组容量不是质数时，这种关键字的分布还是能够导致数据的聚集。
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和它自己。
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或它自身整除。
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接口的类表示素数数据类型：该类负责检查一个给定的字符串是否为素数。
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函数：这个数字是素数吗？
The minimum number of words in a data element name is two (prime word + class word), and the maximum number of words is nine.
数据元素名称中最小的单词数量是2个(基本单词+类单词)，最大单词数量是9个。
Each data element name shall contain a sufficient number of modifiers and qualifiers to fully describe it (up to four modifiers per prime word and one modifier plus two qualifiers per class word).
每个数据元素名称应该包含数量足够的修饰词和限定词，以便充分描述它(每个基本单词最多有四个修饰词，每个类单词最多有一个修饰词和两个限定词)。
They advocated a secret ballot of their number to resolve it: "Strong supporters of the prime minister should have no difficulty in backing this approach," they innocently wrote.
他们提出，应当举行一次秘密投票，解决该问题，在信中，他们天真烂漫地写道：“首相的强力支持者要支持此举亦无任何问题。”
For example, figure 7 shows the number of mail messages delivered locally on this DPAR by mail size over a several-week period for prime shift.
例如，图7显示了在主要班次的几周期间内按邮件大小在本地通过该DPAR发送的邮件消息数。
This is the largest prime number that has been discovered (with the aid of a large computer) to date.
这是迄今为止发现的最大素数(借助于一台大型计算机)。
The prime-brokerage arms of investment banks also face a number of potential conflicts of interest.
许多投行的机构经纪人同样面临着一系列潜在利润冲突。
What is the fastest algorithm for checking if a 14 digit number is prime?
检查如果一个14位数的号码是最好最快的方法是什么？
Her testimony directly contradicts a number of statements made to the inquiry in January by Tony Blair, prime minister at the time of the Iraq invasion.
伊利莎的证词与托尼·布莱尔在1月调查会上的诸多陈述截然相悖，后者在伊战期间担任英国首相。
Together they formed the prime number Sujimoto had discovered — a number more than 42 million digits long.
它们一起组成了杉本发现的那个素数——超过4200万位长的一个数字。
A Simple Example: a Web-Based Prime Number generator.
一个简单的示例：基于Web的质数生成器。
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探测的时间数据累加起来。
page you’ll see a number of different parameters for determining how to generate prime numbers.
在primes.jsp页面中，你会看到很多用于质数生成的不同参数。
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表示。
Maximum number of connections allowed. (Use a big prime number.)
允许最大的连接数。(使用较大的数。)
Maximum number of connections allowed. (Use a big prime number.)
允许最大的连接数。(使用较大的数。)
应用推荐