#include <math.h>
#include <stdio.h>
int prime(int n)
{
int i;
long k;
k=sqrt(n) 1;
for(i=2; i<=k; i )
if(n%i == 0)
return 0;
return 1;
}
int main()
{
int mp, n=0, i;
printf("Mersenne Prime:\n");
for(i=2; ; i )
{
mp=pow(2,i)-1;
if( prime(mp)&&n<=4 )
{
n ;
//n表示前幾位梅森素數
printf("2^%d-1=%d", i, mp);
printf("\n");
}
}
return 0;
}
所以前面五位的梅森素數為
更多精彩资讯请关注tft每日頭條，我们将持续为您更新最新资讯!
zpostcode 
Recruit 
weather 
mreligion 
Yellowpages 
sport 
constellation 
shopping 
name 
game 
directory 
literature 
Word 
tour 
furnish 
Lottery 
tftnews 
lyrics 
News 
digital 
car 
dir 
Edu 
Finance 
