Fibonacci series means a series of numbers in which each number is the sum of the two preceding numbers. Example is 1, 1, 2, 3, 5, 8<\/p>\n\n\n\n
Below is C program code to print Fibonacci series as per user input or up to n number.<\/p>\n\n\n\n
for e.g if user input 200 then program will print Fibonacci series till 200 meaning sum which is less than or equal to 200.<\/p>\n\n\n\n
\/\/Program Name: Print fibonacci series using for loop upto n term\n\/\/ for e.g 1, 1, 2, 3, 5, 8\n\n#include <stdio.h>\n\nvoid main()\n{\n int s1=0,s2=1; \/\/initializing first two numbers \n int nextNum=0,SumUpto=0;\n\n printf(\"\\n\\n\\tPlease enter number up to which print Fibonacci series is required \\t\");\n scanf(\"%d\",&SumUpto);\n \/\/here assuming user will enter value more than 1 \n \/\/printing first two numbers\n printf(\"\\n\\tfibbonacci Series up to %d is \",SumUpto);\n printf(\"\\n\\n\\t%d %d\",s1,s2);\n for(nextNum=2;nextNum<=SumUpto;)\n { \n \n s1=s2; \n s2=nextNum; \n printf(\" %d\",nextNum); \n nextNum=s1+s2;\n } \n}<\/code><\/pre>\n\n\n\nOutput<\/strong><\/p>\n\n\n\n\n Please enter number up to which print Fibonacci series is required 200\n\n Fibonacci Series up to 200 is \n\n 0 1 2 3 5 8 13 21 34 55 89 144<\/code><\/pre>\n\n\n\nAnother method to find the Fibonacci numbers is by using the golden ratio (1.618034).<\/p>\n\n\n\n
Here is a method to find the Fibonacci series using the golden ratio method.<\/p>\n\n\n\n
Just by multiplying the previous Fibonacci Number by the golden ratio(1.618034), we get the approximated Fibonacci number. For example, 2 \u00d7 1.618034… = 3.236068. This gives the next Fibonacci number 2 after 3.<\/p>\n\n\n\n
C code for Fibonacci series using the golden ratio.<\/p>\n\n\n\n
\/\/ Fibbonaci series using golden ratio.\n#include <stdio.h>\n#include <math.h>\nint main() {\n \/\/ Write C code here\n float result=1.0;\n \/\/result=1.0;\n printf("\\n0\\n1\\n1");\n for(int i=1;i<15;i++)\n {\n result = lround( result * (1.618034));\n printf("\\n%d",lround(result));\n }\n}<\/code><\/pre><\/div>\n\n\n\nOutput<\/p>\n\n\n\n
0\n1\n1\n2\n3\n5\n8\n13\n21\n34\n55\n89\n144\n233\n377\n610\n987<\/code><\/pre><\/div>\n\n\n\n<\/p>\n","protected":false},"excerpt":{"rendered":"
Fibonacci series means a series of numbers in which each number is the sum of the two preceding numbers. Example is 1, 1, 2, 3, 5, 8 Below is C program code to print Fibonacci series as per user input or up to n number. for e.g if user input 200 then program will print […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_uag_custom_page_level_css":"","footnotes":""},"categories":[6],"tags":[],"class_list":["post-173","post","type-post","status-publish","format-standard","hentry","category-c-language"],"aioseo_notices":[],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false,"sparkling-featured":false,"sparkling-featured-fullwidth":false,"tab-small":false},"uagb_author_info":{"display_name":"program45_-rt8nb","author_link":"https:\/\/ethosspace.com\/programmers\/author\/program45_-rt8nb\/"},"uagb_comment_info":0,"uagb_excerpt":"Fibonacci series means a series of numbers in which each number is the sum of the two preceding numbers. Example is 1, 1, 2, 3, 5, 8 Below is C program code to print Fibonacci series as per user input or up to n number. for e.g if user input 200 then program will print…","_links":{"self":[{"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/posts\/173","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/comments?post=173"}],"version-history":[{"count":11,"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/posts\/173\/revisions"}],"predecessor-version":[{"id":1060,"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/posts\/173\/revisions\/1060"}],"wp:attachment":[{"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/media?parent=173"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/categories?post=173"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ethosspace.com\/programmers\/wp-json\/wp\/v2\/tags?post=173"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}