A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • 5 years ago

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

  • This Question is Closed
  1. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Can you find a relationship between 4 and its previous two numbers? What about 7 and its previous two numbers?

  2. Michael
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    is 18

  3. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ok.i get it.but how to make the formula?

  4. Michael
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    a_n=a_{n-1}+a_{n-2}

  5. Michael
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    http://en.wikipedia.org/wiki/Fibonacci_number

  6. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    michael are you study computer science?

  7. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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).

  8. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    so what we call that number?

  9. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

  10. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  11. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Sure, what do you need?

  12. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  13. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

  14. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    example else of 'base case'? the easier one. actaualy i do not understand the base case.

  15. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

  16. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    oh. i get it. thank you so much. hope it will help me on final.

  17. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Likewise. Glad it was helpful!

  18. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  19. shadowfiend
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  20. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    18

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

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.