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!

Tough one

  1. Mar 8, 2007 #1

    any one can help me with this question


    (a) Find a recurrence relation for the number of n-digit sequences over the alphabet {0, 1, 2, 3, 4} with at least one 1 and the first 1 occurring before the first 0 (possibly no 0’s).

    (b) What are the initial conditions?

    (c) Solve the recurrence relation in Part (a) satisfying the initial condition
  2. jcsd
  3. Mar 8, 2007 #2


    User Avatar
    Staff Emeritus
    Science Advisor

    You need to show some work before we can help you.
  4. Mar 8, 2007 #3
    a) we have property starts with 0,1,2.3.4
    so there are n-1 digits of sequence
    sio i think the recurrence should be 0+(an-1)^3times therefore
    3an-1 + 5

    b) initial condition a0=1 and a1=1

    c) 3n-1+ 5n-1 + an-1

    please i just need some one to explain this in steps .... this type of question will be in the test and i am not sure how to solve it

Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?

Similar Discussions: Tough one
  1. Induction, tough one (Replies: 1)

  2. Tough inequality (Replies: 1)

  3. Tough Locus Problem (Replies: 2)

  4. Very tough question (Replies: 13)