acm - an acm publication


Random thoughts and prime numbers

Ubiquity, Volume 2002 Issue October, October 1 - October 31, 2002 | BY Ubiquity staff 


Full citation in the ACM Digital Library

Jin-Yi Cai on the nature of theoretical computer science research.

Connection Failure


To find and prove prime numbers is very time consuming. One possible way to shorten that time might be to link five computers together, one being the master and the other four slaves. There are only four numbers in ten that can be prime when you pass the number ten. One slave divides only by the threes (3,3*10,3*20,etc.) The next slave divides the same way by the sevens The third slave divides by the nines (Iknow nine is acomposite, but nineteen isn't), and the last slave by the ones, starting at eleven.(starting at one would falsely call every number prime) The master computer would send the suspect number to all the slaves and start the run. The master would process the output and at the end of the run would send the next number N+2 to the slaves to run. You would also need a command to skip over the numbers ending in five so it would skip and go to the next seven. This might save you a lot of time if it can be done.

��� Kennie Enox, Sun, 15 Jan 2012 15:48:41 UTC

Leave this field empty