Merge branch 'master' of https://git.efi.th-nuernberg.de/gitea/resnikal71202/fibonacci_prime_numbers

not as expected

output.txt

@@ -1,37 +0,0 @@
-1
-2
-3
-5
-13      
-89      
-233     
-1597    
-28657   
-514229  
-433494437   
-2971215073  
-99194853094755497       
-14013500826593372729    
-4114278174457313509
-6683802735834427373     
-8247890213920313141     
-17504190596613691853    
-15292964163909980753    
-16402503919862062741    
-16748369039615783       
-4556413679050501601     
-7756736859047550329 
-13663686310138671311    
-725489935870370137      
-5998025902274396933     
-13762891347129141013    
-1531640878805762143     
-10952243858991817037    
-17577209423502407209        
-9689494021993348021     
-1754094168723009433     
-15320491370700286093    
-11026208260892088449    
-16132465177491391621    
-4762091807859633881     
-2447880081438970261

prim.c

@@ -3,8 +3,7 @@
 #include <limits.h>
 #define typ long long int
 
-
+bool foo(typ* x){
-bool is_it_a_prim(typ* x){
 int k = 2;
 while(k < *x){
 if(*x % k == 0)
@@ -14,18 +13,18 @@ k++;
 return true;
 }
 
-
 int main(void){
 typ fn = 0, fn_1 = 1, fn_2 = 0;
-int i = 2;
+
-while(fn < LLONG_MAX)
+printf("%llu",ULONG_MAX);
+
+while(fn < ULONG_MAX)
 {
-fn = fn_1 + fn_2;
+fn = (typ)fn_1 + (typ)fn_2;
-if(is_it_a_prim(&fn))
+if(foo(&fn))
-printf("%d\t%llu\n",i ,fn);
+printf("%llu\n",fn);
 fn_2 = fn_1;
 fn_1 = fn;
-i++;
 }
 return 0;
 }