If there is a better way to divide and conquer I am all ears. Yes, I know there are better algorithms like AKS but I need to be able to divide the work among the mapped instances.
Lower divisors would be only the known prime numbers to speed up computation.ġ CPU is the equivalent CPU capacity of a 1.0-1. Quickly means checking a single divisor against the 100 million digit number within hours.Įfficient division means only checking the odd numbers up to the square root. Instance 1: checks divisors 2-1000, Instance 2: checks divisors 1001-2000.
If I had access to potentially large number of CPUs and wanted to quickly check 100 million digit numbers for primality using a map-reduce architecture, how many CPUs would be necessary? Each of the mapped compute instances would perform efficient checks against the number in question with an assigned range of divisors (e.g.
0 kommentar(er)
