Accessibility navigation

Mersenne Numbers: consolidated results

Haworth, G. M., Holmes, S., Hunt, D., Lake, T. and Reddaway, S., (1986) Mersenne Numbers: consolidated results. Technical Report. Guy Haworth (first author), Reading. pp66.

[img] Text - Published Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


This document provides and comments on the results of the Lucas-Lehmer testing and/or partial factorisation of all Mersenne Numbers Mp = 2^p-1 where p is prime and less than 100,000. Previous computations have either been confirmed or corrected. The LLT computations on the ICL DAP is the first implementation of Fast-Fermat-Number-Transform multiplication in connection with Mersenne Number testing. This paper championed the disciplines of systematically testing the Mp, and of double-sourcing results which were not manifestly correct. Both disciplines were adopted by the later GIMPS initiative, the 'Great Internet Mersenne Prime Search, which was itself one of the first web-based distributed-community projects.

Item Type:Report (Technical Report)
ID Code:5948
Uncontrolled Keywords:Distributed Array Processor, error-correction, Fast Fermat-Number transform multiplication, first factor, ICL, Lucas-Lehmer test, Mersenne number, results
Publisher:Guy Haworth (first author)
Publisher Statement:The publisher agrees this can be republished via CentAUR.


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation