29 lines
430 B
C
29 lines
430 B
C
|
#include <stdio.h>
|
||
|
|
#include <math.h>
|
||
|
|
|
||
|
|
int potega(int n){
|
||
|
|
int i=0,a=1;
|
||
|
|
for(i=0;i<n;i++){
|
||
|
|
a*=2;
|
||
|
|
}
|
||
|
|
return a;
|
||
|
|
}
|
||
|
|
|
||
|
|
int pierwsza(int a){
|
||
|
|
int i;
|
||
|
|
for(i=2;i<sqrt(a);i++){
|
||
|
|
if(a%i==0) return 1;
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
int main(){
|
||
|
|
int tab[8]={2,3,5,7,11,13,17,19},liczba;
|
||
|
|
int i;
|
||
|
|
for(i=0;i<8;i++){
|
||
|
|
liczba=potega(tab[i])-1;
|
||
|
|
if(pierwsza(liczba)==0) printf("2^%d-1 = %d\n",tab[i],liczba);
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|