Benedict Irwin deleted file untitled.tex  about 10 years ago

Commit id: 54f8520b22af5397f09c402ac72865631336eb48

deletions | additions      

         

\section{Abstract}  I present a very simple algorithm for testing if a number is prime. The algorithm was developed visually in a cellular automation manner. A data map is created from a simple recursive function and it is east to find if a number is prime,(square, triangular etc. ,not sure yet) from the structure of it's divisors. By checking from the dense end of the factor list the time is minimised.  UNDER CONSTRUCTION