Hi, I was trawling around some of the pages associated with the Proth project yesterday & found that Michael Hartley has started a project to test primality of numbers of the form k.2^n-1 for k > 300. Very little work has been done on these, therefore there are opportunities to find some primes quickly, since the numbers involved are relatively small - there are a number of ranges still available for n between 16000 and 32000, for which one day on a P100 would probably suffice to finish the whole range, and with about an evens chance of finding at least one prime somewhere in the range. This project may be of interest to some people with relatively slow systems capable of running Proth.exe (i.e. wintel systems). The project home page is at http://cis.sit.edu.my/examples/jsp/psearch/start.jsp Note that (although not stated) cookies must be enabled to use the personal account facilities (reservation of ranges, submission of results etc.) Regards Brian Beesley _________________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
