At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
Can you find a relationship between 4 and its previous two numbers? What about 7 and its previous two numbers?
ok.i get it.but how to make the formula?
michael are you study computer science?
Note that the relation is the same as that of the Fibonacci numbers, but these are not the fibonacci numbers, because the sequence starts at 1 and 3, not at 0-1-1 (or 1-1).
so what we call that number?
There's no special name for these numbers, they just happen to be related in that term number \(n\) of the relation is defined as the sum of the previous two terms.
sorry,can i ask you about recursive function? i really don`t understand.. hope you can help me..
Sure, what do you need?
what is recursive function? what i know just it will recall itself. is it?
From a computer science perspective, yes, that's correct. A recursive function is a function that calls itself. Generally speaking, recursive functions have a `base case' which, when true, makes the function not call itself. That is how they avoid calling themselves infinitely. For example, in the case of the fibonacci numbers, the base case is having 0 and 1 -- the result is then 1, without having to look at anything else.
example else of 'base case'? the easier one. actaualy i do not understand the base case.
Well, briefly, if we were to write a function for fibonacci (a bad example, honestly, because writing it recursively is a bit slow, bit it will do) that returns the n-th fibonacci number, we would do: function fibonacci(n): if n == 1 or n == 0 then return 1 else return fibonacci(n - 2) + fibonacci(n - 1) We should also technically take care of n being less than zero, in which case we can answer `undefined' or some such, but that's beside the point. The point here is, if I ask for the 1st fibonacci number, I will get 1. If I ask for the second fibonacci number, I will get the 0th fibonacci number + the 1st fibonacci number, both of which are defined as one, so I will get 2. If I ask for the third, I will get the 1st fibonacci number + the 2nd fibonacci number, which we defined above as the 0th fibonacci number + the 1st fibonacci number, so we will get 3 (1 + 2). And so on and so forth.
oh. i get it. thank you so much. hope it will help me on final.
Likewise. Glad it was helpful!
but later can i ask you more about something like this? my course related to this topic.
Sure, though you might find some more/better help in the MIT 6.0 Intro Computer Science group at http://new.openstudy.com/