got one more recursive relation to solve......

D

deemanw

New member
Joined
Aug 2, 2006
Messages
11
s sub(k) = 5* s sub(k-1) + k ; k>= 2; s sub(k) = 1 ????? i'm suppose to "solve" and prove conjecture this time????

does this mean find the formula as before and then set it equal to one and then find what k is equal to??????
 
You really need to find yourself a good Discrete Mathematics text.
Can you find one by Ken Rosen?
The questions you are asking are addressed in such a text.
We do not give lessons here.
The techniques are just too detailed.
If you want to post a solution, we can critique for you.
But we are not here to teach you the material.
 
deemanw said:
s sub(k) = 5* s sub(k-1) + k ; k>= 2; s sub(k) = 1 ????? i'm suppose to "solve" and prove conjecture this time????

does this mean find the formula as before and then set it equal to one and then find what k is equal to??????
Click to expand...

You want to replace the recursive definition with a closed form.

For example, if
f(0) = 1 and
f(k) = k*f(k-1)

The closed form of this would be: f(k) = k!
 
You must log in or register to reply here.
Top