1,3,4,7,11,... what is the next sequence number?

8 years agoCan you find a relationship between 4 and its previous two numbers? What about 7 and its previous two numbers?

8 years agois 18

8 years agook.i get it.but how to make the formula?

8 years agoa_n=a_{n-1}+a_{n-2}

8 years agomichael are you study computer science?

8 years agoNote 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).

8 years agoso what we call that number?

8 years agoThere'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.

8 years agosorry,can i ask you about recursive function? i really don`t understand.. hope you can help me..

8 years agoSure, what do you need?

8 years agowhat is recursive function? what i know just it will recall itself. is it?

8 years agoFrom 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.

8 years agoexample else of 'base case'? the easier one. actaualy i do not understand the base case.

8 years agoWell, 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.

8 years agooh. i get it. thank you so much. hope it will help me on final.

8 years agoLikewise. Glad it was helpful!

8 years agobut later can i ask you more about something like this? my course related to this topic.

8 years agoSure, though you might find some more/better help in the MIT 6.0 Intro Computer Science group at http://new.openstudy.com/

8 years ago18

8 years ago