Revision as of 16:24, 29 August 2019 (view source) Petelomax (talk \| contribs) (→‎{{header\|Phix}}) ← Older edit		Revision as of 16:35, 29 August 2019 (view source) Petelomax (talk \| contribs) m (→‎{{header\|Phix}}) Newer edit →
Line 521: {{libheader\|mpfr}} {{trans\|Go}} I also tried using a priority queue, popping the smallest (and any duplicates of it) and pushing 2 and 3 on every iteration, which worked pretty well but ended up about 20% slower, (with about 1500 untested candidates left in the queue by the time it found the 2000th second kind. ~~candidates left in the queue by the time it found the 2000th second kind).~~ <lang Phix>-- demo/rosetta/Pierpont_primes.exw include mpfr.e

Pierpont primes: Difference between revisions

Pierpont primes (view source)