The Open Source Swiss Army Knife

/code/c/algorithms_c/
/code/c/algorithms_c/ + sub-categories
http://www.sirfsup.com/
web directory content
    
      

Not logged in
Chat Register Login
return to:  http:/www.sirfsup.com      /code   /c   /algorithms_c 
Permalink: fibonacci.c
Title: fibonacci numbers pow
article options : please login   |  raw source view  

#include <math.h> 

int main() {
	int testers[12] = {1, 2, 3, 4, 5, 10, 15, 20, 25, 50, 100, 150};
	double p = .5*(1 + sqrt(5));
	double q = .5*(1 - sqrt(5));
	double fibonacci_number, p_plus, q_plus;
	int i = 0;
	printf("   n\tp^n/sqrt(5)\t  q^n/sqrt(5)\t  fibonacci\n", testers[i], p_plus, q_plus, fibonacci_number);
	printf("----------------------------------------------------------------------\n");
	for (; i < 12; i++) {
		  fibonacci_number = (pow(p,testers[i]) - pow(q,testers[i]))/sqrt(5);
			p_plus = pow(p, testers[i])/sqrt(5);
			q_plus = pow(q, testers[i])/sqrt(5);
		  printf("%5d\t%5.5e\t%5.5e\t%15e\n", testers[i], p_plus, q_plus, fibonacci_number);
	}    
}

Leave a Reply
Your Name:     anonymous
Your Email:
Website:  
Comments:

The author will be notified of your reply.
return to top