Fell deep into the rabbit hole of primality testing today. The best-known algorithm is O(log(n)^6). Desperate quest to understand: why 6?!
Conversation
Because 6 is a perfect number. Have a nice day.
1
Replying to
It gets worse: the algorithm is secretly O(log(n)^3) if turns out that Agrawal’s conjecture is true:
Replying to
You got me reading about number theory I wish I understood better. Thanks Andy!
1
1
A couple months ago, I went down the prime number rabbit hole right after I went down the Riemann Hypothesis rabbit hole.
1
1
Show replies