liqi、wpolly，如果我开一个Prime95区，你愿意做斑竹吗？负责推广Prime95、Prime95汉化 和 答疑。碧城仙如果有兴趣也可以协助。

[此贴子已经被作者于2004-6-5 20:41:13编辑过]

我数学不好（LL的算法我还不懂，代码看不懂）
其他可以

其实我知道prime95在中国的历史也算比较久了，很多高手都拿它来烤机子的。你好象在这方面比较在行吧？

机子考好了就拿出来做贡献了，尽管是老美的做主
主要还是喜欢梅森素数的：The beautiful rare
简洁的数学！

要是有象SETI@HOME样的中国小组做GIMPS，我一定参加
还有一个理由，出成绩快，我不知道SETI找到外星人没有？：）
最后一个不是理由的理由：有十万美金的奖金！！！

呵呵，不错，言语简洁有效率，英语底子也不错。（beautiful rare什么意思啊？）

我的数学不错， 能理解LL的算法等内容。
在此申请斑竹一职。

P. S. 我在官方论坛有100多帖

People collect rare and beautiful items （人们喜欢美好又罕见的事物）
Mersenne primes, which are usually the largest known primes, are both rare and beautiful. Since Euclid initiated the search for and study of Mersennes approximately 300 BC, very few have been found. Just 41 in all of human history--that is rare!

数学证明的简洁和完美

But they are also beautiful. Mathematics, like all fields of study, has a its own notion of beauty. What qualities are perceived as beautiful in mathematics? Mathematicians look for proofs that are short, concise, clear, and if possible that combine previous disparate concepts or teach you something new. Mersennes have one of the simplest possible forms for primes, 2P-1. The proof of their primality has an elegant simplicity (to a mathematician). Mersennes are beautiful and have some surprising applications.

楼上从primes.utm.edu转的？

很好，我会马上去开 Prime95的新区，希望两位精诚合作，宣传好prime95和分布式计算。

我也来协助。
wpolly，你的GIMPS@China组队如何加入？
equn，综合区还有与此相关的几帖，麻烦转过来！

该版块的介绍有误！麻烦equn修正！
“GIMPS (Prime95)     
搜索最大质数的分布式计算
版主：liqi wpolly”  
“最大质数”应为“最大梅森质数”！

但是其实最大梅森质数一直以来就是最大质数
因为这种样子（2^P-1）最好算

是啊
2^24036583-1 7235733 G7 2004 Mersenne 41?
2^20996011-1 6320430 G6 2003 Mersenne 40?
2^13466917-1 4053946 G5 2001 Mersenne 39?  
2^6972593-1 2098960 G4 1999 Mersenne 38  
5359.2^5054502+1 1521561 SB6 2003  
2^3021377-1 909526 G3 1998 Mersenne 37  
2^2976221-1 895932 G2 1997 Mersenne 36  
1372930^131072+1 804474 g236 2003 Generalized Fermat
1176694^131072+1 795695 g236 2003 Generalized Fermat
572186^131072+1 754652 g0 2004 Generalized Fermat

这是目前所知道的十个最大素数
其中1,2,3,4,6,7位都是Mersenne素数

If you were to find a 10,000,000 digit prime today the above rules imply that $5,000 would go to Michael Cameron, discoverer of the 39th known Mersenne prime, $5,000 would go to Michael Shafer, discoverer of the 40th known Mersenne prime, $5,000 would go to Josh Findley, discoverer of the 41st known Mersenne prime, $0 would go to discoverers of algorithmic breakthroughs, $10,000 would go to GIMPS primarily to fund future awards, $25,000 would go to charity, and $50,000 would go to you.


瞧，这10，000快分配的：5000 给第39个mersenne prime的发现者，5000给第40个mersenne prime的发现者，5000给老41，10000给gimps，25000 给上帝，5000 给你!
我还以为真是10000快呢。

有些遗漏，应该是：

10，000，000位素数被找到后，5000 给第39个mersenne prime的发现者，5000给第40个mersenne prime的发现者，5000给第41个mersenne prime的发现者，10000给gimps建立基金，25000 给慈善机构，50，000 给你!(五万美金--40万人民币)