Upd: the first 8 primes are not enough, because $341550071728321 = 10670053 \times 32010157$ (for hacker).↵
↵
===↵
↵
Hi everyone,↵
↵
Generally speaking, using the sequence (2, 325, 9375, 28178, 450775, 9780504, 1795265022) as bases in the Miller-Rabin primality test is sufficient to check prime numbers below $2^{64}$.↵
↵
However, this sequence is quite hard to remember. Some sources suggest using the first 12 prime numbers as bases, while others claim that the first 8 primes are enough. Unfortunately, these claims lack clear references.↵
↵
I'm curious about the minimum number of $n$ if we use the first $n$ prime numbers as bases for testing primality below $2^{64}$.↵
↵
Does anyone know a definitive answer or a reliable source for this?↵
↵
Thank you!↵
↵
*English is not my native language; please excuse typing errors.*
↵
===↵
↵
Hi everyone,↵
↵
Generally speaking, using the sequence (2, 325, 9375, 28178, 450775, 9780504, 1795265022) as bases in the Miller-Rabin primality test is sufficient to check prime numbers below $2^{64}$.↵
↵
However, this sequence is quite hard to remember. Some sources suggest using the first 12 prime numbers as bases, while others claim that the first 8 primes are enough. Unfortunately, these claims lack clear references.↵
↵
I'm curious about the minimum number of $n$ if we use the first $n$ prime numbers as bases for testing primality below $2^{64}$.↵
↵
Does anyone know a definitive answer or a reliable source for this?↵
↵
Thank you!↵
↵
*English is not my native language; please excuse typing errors.*
