resnikal71202/fibonacci_prime_numbers
1
0 Fork 0
Code Issues Pull Requests Releases Wiki Activity

Compare commits

base: resnikal71202/fibonacci_prime_numbers:747d70d1d756fb415f4db31905206af2b636386c
resnikal71202/fibonacci_prime_numbers:master
..
compare: resnikal71202/fibonacci_prime_numbers:master
resnikal71202/fibonacci_prime_numbers:master
4 Commits
747d70d1d7 .. master
Author SHA1 Message Date
resnikal71202 5192fdec49 Merge branch 'master' of https://git.efi.th-nuernberg.de/gitea/resnikal71202/fibonacci_prime_numbers 2019-07-03 14:06:10 +02:00
resnikal71202 f33853f0a3 added the right limit 2019-07-03 14:05:34 +02:00
resnikal71202 240fdc1e1f Del output.txt 
not as expected
 2019-07-03 02:57:10 +00:00
resnikal71202 48dac3fb2d now signed and xx th fibonacci´number 2019-07-03 04:51:12 +02:00
1 changed files with 9 additions and 8 deletions
Expand all files Collapse all files
prim.c
+9 -8
View File
@@ -1,10 +1,9 @@
#include <stdio.h>
#include <stdbool.h>
#include <limits.h>
#define typ unsigned long long
#define typ long long int
bool is_it_a_prim(typ* x){
bool foo(typ* x){
int k = 2;
while(k < *x){
if(*x % k == 0)
@@ -14,13 +13,15 @@ k++;
return true;
}
int main(void){
typ int fn = 0, fn_1 = 1, fn_2 = 0;
while(fn < ULLONG_MAX)
typ fn = 0, fn_1 = 1, fn_2 = 0;
printf("%llu",ULONG_MAX);
while(fn < ULONG_MAX)
{
fn = fn_1 + fn_2;
if(is_it_a_prim(&fn))
fn = (typ)fn_1 + (typ)fn_2;
if(foo(&fn))
printf("%llu\n",fn);
fn_2 = fn_1;
fn_1 = fn;