Talk:Fibonacci n-step number sequences: Difference between revisions

Line 29:

In the first part of the task description:

<br>

1. Write a function to generate Fibonacci n-step number sequences ''given its initial values'' and assuming the number of initial values determines how many previous values are summed to make the next number of the series.

: 1. Write a function to generate Fibonacci n-step number sequences ''given its initial values'' and assuming the number of initial values determines how many previous values are summed to make the next number of the series.

(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 ~~intial~~ values (but can be overridden by the requestor), but from the other verb tense ''determines'', it appears you want us (or the requestor) to specify the initial values.

I assummed by the verb tense ''given'' that the sequence is already known and has its initial values (but can be overridden by the requestor), but from the other verb tense ''determines'', it appears you want us (or the requestor) to specify the initial values.

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 ==