Talk:Sisyphus sequence: Difference between revisions

:The only other info I have (see [https://www.reddit.com/r/math/comments/13ofqzn/what_number_comes_next_the_encyclopedia_of/ here on Reddit]) is that it only took him 2 hours! I'd imagine he'd be using C++ on his own machine as it's nothing to do with his work at google. This probably rules out using some sort of segmented sieve and, on the face of it, the algorithm for generating the sequence can't be parallelized - if you split up the numbers to be searched into chunks, the second chunk wouldn't know where to start in the prime sequence until the first chunk had been run.

: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)