We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Can someone check/confirm the additional values for N < 8 that I found with my program (I use deterministic Miller-Rabin with the Sinclair base 2, 325, 9375, 28178, 450775, 9780504, 1795265022, see https://miller-rabin.appspot.com) ?
for N = 7: 1'213'001 (takes around 1.8 seconds)
for N = 6: 10'273'345 (takes around 17 seconds)
for N = 5: 204'066'345 (already takes 6 minutes to run)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #58: Spiral primes
You are viewing a single comment's thread. Return to all comments →
Can someone check/confirm the additional values for N < 8 that I found with my program (I use deterministic Miller-Rabin with the Sinclair base 2, 325, 9375, 28178, 450775, 9780504, 1795265022, see https://miller-rabin.appspot.com) ?
for N = 7: 1'213'001 (takes around 1.8 seconds) for N = 6: 10'273'345 (takes around 17 seconds) for N = 5: 204'066'345 (already takes 6 minutes to run)