4 ms·
Does that not mean it is "trivial" to find all of the prime numbers because you can just go through the 24 times table?
by GotAnyMegadeth 12y ago
Does that not mean it is "trivial" to find all of the prime numbers because you can just go through the 24 times table?
- chopin 12y agoI'd say that it makes it at best only 24 times easier. Which cuts the problem down approx. 1.4 order of magnitudes which doesn't matter much when the problem scales exponentially.
- GotAnyMegadeth 12y agoAhh, I was thinking that p^2 - 1 = 24n held for any n as well as any p, but I can see that's not necessarily the case. Thanks
- deleted 12y ago[deleted]
- Aardwolf 12y agoI think such a test is similar to skipping multiples of low primes like 2,3,5,7,... But who knows, maybe it might be more efficient: only one modulo division needed, rather than many :)