RMI的源程序 server端实现了梅森素数的查找 客户端调用服务查找-RMI source server-side to achieve a Mersenne prime search service to find the client calls

使用eclipse集成GT4插件环境，关于梅森素数查找的实现-GT4 integrated plug-ins using eclipse environment, on the Mersenne prime to find the realization of

证明p=89、107、127、521、607、1279时Mp=2p-1是Mersenne素数，并打印出这些数的所有位数(It is proved that when p=89, 107, 127, 521, 607, 1279, Mp=2p-1 is the prime number of Mersenne, and all the digits of these numbers are printed ou)

用Fortran语言写的一个简单的寻找梅森素数的小程序，主要是利用了二进制数组存储数据，然后用卢卡斯·莱默检验法判断所找到的数是否为梅森素数。(A simple program for finding Mason primes is written in Fortran language. It mainly uses binary arrays to store data, and then uses Lucas Lemmer test to determine whether the num