Anonymous user
Talk:Fibonacci sequence: Difference between revisions
Clarified?
m (→negative n errors: now fixed) |
(Clarified?) |
||
Line 23:
Negative n isn't an error; while conventionally only the definition for positive n is given, the Fibonaccy sequence is actually defined for arbitrary n. You can rewrite the recursion formula F<sub>n+1</sub>=F<sub>n</sub>+F<sub>n-1</sub> as F<sub>n-1</sub>=F<sub>n+1</sub>-F<sub>n</sub> and thus extend the recursive definition to negative values. This results in
:<math>F<sub>0</sub>=0</math>
:<math>F<sub>-n</sub>=(-1)<sup>n+1</sup>F<sub>n</sub></math>
If the word "errors" is removed from the description, it becomes reasonable. --[[User:Ce|Ce]] 14:40, 7 April 2008 (MDT)
: I've now fixed that. --[[User:Ce|Ce]] 08:35, 14 October 2008 (UTC)
== Clarified? ==
In the task page there is the note ''"This task has been clarified. Its programming examples are in need of review..."''. I am not sure what exactly has been clarified, but at least the value of fibonacci(0) seems to be wrong in many language examples.
Should the language examples that have been fixed be marked somehow so that we will know when all the examples have been corrected? (Or perhaps mark all examples and then remove the mark when it has been checked.)
--[[User:PauliKL|PauliKL]] 15:14, 14 April 2009 (UTC)
| |||