Revision as of 14:25, 10 June 2023 (view source) Petelomax (talk \| contribs) (→‎Thirty billion primes: yep) ← Older edit		Revision as of 14:28, 10 June 2023 (view source) Petelomax (talk \| contribs) (→‎Thirty billion primes) Newer edit →
Line 11: :The quickest way I know of to get from one prime to the next without using a sieve is to use GMP's ''mpz_nextprime'' function though the numbers here are 'small' by GMP's standards and there may be quicker ways which are optimized for 8 byte integers. Even so, it seems an extremely tall order to brute force this in only 2 hours and you may be right that he has a pre-built file or files of prime numbers to use for his OEIS work. --[[User:PureFox\|PureFox]] ([[User talk:PureFox\|talk]]) 08:13, 10 June 2023 (UTC) ::Oh, that 2hrs makes my wild stab of 4-28hrs sound not so crazy, and yep, anyone serious about working with big primes would almost certainly have ana prebuilt odds-only bitsieve lying around on their hard drive and/or being extended overnight. --[[User:Petelomax\|Petelomax]] ([[User talk:Petelomax\|talk]]) 14:25, 10 June 2023 (UTC)

Talk:Sisyphus sequence: Difference between revisions

Talk:Sisyphus sequence (view source)