Computation of mersenne primes using cray X-MP
Mahmood Haghighi · International Journal of Computer Mathematics · 1992
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.