On the GRE math section, prime numbers are always going to be positive.

在 GRE 的学部分，总是正的。

Furthermore, the drained parts of the slimed primes are not, themselves, prime.

此外， 粘稠的沥干部分本身并不是。

It doesn't know what a prime number is.

它不知道是什么。

Then primes like 23, which could only be split into 2 and 3, both prime.

然后像 23 这样的， 能分成 2 和 3， 都是。

Next he began to sing the praises of the plain figure system.

接下来，他开始歌颂系统。

It kind of primes, it makes you glowy.

它有点，它让你容光焕发。

This method eliminates all possible composite numbers, leaving only primes behind.

这种法消除了所有可能的合，留下。

In early January, the highest prime number ever found was announced.

1 月初，有史以来发现的最高公布了。

The idea of subliminal death primes is this.

潜意识的想法是这样的。

The ones that are prime must be immune.

那些是的人必须是免疫的。

But the twin prime conjecture is that there are infinitely many twin primes, you never run out.

但是孪生猜想是，孪生有无个，永远用不完。

You can only decrypt RSA security by factoring the product of two prime numbers.

您能通过分解 两个的乘积来解密 RSA 安全性。

Why do we care about searching for prime numbers?

为什么我们关心寻找？

If you do, Fate will get 1, and once again, Fate is guaranteed the high primes.

如果这样做，Fate 将得到 1，Fate 将再次保证获得高。

And the word " prime" (prime) here means the number one or the most likely suspect.

而这里的“”（prime）这个词就是指第一名或者最有可能的嫌疑人。

That specific format -- two to the power of n minus one -- is what’s called a Mersenne prime.

这种特定格式——二的 n 次减一——就是所谓的梅森。

As we process everything sequentially, the execution time of the algorithm scales linearly with the number of pixels we can generate.

当我们一步步处理运算过程时，会发现算法的执行时间与我们可以生成的像之间是呈线性关系的。

Now, no one knows what those statements are exactly, but they could be something like the twin prime conjecture.

现在， 没有人知道这些陈述到底是什么，但它们可能类似于孪生猜想。

We've already identified every prime less than 121, and it's easy to go higher and higher this way.

我们已经识别出每一个小于 121 的，这样越走越高很容易。

Each time it generates a new theorem, it checks if it's the twin prime conjecture.

每次生成一个新定理时，它都会检查它是否是孪生猜想。