- 积分
- 601
- UID
- 552
- 在线时间
- 小时
- 最后登录
- 1970-1-1
|
45th and 46th Known Mersenne Primes Found!!!!
GIMPS set to claim $100,000 EFF award!
On August 23rd, a UCLA computer discovered the 45th known Mersenne prime, 2^43,112,609-1, a mammoth 12,978,189 digit number ! The prime number qualifies for the Electronic Frontier Foundation's $100,000 award for discovery of the first 10 million digit prime number. Congratulations to Edson Smith, who was responsible for installing and maintaining the GIMPS software on the UCLA Mathematics Department's computers.
On September 6th, the 46th known Mersenne prime, 2^37,156,667-1, a 11,185,272 digit number was found by Hans-Michael Elvenich in Langenfeld near Cologne, Germany! This was the first Mersenne prime to be discovered out of order since Colquitt and Welsh discovered 2110,503-1 in 1988.
The nearly decade long quest for the EFF award came down to a close race to the finish - with just two weeks separating the discovery of the two primes.
As promised, GIMPS will give $50,000 of the EFF award to the UCLA Mathematics Department for discovering the first 10 million digit prime. $25,000 will go to charity, and most of the remainder will go to discoverers of the previous six Mersenne primes.
In recognition of the individual discoverers, the GIMPS project leaders, and every GIMPS participant's contributions, credit for the two primes goes to "Edson Smith, George Woltman, Scott Kurowski, et al", and "Hans-Michael Elvenich, George Woltman, Scott Kurowski, et al".
Edson Smith has worked in the IT industry for 27 years and the last 10 years as the Computing Manager for the UCLA Mathematics Department. Last Fall he replaced the Lab's screen savers with prime95 - a perfect fit for the Mathematics Department. UCLA has a rich history in the discovery of Mersenne primes. Dr. Raphael Robinson found five Mersenne primes at UCLA in 1952 and Alex Hurwitz found two more in 1961.
Hans-Michael Elvenich is a 44 year old Electrical Engineer working for Aliseca, a chemical company. He is a prime number enthusuast and is the owner and operator of www.primzahlen.de. In German, prime numbers are called "primzahlen".
Both primes were first verified by Tom Duell (Burlington, MA, USA) and Rob Giltrap (Wellington, New Zealand), both of Sun Microsystems, using the Mlucas program by Ernst Mayer of Cupertino California USA. The verifications ran on 8 dual-core SPARC64 VI 2.15Ghz CPUs of a Sun SPARC Enterprise M5000 Server and 4 quad-core SPARC64 VII 2.52GHz CPUs of a Sun SPARC Enterprise M8000 Server in Menlo Park, CA, USA. The first prime verification took 13 days, the second prime took 5 days.
Both primes were also independently verified by Tony Reix of Bull S.A. in Grenoble, France using 16 1.6 GHz Itanium2 CPUs of a Bull NovaScale 6160 HPC server and the Glucas program. Jeff Gilchrist of Carleton University in Ottawa, Canada has also verified one prime and is nearly finished with verifying the other using up to 16 1.6 GHz Itanium2 CPUs of a server at SHARCNET, running the Glucas program by Guillermo Ballester Valor of Granada, Spain.
Perfectly Scientific, Dr. Crandall's company which developed the FFT algorithm used by GIMPS, will make posters you can order containing all 12.9 and 11.1 million digits. You'll need a good magnifying glass to read the tiny, tiny print!
You can read a little more in the short press release.
第45和第46个梅森素数被发现！
GIMPS 宣布获得EFF十万美元奖金！
在8月23日，加州大学洛杉矶分校的电脑发现第四十五已知梅森素数， 2^43,112,609-1 ，一个庞大的12,978,189 位数字！这个素数获得资格，由EFF的十万美元奖金发现第一个千万位数的素数。祝贺埃德森史密斯，负责安装和维护该GIMPS软件在加州大学洛杉矶分校数学系的计算机。
在9月6日，第46个梅森素数， 2^37,156,667-1 ， 11,185,272 位数，由Hans-Michael Elvenich发现，在Langenfeld，德国科隆附近！这是自 Colquitt 和Welsh在1988年发现2^110,503-1以来首次梅森素数不按顺序被发现。
近十年的长期追求，夺取EFF奖金的比赛接近了终点——两个素数的发现仅仅相隔两个星期。
作为承诺， GIMPS将给予五万美元的EFF奖金向加州大学洛杉矶分校数学系发现首个千万位素数。二万五千美元会给慈善机构，而其余的大部分将发给前6个梅森素数的发现者。
为酬谢独立发现者、GIMPS项目领导人，和每一个GIMPS参与者的贡献，两个素数认证为“Edson Smith, George Woltman, Scott Kurowski, 等人” ，和 “Hans-Michael Elvenich, George Woltman, Scott Kurowski ，等人“ 。
Edson Smith已在IT产业工作了27年，近10年来作为加州大学洛杉矶分校数学系的计算机管理人员。去年秋天，他取代了实验室的屏幕保护程序，用prime95——完美适合于数学系。加州大学洛杉矶分校在发现梅森素数上有深厚的历史。Raphael Robinson博士在1952年发现了5个梅森素数，Alex Hurwitz，在1961年又发现了两个。
Hans-Michael Elvenich是一名44岁的电气工程师，工作在Aliseca ，一家化学公司。他是一个素数热心者，并且是www.primzahlen.de的所有者和经营者。在德国，素数被称为“ primzahlen ” 。
这两个素数的独立核查由Tom Duell （伯灵顿， MA ，美国）和Rob Giltrap （新西兰惠灵顿） ，两者都为Sun Microsystems ，由在美国加州Cupertino的Ernst Mayer使用Mlucas程序。核查运行在8个双核心的SPARC64 VI 2.15Ghz CPU的一台Sun SPARC M5000 服务器和4个四核心的SPARC64 VII 2.52GHz CPU的一台Sun SPARC Enterprise M8000 服务器在门罗帕克， CA ，美国。第一个素数核查花费了13天，第二个素数花费了5天。
这两个素数也被独立核查于Tony Reix , Bull S.A.在法国的格勒诺布尔，采用16个1.6 GHz的Itanium2 CPU的一台Bull NovaScale 6160 HPC高性能服务器和Glucas 程序。Jeff Gilchrist，卡尔顿大学在渥太华，加拿大也验证了一个素数并且另一个素数也接近完成验证，使用多达16个 1.6 GHz的Itanium2 CPU的一台SHARCNET服务器，运行Glucas 程序由Guillermo Ballester Valor，在Granada，西班牙。
完美的科学，Crandall博士的公司开发了GIMPS所使用的FFT算法，将制作包含所有12.9百万和11.1百万位数字的海报供您订购。您需要一个良好的放大镜阅读极小，极小的打印！
您可以在短期内新闻发布阅读到更多。
[ 本帖最后由 liqi 于 2008-9-16 21:02 编辑 ] |
|
发表于 2008-9-11 22:42:53
发表于 2008-9-11 23:37:25
发表于 2008-9-17 21:15:34
