fibonacci_prime_numbers/prim.c

#include <stdio.h>
#include <stdbool.h>
#include <limits.h>
#define typ long long int

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

int main(void){
typ fn = 0, fn_1 = 1, fn_2 = 0;

printf("%llu",ULONG_MAX);

while(fn < ULONG_MAX)
{
fn = (typ)fn_1 + (typ)fn_2;
if(foo(&fn))
printf("%llu\n",fn);
fn_2 = fn_1;
fn_1 = fn;
}
return 0;
}