Or another that tweets only prime numbers.

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

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

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

The passengers on the second bus are assigned powers of the next prime, 5.

第二辆大巴上的乘客们被安排到了下一个质数，5的幂。

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

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

Those three numbers are all prime, so multiplying them together will give us their least common multiple: 1001.

这三个数字均质数，所以将它们相乘就得到了最小公倍数：1001。

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

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

It shows you understand prime numbers.

它表明你了质数。

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

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

No, let's pick a prime number higher than 10.

不， 让我们选择一个大于 10 的质数。

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

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

73 is the 21st prime number.

73是第21个质数。

First of all, the one digit primes: 2, 3, 5, and 7.

首先，一位数质数：2、3、5 和 7。

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

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

And nobody knows a really good way of factoring large numbers in primes on a digital computer.

没有人知道在数字计算机上将大数分质数的真正好方法。

Although, there will be many rooms that go unfilled, like room 6, since 6 is not a power of any prime number.

尽管，还有许多房间是空的，像是6号房，因6不是任何质数的幂。

You might remember this from elementary school math, but a prime number is only divisible by itself and 1.

你可能还记得小学数学中的这个，但质数只能被它自己和 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证明了质数的一个无穷量。

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.

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

The RSA algorithm uses factoring, and if you could factor large numbers into primes, you could break this crypto system.

RSA 算法使用因式分， 如果你能将大数因式分质数，你就可以这个密码系统。

Presumably he grew bored of manually checking whether a given number was prime, so he came up with the following technique.

据推测， 他厌倦了手动检查给定数字是否质数，因此他想出了以下技术。