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.

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

We might never know whether there are infinite twin primes or not.

我可能永远不知道是否存在无限多孪生质。

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。

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

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

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

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

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 算法使用因式分解， 如果你能将大因式分解为质，你就可以破解这密码系统。