|
第44个梅森素数已经发现了将近一年,我将官方首页上的英文信息翻译了一下.
44th Known Mersenne Prime Found!!
第44个已知的梅森素数被发现!
--------------------------------------------------------------------------------
Lightning strikes twice. On September 4, 2006, in the same room just a few feet away from their last find, Dr. Curtis Cooper and Dr. Steven Boone's CMSU team broke their own world record, discovering the 44th known Mersenne prime, 232,582,657-1. The new prime at 9,808,358 digits is 650,000 digits larger than their previous record prime found last December. However, the new prime falls short of the 10 million digits required for GIMPS to claim the Electronic Frontier Foundation $100,000 award.
闪电般快地再一次发现新的素数。在2006年9月4日，克提司·库帕博士和斯蒂芬·玻恩博士打破了他们自己保持的世界记录，发现了第44个已知的梅森素数，2^32582657-1。这个素数是在他们上一次所发现的素数相同的房间里面不远的一台电脑上发现的，新的素数有9808358位，比他们去年十二月份发现的那个最大素数多65万位。但新的素数仍然小于100万位，所以不满足电子前沿基金组织所提供的10万美元的前提要求。
With five record primes found in less than 3 years, GIMPS has been on an incredible lucky streak. Never before have Mersenne primes been bunched so closely together. When looking at the exponents, we expect only 1.78 Mersenne primes between powers of two, and prior to 2003, a maximum of 3 Mersenne primes were found between powers of two. The last 5 Mersenne prime exponents all fell between 224 and 225 -- and we haven't finished testing all the exponents in that range!
在3年的时间之内连续发现了5个破记录的素数，大因特网梅森素数搜索活动的运气实在是太好了。之前的梅森素数的分布从未像现在这般稠密。在仔细观察了所发现的梅森指数之后，我们发现在2的两个连续幂次之间平均只有1.78个梅森素数的指数，在2003年之前,2的两个连续幂次之间最多有3个梅森素数的指数。最后5个梅森素数的指数均在2^24与2^25之间——并且这一范围内的指数我们还没有全部检测完。
The new prime was independently verified in 6 days by Tony Reix of Bull S.A. in Grenoble, France using 16 Itanium2 1.5 GHz CPUs of a Bull NovaScale 6160 HPC at Bull Grenoble Research Center, running the Glucas program by Guillermo Ballester Valor of Granada, Spain.
新的素数由法国格勒诺布尔市布尔有限公司的托尼·瑞克司使用16台Itanium2 1.5GHz处理器的Bull NovaScale 6160 HPC超级计算机完成。这些超级计算机位于格勒诺布尔市布尔研究中心，所运用的演算程序是西班牙的Guillermo Ballester Valor编写的 Glacus 程序。
Dr. Cooper and Dr. Boone could not have made this discovery alone. In recognition of contributions made by the project coordinators and the tens of thousands GIMPS volunteers, credit for this new discovery goes to "Cooper, Boone, Woltman, Kurowski, et al". The discovery is the tenth record prime for the GIMPS project. Join now and you could find the next record-breaking prime! You could even win some cash.
库提司博士和斯蒂芬博士不可能独立完成这些发现。考虑到项目协调者及成千上万的大因特网梅森素数搜索活动志愿者的贡献，这一发现归公于“库帕，玻恩，沃特曼，库诺文斯机，等等”。这是大因特网梅森素数搜索活动发现的第10个破记录的素数。现在就加入，你也许能成为发现下一个素数的人！你甚至可以获得一些现金。
Perfectly Scientific, Dr. Crandall's company which developed the FFT algorithm used by GIMPS, will make a poster you can order containing the entire 9.8 million digit number. It is kind of pricey because accurately printing an over-sized poster in 1-point font is not easy! This makes a cool present for the serious math nut in your family.
完美科技为你提供了这个新发现的梅森素数全部980位的数字，这个公司由克兰德尔博士创立并且开发了大因特网梅森素数搜索活动所使用的快速傅里叶变换算法。提供全部这些数字是比较费钱的一项行为，因为将这个庞大的数字逐位展现出来并不是一件容易的事。这或许为你当前所从事的严肃数学行为提供了一件好玩的礼物。
For more information on this prime discovery read the full press release.
如果你想获取此项发现的更多信息，可以阅读这项发现的完全发布。
|
