hello(adsbygoogle = window.adsbygoogle || []).push({});

any one can help me with this question

thanx

(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

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Tough one

**Physics Forums | Science Articles, Homework Help, Discussion**