Thanks to the number of people who have already read my Mersenne Primes paper and commented on it, and thanks to the (hopefully larger) number of people who read it without commenting. Could I make a request from the list? A couple of people have noted that they live in a Micro$oft-free world and can't read it. Could anyone make a more Unix-friendly version of the .DOC file (even, say, HTML)? I'm afraid I don't know the slightest thing about Unix or HTML coding. :-< There were some miscellaneous nitpicks, and big thanks to the people who notified me of them. 1) I was mistaken when I noted that taking numbers modulo 2^P - 1 is easy because you can just keep the lower P bits. The process is still easy, but a few more steps are required. D'oh! This is the only "error" found so far... 2) I didn't speak enough about the DWT algorithm used in Prime95. At the very least I should have defined what a DWT is. D'oh! 3) My use of U_n for Fibonacci numbers is non-standard. (In my defense, I got that from my source.) 4) I defined V_n in Proof 6, but not in the main paper. I was assuming that the reader would read Proof 6 when I said "See Proof 6 in Appendix III", but I should have mentioned it in the main body. D'oh! The comments seem to be generally good, though. :-D The URL of the paper is (for those who missed it) http://members.aol.com/stl137/private/mersenne.zip Please do not post links to the paper on public websites, but feel free to send it to acquaintances. Thanks again to all the people who have read it! Stephan "Nitpicker" Lavavej _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
