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

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

And as you go faster and faster and faster, that factor of delta t prime gets longer and longer and longer, so time is passing more and more slowly.

当你走得越来越快，增量 t 素数的因子变得越来越长，所以时间过得越来越慢。

The idea of subliminal death primes is this.

潜意识死亡素数的想法是这样的。

The ones that are prime must be immune.

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

And the space is the space of prime numbers.

而这个空间是素数的空间。

Twin primes are prime numbers that are separated by just one number, like 11 and 13, or 17 and 19. And as you go up the number line, primes occur less frequently, and twin primes are rarer still.

孪生素数是仅由一个数字分隔的质数，例如 11 13， 或 17 19。 随着数字线的上升，素数出现的频率越来越低， 而孪生素数则更加罕见。

Some of the recent breakthroughs on small gaps between primes, edging towards that ever elusive twin prime conjecture, have their basis in understanding how primes split up among these kinds of residue classes.

最近关于素数之间小间隙的一些突破性进展，逐渐接近那个一直难以捉摸的孪生素数猜想，其基础在于理解素数如何分布在这些余数类中。

Any thoughts on the third part of the market, which is the more peer-to-peer distributed somewhere like crypto-enabled, like hyperbolic prime intellect and all of that.

关于市场的第三部分，即更偏向点对点分布式的领域， 比如启用加密技术的，线素数智能之类的， 您有什么看法吗？

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

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

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

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

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

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

So something like the twin prime conjecture might be unsolvable.

因此，孪生素数猜想这样的问题可能是无法解决的。

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

在一月初，史上最高的素数被公布了。

But what it tells you is it excludes numbers that are not prime.

但它的作用是排除那些不是素数的数字。

It comes from counting how many of the numbers from 1 up to 710 don't share any prime factors with 710. These are the ones that we can't rule out for including primes based on some obvious divisibility consideration.

它来源于计算从1到710中与710没有共同素因子的数有多少个。这些数是我们不能基于一些明显的可除性考虑就排除包含素数的数。

It was made up of a prime.

它是由一个素数组成的。

Try factoring a few and you'll find the pattern— It could be prime— where the product must be of 1 and itself— or it could be the product of 1 and the square of a prime, such as 4.

尝试对一些进行因式分解，您会发现这种模式——它可能是素数——其中乘积必须是 1 它本身——或者它可能是 1 素数平方的乘积，例如 4。

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位数字，所以互联网梅森素数搜索找到的素数实际上太大了，无法用于RSA加密。

And this isn't just antiquated technology either Understanding the distribution of primes in residue classes like this Continues to be relevant in modern research too!

而这不仅仅是过时的技术，理解素数在余数类中的分布，在现代研究中仍然具有相关性！

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

然后 23 这样的素数， 只能分成 2 3， 都是素数。