1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Find a recurrence relation

  1. May 26, 2008 #1

    tgt

    User Avatar

    1. The problem statement, all variables and given/known data
    Find the recurrence relation to

    1,1,2,5,12,47,....


    3. The attempt at a solution
    Made all sorts of attempts. I'm not experienced with these things.

    Was there a site that works these things out for you?
     
    Last edited: May 26, 2008
  2. jcsd
  3. May 26, 2008 #2

    Gib Z

    User Avatar
    Homework Helper

    Do you have more terms? It might have no elementary relation. If you have more terms, list the difference between each consecutive terms. This forms a new sequence, do the same to this sequence. Keep doing it until the difference is a constant number. If it took you n times to do it, the relation is a polynomial of degree n.
     
  4. May 26, 2008 #3

    tgt

    User Avatar

    What happens if there is no elementary recurrence relation? What recurrence relation might it have then?
     
  5. May 26, 2008 #4

    tgt

    User Avatar

    I can give you one more term in the recurrence relation,
    1,1,2,5,12,47,135,...

    It is most likely non elementary
     
  6. May 26, 2008 #5

    Defennder

    User Avatar
    Homework Helper

    Why don't you post the entire question here without truncating the series? Otherwise, it'll be difficult for the posters here to figure out the answer without even having the complete question to begin with.
     
  7. May 27, 2008 #6

    tgt

    User Avatar

    Would it still be a recurrence relation if the relation was a function of n only? i.e a_n = f(n) where f(n) is a function of n.

    What if a_n=f(n) where a_0 is in f(n)? Is a_n still a recurrence relation?
     
  8. May 27, 2008 #7

    Gib Z

    User Avatar
    Homework Helper

    Depends what f(n) is. For example if f(n) = 2^n, then yours sequence is still the recurrence relation a_0 =1 , a_n+1 = 2 a_n.
     
  9. May 27, 2008 #8

    tgt

    User Avatar

    So if the question stated give any recurrence relation and I wrote down f(n)=2^n and only that , would it be full marks?
     
  10. May 27, 2008 #9

    Gib Z

    User Avatar
    Homework Helper

    No you should probably put it in the form I did for full marks.
     
  11. May 28, 2008 #10
    It's not in Sloane, surprisingly.
     
  12. May 28, 2008 #11

    tgt

    User Avatar

    What do you mean? I don't understand.
     
  13. May 29, 2008 #12
    Sloane's rather comprehensive encyclopedia of integer sequences.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Find a recurrence relation
Loading...