Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
I could store all of the known contiguous prime numbers and check against those and then perform trial division of odd numbers up to the square root. If I don't do trial division, how else will I divide and conquer in map-reduce?
I realize there are more efficient ways but how would you go about dividing the problem for map-reduce? Say I used AKS Primality testing or one of the other more efficient algorithms?
