搜索资源列表
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
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