TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Lehmer sieve

52 点作者 fabriceleal超过 11 年前

3 条评论

gajomi超过 11 年前
Very cool. I thought to myself, before clicking on the article, "this is Hacker News, so its probably some interesting number theoretic sieve... but then again there are a lot of people who like to cook so maybe its some kind of novel mechanical sieve". So it was quite satisfying to see discover that it was BOTH in some sense.
评论 #7013260 未加载
jerf超过 11 年前
&quot;Lehmer sieves were very fast, in one particular case factoring 2^93 + 1 in 3 seconds.&quot;<p>Impressive. I wondered how fast my computer could do it. Here&#x27;s the GNU coreutils factor:<p><pre><code> $ time factor 9903520314283042199192993793 9903520314283042199192993793: 3 3 529510939 715827883 2903110321 real 0m0.007s user 0m0.004s sys 0m0.000s </code></pre> Still impressive. This led me down factor&#x27;s documentation to the Pollard Rho algorithm: <a href="http://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm" rel="nofollow">http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Pollard%27s_rho_algorithm</a>
darkbot超过 11 年前
So D-wave is basically a Lehmer sieve?