您的位置: 站长主页 -> 繁星客栈 -> 望月殿 -> Euclid’s proof of infinitely many prime | November 22, 2024 |
Euclid’s proof of infinitely many prime
论坛嘉宾: 萍踪浪迹 gauge 季候风 |
Tim 发表文章数: 6
|
Euclid's proof of infinitely many primes [文章类型: 原创]
Euclid's proof of infinitely many primes
欧几里德对素数的无穷性的证明 How many primes are there? A lot.In fact,infintely many.Euclid proved this long ago in his Theorem 9:20,as follows.Suppose there were only finitely many primes,say k of them - 2,3,5,...,Pk.Then,we should consider the number M = 2*3*5*...*Pk + 1. None of the k primes can divide M,because each divides M-1.Thus there must be some other prime that divides M(because any positive integer n can be written as a product of primes);perhaps M itself is prime.This contradicts out assumption that 2,3,...,Pk are the only primes,so there must indeed be infinitely many primes. -摘自<<Concrete mathematics>>p107-108 素数是无穷多的,这个论断,现在所已知的最古老的检验方法是Euclid在他的几何原本中提出来的。 他的证明方法可以简单的总结如下: 假设素数是有限多的,依次为2,3,5,...Pk,找一个数M,令M = 2*3*5*...*Pk + 1; 因为M不可能被所有已存在的素数整除,无论除哪个素数都将余1。由于对所有正整 数来说,都可以写成一系列素数的乘积,所以必然存在某个不是已知的素数可以整 除M。要么就是这个数本身,也就是M,M也为素数,要么存在不在这个有限集合内 的素数。因此我们开始用的集合不包含所有的素数。论题得证。 I miss you like crazy even more then words can say.
|
||
silent 发表文章数: 62
|
Re: Euclid's proof of infinitely many primes [文章类型: 原创]
素数的无穷性证明除了欧几里德的这个还有数不清的方法,光是初等数论书上面文章、习题中介绍过的就有十几种。
但都是用反证法推出矛盾,貌似没有直接证明的。 世界就是这样结束的,不是伴着一声巨响,而是伴着一声呜咽。
|
||
Tim 发表文章数: 6
|
Re: Euclid's proof of infinitely many primes [文章类型: 混合]
直接证明应该不能应用于素数的无穷性的.
Like perpedicular lines don't have a common direction,perpendicular numbers don't have common factors.
|
||
那一剑的寂寞 发表文章数: 193
|
Re: Euclid's proof of infinitely many primes [文章类型: 原创]
“直接证明应该不能应用于素数的无穷性的.
” +++++++++++++++++++++++++++ 有直接证明吧,只要用一下数论中的Euler公式不就行了吗? 天下风云出我辈,一入江湖岁月催;
|
||
Tim 发表文章数: 6
|
Re: Euclid's proof of infinitely many primes [文章类型: 原创]
请那一剑的寂寞兄用Euler公式证明一下,恕在下无知,还从没见过这样的证明呢!
Like perpedicular lines don't have a common direction,perpendicular numbers don't have common factors.
|
||
kanex 发表文章数: 447
|
Re: Euclid's proof of infinitely many primes [文章类型: 原创]
用zeta function配合harmonic analysis来证比较好,可以有更强的结论
Récoltes et semailles
|
||
Tim 发表文章数: 6
|
Re: Euclid's proof of infinitely many primes [文章类型: 原创]
各位,别光说不练啊,最好能证明一下嘛!
Like perpedicular lines don't have a common direction,perpendicular numbers don't have common factors.
|
||
卢昌海 发表文章数: 768
|
Re: Euclid's proof of infinitely many primes [文章类型: 原创]
:: 直接证明应该不能应用于素数的无穷性的.
:: 恕在下无知,还从没见过这样的证明呢! 可以参看我的“Riemann 猜想漫谈 (二)”。另外,用Bertrand 假设(其实是定理,参阅我的短文)也是一种直接证明。类似的证明多得很。 宠辱不惊,看庭前花开花落
|
||
Tim 发表文章数: 6
|
Re: Euclid’s proof of infinitely many prime [文章类型: 原创]
谢谢站长提示
正在看您的"黎曼猜想二"... Like perpedicular lines don't have a common direction,perpendicular numbers don't have common factors.
|
您尚未登陆 | 用户登陆 |