搜索资源列表
梅里森素数
- 一个计算梅里森素数的Java程序-a calculation on the number of Forest Java programs
RMI
- RMI的源程序 server端实现了梅森素数的查找 客户端调用服务查找-RMI source server-side to achieve a Mersenne prime search service to find the client calls
Mason_hzk
- 使用eclipse集成GT4插件环境，关于梅森素数查找的实现-GT4 integrated plug-ins using eclipse environment, on the Mersenne prime to find the realization of
source259
- 因特网梅森素数大搜索，多处理器版v25.9-Great Internet Mersenne Prime Search GIMPS Finding World Record Primes Since 1996
Automatic_check_-prime_us_EXCEL
- 用EXCEL自动验算素数，以便寻找梅森素数P值。-Automatic checking of prime numbers using EXCEL to find Mersenne primes P value.
Pku_2191_MersenneCompositeNumbers
- 这是北京大学ACM题库中关于梅森素数的一道题目的解答，希望对所有还奋战在ACM中的同人们以帮助-This is a topic about Mersenne primes Peking University ACM exam answers, hoping to help the same people all the fighting in ACM
寻找梅森素数的程序
- 本程序是一个寻找梅森素数的程序，通过本程序可以很快地判断一个数字是否是梅森素数。-This procedure is a find Mersenne primes program through this program, you can quickly determine whether a number is a Mersenne prime.
Meisenssushu
- 利用卢卡斯莱默方法判定给定的梅森数是否为梅森素数-Using Lucas Leimer Method to prove Meisen Prime Number
Mersenne_Prime
- 这里提供了两个判断一个数是否是梅森素数的matlab程序，仅供参考-Here are two judging whether a number is a Mersenne primes matlab procedures for reference
mersenne_final
- 证明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)
the Mersenne prime
- 用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