Here's the algorithm ...
Given n,
generate successive fibonacci numbers,
until a number greater than or equal to n is reached.
If the number is equal to n, then n is a fibonacci number.
If the number is greater than n, then n is not a fibonacci number.
Sounds simple, but I don't see a way to do it recursively.
------------------------------------------------------------------------------
Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS,
MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current
with LearnDevNow - 3,200 step-by-step video tutorials by Microsoft
MVPs and experts. ON SALE this month only -- learn more at:
http://p.sf.net/sfu/learnmore_122712
_______________________________________________
Factor-talk mailing list
Factor-talk@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/factor-talk
