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
The answer relies on more number theory than I can understand presently, but it’s good to have a project to learn with.
3
8
Is that a bound? Funny constants are common when a bound doesn't try to be too sharp
1
Yeah, it’s a bound, which makes it less bizarre, but still…
1
Aah just struck me you're prob reading AKS? I recall reading it back in grad school... requires some basic group theory to fully comprehend
1
Replying to
That made me wonder how deep into the rabbit hole you went (don't need to tell me though) as learning abstract algebra on the net is...
1
...prob not easy. Which reminds me that I entered KA's video competition one titled with "What is Abstract Algebra?" 2 years ago 😂
1