欧拉素数_为什么欧拉素数配方会破坏世界

欧拉素数

Prime numbers form the foundation of modern encryption. The reason for this is very simple: until now we have not understood their mathematical nature. However, the world would change dramatically by demystifying primes. In this article, I present a little known but awesome property about primes that may change your mind about cryptography. And don’t worry, it will be a short and easy understandable read on an executive level.

质数构成现代加密的基础。 原因很简单：到目前为止，我们还不了解它们的数学性质。 但是，通过解开素数，世界将发生巨大变化。 在本文中，我介绍了一些关于素数的鲜为人知但令人敬畏的特性，它可能会改变您对密码学的看法。 不用担心，这在高管层上将是简短易懂的内容。

刷新和动力 (Refresh and Motivation)

Let‘s recap: primes are whole numbers that can only be divided by 1 or the number itself without remainder. For example, 5 is prime (divisors 1 and 5) but 6 is not (divisors 1, 2, 3 and 6).

我们来回顾一下：质数是整数，只能被1除或数字本身无余数。 例如，5是质数(除数1和5)，但6不是(质数1，2、3和6)。

There are infinite prime numbers but so far there are no efficient algorithms to determine them. Especially, there is no formula to calculate the n-th prime number, neither recursively, i.e. we can calculate a prime if we know the preceding (smaller) primes, nor explicitly, i.e. we can calculate a prime directly without knowing preceding primes.

有无限质数，但到目前为止，尚无有效的算法来确定它们。 特别是，没有公式可以递归地计算第n个素数，也就是说，如果我们知道前面的(较小的)素数，就可以计算素数，也没有明确的公式，即我们可以不知道前面的素数而直接计算素数。

For example, this makes the famous RSA cryptosystem so secure. Its public key needed for encryption is based on a product of two (very large) prime numbers. If you want to derive the private key needed for decryption you “just” need to determine the prime factors of this product. However, this takes currently so much computing time that RSA is not unlockable in practice.

例如，这使得著名的RSA密码系统如此安全。 加密所需的公钥基于两个(很大)质数的乘积。 如果要导出解密所需的私钥，则“只是”需要确定该产品的主要因素。 但是，这目前需要花费大量的计算时间，因此RSA在实践中无法解锁。

But what would happen if we would discover a formula that calculates primes immediately? This could also generate very fast approaches for prime factorization which would mean a death sentence for most cryptosystems today. But is it even possible to find a formula for primes?

但是，如果我们发现立即计算素数的公式，将会发生什么？ 这也可能产生非常快速的素数分解方法，这对于当今大多数密码系统而言将意味着死刑。 但是，甚至有可能找到素数的公式吗？

惊人的欧拉产品 (The Amazing Euler Product)

Leonhard Euler is one of the most brilliant mathematicians the world has ever seen. In the 18th century he derived a formula that is called Euler product today. Here we focus on a special case of his trailblazing discovery. Please don’t stop reading even if the next line looks like hieroglyphic at first sight.

Leonhard Euler是世界上最杰出的数学家之一。 在18世纪，他得出了一种如今被称为欧拉积的公式。 在这里，我们重点介绍他开拓性发现的特殊情况。 即使下一行乍一看像象形文字，也请不要停止阅读。

Euler product

欧拉产品

We translate: the symbol on the left hand side of the equation represents a product. Furthermore, it is an infinite product over all primes, i.e. we need to replace the variable p by all prime numbers and multiply the terms. Let’s write it down to make it clear.

我们进行翻译：等式左侧的符号代表乘积。 此外，它是所有质数的无限乘积，即我们需要用所有质数替换变量p并乘以项。 让我们写下来清楚。

First factors of the Euler product

欧拉产品的首要因素

This means the following: if we calculate the above product inserting ALL prime numbers we obtain the well-defined result pi²/6. That’s awesome and feels like a mystery. Please let me tell you why.

这意味着：如果我们计算以上乘积所有质数的乘积，我们将得到明确定义的结果pi²/ 6。 太棒了，感觉像是个谜。 请让我告诉你为什么。

破坏性后果 (Disruptive Consequences)

We know that there are infinite prime numbers but we haven’t any closed and efficient representation (“formula”) for primes. With computing power, we can just determine the largest known prime number. In spite of this, Euler has proven that we obtain the value pi²/6 if we multiply all primes according to the Euler product — although we don’t know all primes!

我们知道有无限的素数，但是我们没有素数的任何封闭且有效的表示形式(“公式”)。 有了计算能力，我们就可以确定最大的已知质数 。 尽管如此，欧拉已经证明，如果我们根据欧拉乘积将所有素数相乘，我们将获得pi²/ 6值-尽管我们并不知道所有素数！

IMHO, this shows that there is tremendous knowledge about primes that we haven’t discovered so far. If we can calculate the Euler product over the infinite set of primes we should also be able to derive a formula for primes. For example, for special primes closed representations are already known.

恕我直言，这表明到目前为止我们还没有发现关于质数的大量知识。 如果我们可以在无穷多个素数上计算出欧拉积，那么我们也应该能够导出素数的公式。 例如，对于特殊质数，闭合表示是已知的。

This indicates that we must increase efforts in number theoretical research to discover the true nature of primes. And the person who may unriddle this quest will either be celebrated or persecuted.

这表明我们必须加大数字理论研究的力度，以发现素数的真实性质。 可能会迷惑于此任务的人将受到庆祝或迫害。

奥托罗 (Outro)

I ask myself if such a nerdy topic will attract readers. I am a fan of number theory, however, it’s not my daily business so I do appreciate your comments. Please let me know if you like to learn more about this stuff or mathematics beyond, maybe I am going to write a follow-up.

我问自己这样一个书呆子的话题是否会吸引读者。 我是数论爱好者，但是，这不是我的日常工作，因此，我非常感谢您的评论。 如果您想进一步了解这些东西或数学，请告诉我，也许我会写一篇后续文章。

翻译自: https://towardsdatascience.com/why-eulers-formula-for-primes-could-disrupt-the-world-edc41bd3ba5b

欧拉素数