Or another that tweets only prime numbers.

还有的账号只发和质数有关的消息。

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

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

So I thought I'd start with a love poem about prime numbers.

我觉得可以用一首关于质数的情诗来开场。

Our first step will be to rewrite 36 and 90 as the product of prime numbers.

我们的第一步是把 36 和 90 写成质数的乘积。

Why do we care about searching for prime numbers?

为什么我们关心寻找素数？

It shows you understand prime numbers.

它表明你了解质数。

And to break the encryption, you need to find those prime numbers.

要破解加密， 你需要找到那些质数。

It's more of a fourpart question, really. When he wrote his paper on supersingular prime numbers, how long did it take?

其实这个问题分为四个小题，他撰写超奇异质数的论文时花了多长时间？

There are only two prime numbers that, when multiplied together, give you this long number.

只有两个质数相乘时会得到这个长数。

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

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

You realize that the only lockers touched twice have to be prime numbers since each only has two factors: 1 and itself.

1和它本身。

Luckily, he remembers that around the year 300 B. C. E. , Euclid proved that there is an infinite quantity of prime numbers.

幸运的是，他记得在公元300年前，Euclid证明了质数的一个无穷量。

Well, the slime-lined are in their prime— which is to say they’re prime numbers, divisible only by 1 and themselves.

好吧， 粘液衬里处于质数状态——也就是说它们是质数，只能被 1 和它们自己整除。

Usually, this happens through RSA encryption, which encrypts data using the number you get from multiplying two really big prime numbers.

通常， 这是通过 RSA 加密实现的，RSA 加密使用两个非常大的质数相乘得到的数来加密数据。

It wasn't difficult.You know how when you see prime numbers, they appear red, but when they're twin primes, they're pink and smell like gasoline? No.

其实不难啦，就像质数在你眼里自动就是红色的，孪生质数是粉红色，而且闻起来像汽油，你懂我的意思吗，不懂。

Eratosthenes of Cyrene was a 3rd century BCE mathematician from ancient Greece interested in prime numbers, that is numbers only divisible by 1 and themselves.

Cyrene 的埃拉托色尼 (Eratosthenes of Cyrene) 是公元前 3 世纪来自古希腊的数学家，他对素数很感兴趣，素数只能被 1 和它们本身整除。

The prime numbers that protect your credit card are typically around 300 digits, so the GIMPS number is actually way too big to be useful for RSA encryption.

保护信用卡的质数通常约为 300 位，因此 GIMPS 数实际上太大而无法用于 RSA 加密。

Accepting the 16 gives Fate the 1, 2, 4, and 8. She effectively has the 23, 19, 17, and 13 too, since you can't take prime numbers once 1 is off the board.

接受 16 给 Fate 1、2、4 和 8。 她实际上也有 23、19、17 和 13，因为一旦 1 离开棋盘就不能取素数。

The number was found by the Great Internet Mersenne Prime Search, or GIMPS for short, in which a bunch of networked computers try to come up with prime numbers while they’re not being used for something else.

这个数字是由 Great Internet Mersenne Prime Search（简称 GIMPS）发现的， 其中一堆联网的计算机试图在它们没有被用于其他事情时想出素数。