Anonymous user
Talk:Zeckendorf number representation: Difference between revisions
Talk:Zeckendorf number representation (view source)
Revision as of 21:34, 23 October 2012
, 11 years ago→Consensus on the sequence: added comments on a non-Fibonacci series solution as well as generic solutions. -- ~~~~
(→Consensus on the sequence: Great.) |
(→Consensus on the sequence: added comments on a non-Fibonacci series solution as well as generic solutions. -- ~~~~) |
||
Line 26:
:::::Much thanks guys, the fixes are great. I am currently trying not to get a full blown cold, which appears to be what's affecting my concentration. --[[User:Paddy3118|Paddy3118]] 18:35, 12 October 2012 (UTC)
: It should be noted that this task can be solved without using a Fibonacci sequence. See the '''generic''' example in the REXX section. -- [[User:Gerard Schildberger|Gerard Schildberger]] 21:34, 23 October 2012 (UTC)
: Also, the '''general''' REXX solution solves the task for '''N''' Zeckendorf numbers, which merely generates a Fibonacci sequence whose last numer is greater or equal to '''N''' (instead of hard coding six Fibonacci numbers). I think it'd be a better task to list up to '''N''' Zeckendorf numbers, with 20 being the default. That way, no short cuts would be used in the examples and thereby hiding the limitations of the programs. -- [[User:Gerard Schildberger|Gerard Schildberger]] 21:34, 23 October 2012 (UTC)
==Perl 6, wrong fib sequence==
| |||