anonymous
  • anonymous
1,3,4,7,11,... what is the next sequence number?
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
shadowfiend
  • shadowfiend
Can you find a relationship between 4 and its previous two numbers? What about 7 and its previous two numbers?
Michael
  • Michael
is 18
anonymous
  • anonymous
ok.i get it.but how to make the formula?

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

Michael
  • Michael
a_n=a_{n-1}+a_{n-2}
Michael
  • Michael
http://en.wikipedia.org/wiki/Fibonacci_number
anonymous
  • anonymous
michael are you study computer science?
shadowfiend
  • shadowfiend
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).
anonymous
  • anonymous
so what we call that number?
shadowfiend
  • shadowfiend
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.
anonymous
  • anonymous
sorry,can i ask you about recursive function? i really don`t understand.. hope you can help me..
shadowfiend
  • shadowfiend
Sure, what do you need?
anonymous
  • anonymous
what is recursive function? what i know just it will recall itself. is it?
shadowfiend
  • shadowfiend
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.
anonymous
  • anonymous
example else of 'base case'? the easier one. actaualy i do not understand the base case.
shadowfiend
  • shadowfiend
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.
anonymous
  • anonymous
oh. i get it. thank you so much. hope it will help me on final.
shadowfiend
  • shadowfiend
Likewise. Glad it was helpful!
anonymous
  • anonymous
but later can i ask you more about something like this? my course related to this topic.
shadowfiend
  • shadowfiend
Sure, though you might find some more/better help in the MIT 6.0 Intro Computer Science group at http://new.openstudy.com/
anonymous
  • anonymous
18

Looking for something else?

Not the answer you are looking for? Search for more explanations.