Abstract
At first a definition of Mersenne Prime numbers are given. Then we will introduce Lucas-Lehmer's algorithm for primality testing mersenne numbers. The algorithm is then compiled and run in CRAY X-MP. In order to prevent overflow and to improve execution speed, 16-bit word length is used.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
