tag:blogger.com,1999:blog-7662544687317968079.post128937791092115837..comments2024-03-28T19:27:22.265-07:00Comments on Interview Questions: How to generate fibonacci numbers? How to find out if a given number is a fibonacci number or not? Write C programs to do both.Vijay Agrawalhttp://www.blogger.com/profile/16856170291286959451noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-7662544687317968079.post-12776300473004081492023-12-29T15:29:37.341-08:002023-12-29T15:29:37.341-08:00Thank you for taking the time to write thisThank you for taking the time to write thisGabrielhttps://gabrielfrostson.wordpress.com/noreply@blogger.comtag:blogger.com,1999:blog-7662544687317968079.post-41989375814196878702020-11-25T12:08:06.445-08:002020-11-25T12:08:06.445-08:00What's up i am kavin, its my first time to com...What's up i am kavin, its my first time to commenting anywhere, when i read this post i thought i could also make comment due to this brilliant article.herbal erection pillshttps://erectiledysfunctionpillscvs.com/noreply@blogger.comtag:blogger.com,1999:blog-7662544687317968079.post-32038628736528854402012-11-09T01:07:29.363-08:002012-11-09T01:07:29.363-08:00Thanks - great post!
And here's a way to find...Thanks - great post!<br /><br />And here's a way to find the nth Fibonacci number programatically:<br /><br /><a href="http://www.programmerinterview.com/index.php/recursion/find-nth-fibonacci-number/" rel="nofollow">Find nth Fibonacci number</a>Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7662544687317968079.post-90188980847302740542011-03-11T10:05:18.499-08:002011-03-11T10:05:18.499-08:00The reason why the proof work because one of the p...The reason why the proof work because one of the properties of Fibonacci numbers. A more detailed description can for found at http://en.wikipedia.org/wiki/Fibonacci_number#Recognizing_Fibonacci_numbersAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-7662544687317968079.post-48728536174394369312010-09-09T03:52:30.989-07:002010-09-09T03:52:30.989-07:00Start with a positive integer n. If n is even, div...Start with a positive integer n. If n is even, divide it by 2, else replace n by 3n+1. Repeat until we obtain the value 1 in the sequence. The 3x+1 conjecture says that we eventually reach 1 irrespective of what initial value of n we start with.<br />For example, if we start with n=3, we get a sequence 3,10,5,16,8,4,2,1 using 7 iterations.Unknownhttps://www.blogger.com/profile/16303852626074356621noreply@blogger.comtag:blogger.com,1999:blog-7662544687317968079.post-13518074048988328052008-10-20T10:58:00.000-07:002008-10-20T10:58:00.000-07:00Thank you!You just saved my scholarship!Thank you!<BR/>You just saved my scholarship!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7662544687317968079.post-38767858726789760462008-04-02T12:05:00.000-07:002008-04-02T12:05:00.000-07:00please May i know the arithmetic logic behind the...please May i know the arithmetic logic behind the 5*n*n-4 and 5*n*n+4 process?Sreediptohttps://www.blogger.com/profile/12775942458796868548noreply@blogger.com