Tough one

  • Thread starter hyderman
  • Start date
  • #1
30
0
hello

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
 

Answers and Replies

  • #2
cristo
Staff Emeritus
Science Advisor
8,107
73
You need to show some work before we can help you.
 
  • #3
30
0
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

thanx
 

Related Threads on Tough one

  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
3
Views
4K
  • Last Post
Replies
1
Views
851
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
2
Views
856
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
2
Replies
33
Views
3K
  • Last Post
Replies
13
Views
3K
Top