如何检测一个素 [英] How to detect a prime

问题描述

我知道有许多二进制运算，以显示的东西是真  比如我们可以证明，如果数是两个功率或别的东西是有一些理论或特殊的二进制方式显示，如果数是素？

I know that there are many binary operations to show that something is true for example we can show if number is power of two or something else is there some theory or special binary method to show if number is prime?

推荐答案

检测一个数是否为素数是不是很容易的！

Detecting if a number is prime is not very easy!

阅读这篇文章，了解是素数P中突破： http://www.ams.org/notices/200305/fea-bornemann .PDF 给你这实际上是多么艰难的一个问题是一个想法。

Read this article about the PRIMES is in P breakthrough: http://www.ams.org/notices/200305/fea-bornemann.pdf to give you an idea of how tough a problem this actually is.

这条消息可能是一个更容易阅读： http://members.cox.net/mathmistakes /primes.htm

This news article might be an easier read: http://members.cox.net/mathmistakes/primes.htm

总之，如果你找到一个简单的二元法，你会出名！

In short, if you find a simple 'binary method' you will be famous!

这篇关于如何检测一个素的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！