Mathematics 32 Online OpenStudy (anonymous):

1,3,4,7,11,... what is the next sequence number? OpenStudy (shadowfiend):

Can you find a relationship between 4 and its previous two numbers? What about 7 and its previous two numbers? OpenStudy (michael):

is 18 OpenStudy (anonymous):

ok.i get it.but how to make the formula? OpenStudy (michael):

a_n=a_{n-1}+a_{n-2} OpenStudy (michael): OpenStudy (anonymous):

michael are you study computer science? OpenStudy (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). OpenStudy (anonymous):

so what we call that number? OpenStudy (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. OpenStudy (anonymous):

sorry,can i ask you about recursive function? i really don`t understand.. hope you can help me.. OpenStudy (shadowfiend):

Sure, what do you need? OpenStudy (anonymous):

what is recursive function? what i know just it will recall itself. is it? OpenStudy (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. OpenStudy (anonymous):

example else of 'base case'? the easier one. actaualy i do not understand the base case. OpenStudy (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. OpenStudy (anonymous):

oh. i get it. thank you so much. hope it will help me on final. OpenStudy (shadowfiend): OpenStudy (anonymous):

but later can i ask you more about something like this? my course related to this topic. OpenStudy (shadowfiend):

Sure, though you might find some more/better help in the MIT 6.0 Intro Computer Science group at http://new.openstudy.com/ OpenStudy (anonymous):

18

Latest Questions ineedagfsobad122: hey what ever ur name is on the vc girl i think whats ur qc if its u text back
2 hours ago 1 Reply 0 Medals Tbone: Edits ^-^
1 hour ago 6 Replies 3 Medals rose12345: look
6 hours ago 11 Replies 3 Medals jessii: What are the pros and cons of being a flight attendant?
38 minutes ago 5 Replies 1 Medal SamRoman: What do y'all think of my Cover photo for my next YouTube video?
57 minutes ago 13 Replies 1 Medal lovelygirl13: i made a collage of the color green
10 minutes ago 7 Replies 3 Medals AlexisWolfe: 1. At the beginning of Chapter 3, Holden says, u201cIu2019m the most terrific liar you ever saw in your life.
58 minutes ago 2 Replies 0 Medals chrishale13840: would this be a good tattoo
10 hours ago 18 Replies 5 Medals Zayne2003: Why was everyone there at the Tabard inn (beginning of Canterbury Tales)?
10 hours ago 8 Replies 2 Medals