Was thinking of writing a word called fibonacci? ( n -- ? ).
The definition would iteratively compute m^n of { { 0 1 } { 1 1 }.
The iteration terminates when the matrix either contains n or a value
greater than n.
If the matrix contains n, then push t.
If the matrix contains a value greater than n, then push f.
First step is to be able to flatten a matrix into a 1-D array.
Anyone know how?
- Leonard
------------------------------------------------------------------------------
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
