Anonymous user
Talk:Fibonacci n-step number sequences: Difference between revisions
Talk:Fibonacci n-step number sequences (view source)
Revision as of 03:08, 26 May 2012
, 11 years ago→task clarification: Answered.
(→Base case 0: new section) |
(→task clarification: Answered.) |
||
Line 29:
In the first part of the task description:
<br>
(italics were added by me).
Now then, do you want us to assume the initial values for any given sequence are already known (assummed), or are we (or the requestor) to supply the initial values, and then from the counting of those values, assume that's what Fibonacci sequence is wanted?
I assummed by the verb tense ''given'' that the sequence is already known and has its
I took the later approach and had the requestor specify the initial values, and from that, deduced which Fibonacci sequence the requestor wanted. -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:59, 25 May 2012 (UTC)
:Hi Gerard, the idea was to describe what I did in the Python :-)<br> That is to create a function/class/... that you first call with only the necessary initial values of a series and get back something that will generate members of the particular series defined by the initial values (the number and order of them as well as their particular values). --[[User:Paddy3118|Paddy3118]] 03:08, 26 May 2012 (UTC)
== Base case 0 ==
| |||