What does this formula mean and how do I use it?
S(n+1,m) = S(n,m-1)+m*S(n,m)
Explain this Formula
Started by gammaman, Mar 22 2009 06:13 AM
4 replies to this topic
#1
Posted 22 March 2009 - 06:13 AM
|
|
|
#2
Posted 22 March 2009 - 06:58 AM
gammaman said:
What does this formula mean and how do I use it?
S(n+1,m) = S(n,m-1)+m*S(n,m)
S(n+1,m) = S(n,m-1)+m*S(n,m)
What's
S=?
n=?
m=?
For care to explain that for me please :)
#3
Posted 22 March 2009 - 10:04 AM
The only other part I figured out is that S(n,m) = the total number of partitions on n elements with m blocks.
#4
Posted 22 March 2009 - 01:33 PM
It appears to be a recurrence relation of some kind. The most important inference from this particular one would probably be:
S(n,m) = S(n-1,m-1)+m*S(n-1,m)
(I should note, you should watch what (n, m) this is correct for!)
You can probably work out some special cases (like maybe S(0, m) = ...) which allow you to use it in a kind of dynamic programming method.
S(n,m) = S(n-1,m-1)+m*S(n-1,m)
(I should note, you should watch what (n, m) this is correct for!)
You can probably work out some special cases (like maybe S(0, m) = ...) which allow you to use it in a kind of dynamic programming method.
#5
Posted 23 March 2009 - 06:10 AM
Adding to what PythonPower said,
It is an incomplete recurrence relation. You have to have the initial conditions. It is the mathematical equivalent of recursion in programming.
It is an incomplete recurrence relation. You have to have the initial conditions. It is the mathematical equivalent of recursion in programming.


Sign In
Create Account


Back to top









