4 ms·
Wait, you expect to be able to easily check primality of 2^32 + 1 by hand? Like with a naive algorithm you’d need to use erastothenes sieve to find primes up to
by ummonk 7y ago
Wait, you expect to be able to easily check primality of 2^32 + 1 by hand? Like with a naive algorithm you’d need to use erastothenes sieve to find primes up to 2^16 to test against. Granted, 641 itself is rather small but if you didn’t expect to encounter a factor that early...
- saagarjha 7y ago> Like with a naive algorithm you’d need to use erastothenes sieve to find primes up to 2^16 to test against. π(2^16)=6542: if you told me in elementary school that I might disproving something famous I can see myself working on that for a couple of hours daily for a week or so.
- ummonk 7y agoWhat if I told you you'd very probably just show that the pattern continues to hold for the first 5 n?
- saagarjha 7y agoYou’d stifle mathematical innovation: after all, there are quite a few things that have been proved or discovered by people who were fortunate enough to not be told that they were solving a hard problem.