After an overlong delay following Richard Schroeppel's kind return-supply of a copy of my 'Mersenne Numbers' notes of 1983-1990, I have scanned them in to text-searchable pdf. They are available at http://www.cs.reading.ac.uk/people/G.Haworth.htm?publications and specifically as http://www.cs.reading.ac.uk/common/publications/02116.pdf This is the 22/01/90 version, and so a retrospective, looking back 15 years. Please use as you see fit. If my scanning technique or technology proves to be significantly off the pace, I'll rescan. I suppose it might be worth building a database, off which review-reports of this kind might be derived. So I am interested in views of how to update the content, information management and presentation. I'm also trying to find a copy of my 'Mersenne Numbers: Consolidated Results' which covered the collation of previous results, together with the ICL DAP's second-sourcing and occasional correction of those results. Incidentally, Mersenne's conjecture about prime M(p) with p between 1 million and 2 million was disproved in 1996 with: M(1,257,787), the 34th prime M(p) and M(1,398,269), the 35th prime M(p) I attended the Celebration of David Wheeler's work at Cambridge University's Computer Laboratory on Monday. There was brief mention of the Miller/Wheeler paper in Nature(1951) [v168, p868] which "ushered in the computer-age of prime-finding" . I see others agree ... http://primes.utm.edu/notes/by_year.html#MW The footnote is that their program was used to test the integrity of EDSAC 1. Guy