Or another that tweets only prime numbers.

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

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 写成质的乘积。

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

第二辆大巴上的乘客们被安排质，5的幂。

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

这三字均为质，所以将它们相乘就得小公倍：1001。

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

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

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

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

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

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

It shows you understand prime numbers.

它表明你解质。

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

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

The story here braids together prime numbers, complex numbers and pi in a very pleasing trio.

这里的故事将质、复和圆周率编织成非常令人愉快的三重奏。

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不是任何质的幂。

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

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

73 is the 21st prime number.

73是第21质。

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

你可能还记得小学学中的这，但质只能被它自己和 1 整除。

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

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

It'll turn our question into a factoring problem, which is ultimately why patterns among prime numbers come into play.

它将把我们的问题变成因式分解问题，这就是质之间的模式发挥作用的终原因。

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

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

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

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