|
发表于 2005-10-5 08:45:51
|
显示全部楼层
Find Minimal Equal Sums of Like Powers using Euler2000, available on the download page. The client automatically downloads ranges of numbers to work on.
On February 6, 2003, a project member discovered the largest (6,2,5) result above 60,000.
用Euler2000寻找等幂和数,程序可以从下载页面获得。客户端将自动下载一系列数据进行运算。2003年2月6日,一位项目成员在60000以上发现了(6,2,5)的最大结果。
On December 8, 2002, a project member found a new upper limit for Taxicab(6): Taxicab(6) <= 24153319581254312065344, since 24153319581254312065344 = 289062063 + 5821623 = 288948033 + 30641733 = 286574873 + 85192813 = 270932083 + 162180683 = 265904523 + 174924963 = 262243663 + 182899223. The Taxicab problem isn't a part of the Minimal Equal Sums of Like Powers project, but this is a big discovery nonetheless.
2002年12月8日,一位项目成员发现了Taxicab(6)的一个新上限。Taxicab(6) <= 24153319581254312065344, 又24153319581254312065344 = 289062063 + 5821623 = 288948033 + 30641733 = 286574873 + 85192813 = 270932083 + 162180683 = 265904523 + 174924963 = 262243663 + 182899223。出租车问题虽然不是等幂和数项目的一部分,但其仍是一个大发现。
Version 4.21b of the client is available as of September 30, 2002. This version handles reserved work ranges better, points to the new eulernet.org domain automatically, and on the server side, allows for simultaneous client connections. Note: you should upgrade from version 4.18 and earlier to fix a significant client bug in those versions. Note: 4.21b has a bug which prevents the client from connecting to the server if you try to reserve more than the maximum 100 ranges. Use temporary version 4.21c to fix the bug.
2002年9月30日,提供客户端版本为4.21b。该版本更好的解决了保存工作序列的问题,并自动指向新域名eulernet.org。在服务器端允许客户端同时连接。
Note: the project server's old ISP and domain (euler.myip.org) are unreachable as of October 15, 2002. Please use the domain eulernet.org.
Join a discussion forum about the project. ]
注:4.21b版存在一个bug——在尝试保存多于最大100列数据的时候将禁止客户端向服务器发起连接。请使用4.21c暂行版修补这个bug。注:至2002年10月15日,项目的旧ISP及域名euler.myip.org都将无法访问。请使用新域名eulernet.org。
加入项目的论坛。
Search for factors of 2^(2^61-1)-1, a double Mersenne number, in the MM61 project. Download and test the client, then email the project coordinator to reserve a range of numbers to test.
在MM61项目中寻找二重梅森数MM61=2^(2^61-1)-1的因子。下载并测试客户端,向项目协调器发送email以保存一系列数字进行测试。
Find 3x+1 class records in the 3x+1 Problem project. This project attempts to find ever higher 3x+1 class records. The client, which will work on any PC/Windows platform, and the instructions for joining the project, are here. Note: the client takes about 6 weeks to finish one block on a 400-MHz CPU.
在3x+1项目中寻找3x+1class records。该项目试图寻找到更高的3x+1class records。客户端能在任何PC/Windows平台上工作。加入项目请看这里。注:400MHz的CPU运行客户端完成一个块(block)约需6周。
The project completed its first goal, processing 20,000 blocks, on November 19, 2002. The project found a new glide record in December, 2002. This is the first glide record found in almost a year. The record occurs at 180352,746940,718527, and the new glide is 1575, an improvement of 104 over the previous record. The project found a new Path record in March, 2003. The previous Path record was found in late 2002. The record occurs at 212581,558780,141311, (or +/- 189.250) and it reaches a maximum of 4353,436332,008631,522202,821543,171376.
See the project's progress.
2002年11月19日,项目完成了第一个目标——20000块的计算。在2002年12月项目又发现了一个新的Glide record。这是近一年来所找到的首个正整数。它出现于180352,746940,718527的计算中。新的正整数为1575,较之以前的数提高了104。2003年3月又找到了新的Path record。前一个数是2002年末找到的。新的Path record出现于212581,558780,141311, (或 +/- 189.250),并且达到了4353,436332,008631,522202,821543,171376计算中的最大值。
查看项目的进度。
Help the Distributed Search for Fermat Number Divisors project find unique Fermat Number factors.
This site is also available in Italian , Russian , and German .
Version 4.1 of the client is available as of September 7, 2001.
协助Fermat(费马)因子网络搜寻计划寻找特别的费马数因子。
网站同时提供意大利语、俄语和德语访问。
The project has found the following factors recently:
项目现已找到下列因子
因子 发现者 日期
89.2472,099 + 1 因子 F472,097
(这是已知第三大的费马因子) Payam Samidoost 2004年10月5日
211.2287,388 + 1因子F287,384 Jim Fougeron 2004年12月13日
5731.260,084 + 1因子 F60,079 Michael Eaton 2005年2月14日
11.2960,901 + 1因子F960,897 Michael Eaton 2005年2月23日
1595863660157.287 + 1因子F83 Vasily Danilov 2005年5月12日
2018719057.21162 + 1因子F1160 Maximilian Pacher 2005年5月15日
Join the project discussion forum or an independent discussion forum about Fermat numbers.
加入项目论坛或关于费马数的独立论坛。
The PCP@Home project looks for short cases of Post's Correspondence Problem with large shortest solutions. This theoretical computer science problem has been in existence since 1946. It demonstrates undecidability: "a problem that cannot be solved for all cases by any algorithm whatsoever." Finding PCPs in this project will help define "decidability criteria for bounded PCP classes."
PCP@Home项目是要用大量最短解寻找Post(波斯特)对应问题的小事件。这个计算机科学的理论问题自1946年便已经存在了。它证明了不可判定性:“一个用任何算法都无法解决所有事件的问题”。在该项目中寻找PCP将有助于定义:“约束PCP的可判定标准”。
To participate in the project, download a precompiled, statically linked executable for Linux ELF, FreeBSD ELF, Solaris 5.6, or Windows (you can also download and compile the source code), and also download a perl script called PcpSieve.pl which runs the executable, scans the output for record solutions, and emails the solutions to the project coordinator (you can also run the executable manually, search the output manually and email any record solutions you find). Note to Windows users: the Windows client was compiled by Michael Keppler of Rechenkraft.net. He says that it has a serious memory leak, and that you may need to kill it and restart it every day. If anyone knows how to debug Windows application memory leaks, please contact him.
This site is also available in German.
加入项目要下载一个在Linux ELF, FreeBSD ELF, Solaris 5.6, or Windows上的预编译静态链接的可执行程序(你也可以下载并编译源码),还要下载一个用于运行改程序的名为PcpSieve.pl的perl脚本。检查用于记录解的输出后,将解email至项目协调器(你也可以手动运行可执行程序,手动寻找输出和发送任何你所找到的记录解)。给Windows用户的提示:Windows客户端是由 Rechenkraft.net的Michael Keppler编译而成。他说其中存在一个严重的内存漏洞,你必须每天停止它后再重新启动。如果有谁知道如何解决这个Windows应用程序内存漏洞的话,请与他联系。
网站同时提供德语访问。
Find generalized Fermat prime numbers in the Generalized Fermat Prime Search. This project uses the Proth program or the GFNSieve21 program to find these numbers. Unix-users and other users can compile the C source code of "GeneFer" for the project and you can directly check a pre-sieved range with it (note that the project owner of the pre-sieving project has blocked the website from viewers in the US, the UK, Australia, Denmark, and other countries which "support the US's war on Iraq"). Version 1.2 of this code is available as of June 10, 2002.
在 中寻找广义费马素数。该项目使用Proth程序或GFNSieve21程序来寻找这些数。Unix用户及其他用户可以为项目 “GeneFer”的C源码进行编译,而且可以用其直接进行预筛选序列的检查(注意该预筛选项目的所有者对来自英国、美国、澳大利亚、丹麦等支持美对伊发动战争的国家的浏览者进行网站屏蔽)。代码1.2版于2002年6月10日发布。
On January 6, 2003, Daniel Heuer discovered the largest known Generalized Fermat prime 148307665536+1 (404,434 digits), with GFNSieve+Proth, beating his previous record from October 8, 2002. "This number is the new largest known prime which is not a Mersenne prime, and the 6th largest known prime." On February 16, 2003, Michael Angel discovered the first prime of the form b217 + 1: 62722131072 + 1 (628,808 digits). This number is the 5th largest known prime. On February 21, 2003, the project completed the whole range 2-2,200,000 for exponent 32768. It found 35 primes in this range. On March 26, 2003, Franz Hagel discovered the 20th Generalized Fermat prime of the form b65536 + 1: 35786865536 + 1 (363,969 digits). On July 12, 2003, Michael Angel discovered the second known prime of the form b217 + 1: 130816131072 + 1. On August 22, 2003, Daniel Heuer discovered the largest known Generalized Fermat prime: 1176694217 + 1. This 795,695 digit number is now the 5th largest known prime. On September 22, 2003, Daniel Heuer discovered the new largest known Generalized Fermat prime: 1372930217 + 1. This 804,474 digit number is now the 5th largest known prime. On January 8, 2004, Yves Gallot discovered the 5th Generalized Fermat prime of the form b131072 + 1: 572186217 + 1 (754,652 digits). On May 30, 2004, Daniel Heuer discovered the two largest known Generalized Fermat primes: 1372930131072 + 1 (804,474 digits) and 1176694131072 + 1 (795,695 digits).
Join a discussion forum about prime numbers.
2003年1月6日,Daniel Heuer用GFNSieve+Proth发现了现已知最大的广义费马素数:148307665536+1 (有404,434位),破了他自己2002年10月8日的纪录。“这个素数是最新的已知最大的非梅森素数,且是第六大已知素数。”2003年2月16日,Michael Angel发现了第一个形式为b217 + 1的素数: 62722131072 + 1 (有628,808位)。这个素数是已知第五大素数。2003年2月21日,项目完成了对指数32768从2至2,200,000的整个区间的计算。其中找到了35个素数。2003年3月26日,Franz Hagel发现了形式为b65536 + 1的第20个广义费马素数: 35786865536 + 1 (有363,969位)。2003年7月12日,Michael Angel发现了第二个形式为b217 + 1的素数:130816131072 + 1。2003年8月22日,Daniel Heuer发现了已知最大的广义费马素数:1176694217 + 1。这个795,695位长的数是现在已知第五大素数。2003年9月22日,Daniel Heuer发现了新的最大广义费马素数:1372930217 + 1。这个804,474位长的数是现在已知的第五大素数。2004年1月8日,Yves Gallot发现了形式为b131072 + 1的第五个广义费马素数: 572186217 + 1 (有754,652位)。2004年5月30日,Daniel Heuer发现了这两个已知最大的广义费马素数:1372930131072 + 1 (804,474位)和1176694131072 + 1 (795,695位)。
加入关于素数的论坛。
Help search for the 21st largest prime number in PSearch. A Proth prime is a prime number of the form k.2 n+1 where 2n > k. The project found the 15th largest prime number (and second largest Proth prime number, 32883.21000004+1, on May 22, 2002.
Participants in the project should have at least a 600 Mhz PC. To join the project, first download George Woltman's PRP software for Windows or Linux. Then send email to William Garnett with your CPU type and speed and your operating system, and he will send you instructions for participating.
Join a discussion forum about the project.
在PSearch里协助寻找第21大的素数。一个普罗斯(Proth)素数是具有k.2 n+1形式的素数(2n > k)。项目于2002年5月22日发现第15大素数(第2大Proth素数:32883.21000004+1)。参与者应至少拥有一台600MHz的PC。要加入该项目,首先下载George Woltman的用于Windows 或 Linux 的PRP 软件,然后向William Garnett发送包括你的CPU类型、速度以及操作系统信息的email,他就会将参与说明发送给你。
加入该项目的论坛。
Help find the smallest Sierpinski number in Seventeen or Bust, a distributed attack on the Sierpinski problem. The project looks for Proth prime numbers in which, for a number k, if every possible choice of n results in a composite (non-prime) Proth number N, k is a Sierpinski number.
在Seventeen or Bust项目中协助寻找最小的斯尔宾斯基数——一个向斯尔宾斯基问题发起挑战的分布式进攻。项目所要寻找的Proth素数是指对一个数k,如果每一个n得到的都是合数(非素数)Proth数N,则k即是斯尔宾斯基数。
The project began its k=33661 project on November 21, 2002, and fifteen additional projects on November 23, 2002. It has found the following primes:
2002年11月21日项目从k=33661开始,其余15个小项也从23日开始。现已找到如下素数:
Prime 位数 Date found
46157 * 2698207 + 1 210,186 2002年11月27日
65567 * 21013803 + 1 305,190 2002年12月3日
44131 * 2995972 + 1 299,823 2002年12月5日
69109 * 21157446 + 1 348,431 2002年12月7日
54767 * 21337287 + 1 402,569 2002年12月22日
5359 * 25054502 + 1 1,521,561 2003年12月15日
28433 * 27830457 + 1 2,357,207 2004年12月30日
27653 * 29167433 + 1 2,759,677 2005年6月15日
To participate in the project, sign up for an account, download the client, add your account name to the client configuration, and run it. The client does Proth tests on individual numbers. Each number should take a few hours to test on an average machine. When the project server assigns you a number, it waits for up to 10 days for you to return your search results, and reassigns the number to someone else if it doesn't receive your results within that time.
加入项目需注册一个帐户,下载客户端,将帐户名填入设置项,最后运行。客户端对每一个数都进行Proth测试。对一般的机器,在每个数的测试上面约要花几个小时。当项目给你分配了一个数后,会等待10天以便你传回搜索结果。在这个时间内未接收到结果的话,会将该数重新分配给其他人。
The client supports users behind firewalls and proxy servers. Version 2.4 of the client is available for Windows, Linux, FreeBSD as of May 31, 2005. Version 2.2 of the client is available for BeOS as of December 11, 2004.
客户端支持在防火墙后和使用代理服务器的用户。2005年5月31日发布了提供给Windows、Linux和FreeBSD的客户端。2004年12月11日发布供BeOS使用的客户端V2.2。
Seventeen or Bust also has a supporting project to sieve numbers for the main project: sieving finds n numbers with small factors and removes them from the pool of prime number candidates which need to be tested by Seventeen or Bust. Two clients are available for sieving: SoBSieve (for Windows) and NBeGone (for multiple platforms). To reserve a range of numbers to sieve, post a message to the sieve coordination thread. Then submit the results from the range to the "sieve numbers" page mentioned above. The latest sob.dat file, with 10 k, is available as of January 3, 2005.
SoB也有一为主项目筛数的支持项目:筛选出一些含小因数的n并从SoB需测试的候选素数种除去。有两个客户端都可以进行筛数:SoBSieve (Windows) 和 NBeGone (多平台)。要保存一序列数供筛选,可向筛选协调线程发送一个消息,然后将序列的结果提交道上面提到的“筛数”页面。最新sob.dat文件有10k,于2005年1月3日可供使用。
As of January 9, 2005, users with regular user accounts can also perform second-pass tests of numbers the project has already tested once. This feature will be included in a future client, but for now it requires a bit of hacking for the Windows client. See details in this thread and participate at your own risk.
See the project's Wiki.
Join a discussion forum about the project.
2005年1月9日起,用户可凭借普通账号对项目已进行一次测试的数进行二次测试。这个特色部分奖包含在未来的客户端中,但至今对Windows客户端要有一点伤害。在这个线程看一下细节。加入时危险性自负。
这里是项目Wiki。
加入项目论坛。
[ Last edited by 第三类接触 on 2005-10-5 at 08:50 ] |
评分
-
查看全部评分
|