fibonacci_prime_numbers/prim.c

#include <stdio.h>
#include <stdbool.h>
#define typ unsigned long long


bool is_it_a_prim(typ* x){
int k = 2;
while(k < *x){
if(*x % k == 0)
return false;
k++;
}
return true;
}


int main(void){
typ int fn = 0, fn_1 = 1, fn_2 = 0;
for(int i=0;i<700;i++)
{
fn = fn_1 + fn_2;
if(is_it_a_prim(&fn))
printf("%llu\n",fn);
fn_2 = fn_1;
fn_1 = fn;
}
getchar();
return 0;
}