登录 | 首页 -> 华新鲜事 -> 求学狮城 | 切换到:传统版 / sForum | 树形列表
问个数学问题 素数的
<<始页  [1]  末页>> 

问个数学问题 素数的
人们至今发现了多少以内的所有素数?

我在网上搜索到的只有September 17, 2004: All exponents below 9,000,000 double-checked.是2^9000000以内的所有梅森素数,但不清楚是否就是这以内的所有素数?
(http://www.mersenne.org/status.htm)


如果有什么好的关于素数的网站或论坛,请推荐一下,谢谢了
[百及子 (10-30 19:48, Long long ago)] [ 传统版 | sForum ][登录后回复]1楼

When 2n-1 is prime it is said to be a Mersenne prime<a href="http://www.utm.edu/research/primes/programs/music/listen/" style="text-decoration:underline;">This one might be good :-)</a>[莫见愁 (10-30 20:16, Long long ago)] [ 传统版 | sForum ][登录后回复]2楼

(引用 莫见愁:When 2n-1 is prime it is said to be a Mersenne primeThis one might be good :-)...)correction--> 2^n - 1This one might be good :-)[莫见愁 (10-30 20:33, Long long ago)] [ 传统版 | sForum ][登录后回复]3楼

(引用 莫见愁:When 2n-1 is prime it is said to be a Mersenne primeThis one might be good :-)...)果然有趣我也去过这个网站,怎么就没发现呢?

老外就是有趣,我都死读书了
[百及子 (10-30 20:44, Long long ago)] [ 传统版 | sForum ][登录后回复]4楼

http://www.utm.edu/research/primes/[icky (10-30 21:36, Long long ago)] [ 传统版 | sForum ][登录后回复]5楼

(引用 icky:http://www.utm.edu/research/primes/)这个站不错[icky (10-30 21:37, Long long ago)] [ 传统版 | sForum ][登录后回复]6楼

自力更生艰苦创业http://numbers.computation.free.fr/Constants/Primes/Pix/pixproject.html

PI(x) project 比较老,不过数字够可观的了,不知道现在发展到哪个阶段了

随便找了个,贴在这留做参考 pi(4×10^22) = 783,964,159,847,056,303,858

估计50位十进制数字以内的全部素数还没找齐,呵呵
[百及子 (10-30 22:08, Long long ago)] [ 传统版 | sForum ][登录后回复]7楼

Whenever you need you can compute, right?[香陵居士 (10-31 1:06, Long long ago)] [ 传统版 | sForum ][登录后回复]8楼

(引用 香陵居士:Whenever you need you can compute, right?)i compute, or u compute?o no

no single man can compute the number of prime numbers below 10^23 yet; or even u can, or have optimized algorithm, it will take at least months


i am just wondering how far man has gone in the way of searching prime numbers

those predicted to be prime numbers are not within my interest yet
[百及子 (10-31 20:27, Long long ago)] [ 传统版 | sForum ][登录后回复]9楼

(引用 百及子:i compute, or u compute?o no no single man can compute the number of prime numbers below 10^23 yet; or even u can, or have opti...)But I think that's a not so important qJust depend on how much time you want to take to generate the table. If to generate such a number is really so important to someone, he may consider to build a super computer or use grid computing to generate it. And with the development of the processors the time will be shorter.[香陵居士 (10-31 21:37, Long long ago)] [ 传统版 | sForum ][登录后回复]10楼


<<始页  [1]  末页>> 
登录 | 首页 -> 华新鲜事 -> 求学狮城 | [刷新本页] | 切换到:传统版 / sForum