I can give you the recursive formula for Bell numbers.
for convenience.
If you more, I can post more.
Bell numbers http://www.mathhelpforum.com/math-he...relations.html
First of all, sorry if this is in the wrong area, if so, please move it. Anyway
suppose I have a set of 3 elements. Computing by hand it is obvious to see that the answer is 5. But what if I have 20 elements? I know I need to use bell number to solve this, but I am not sure how to do this.
Note: I only need to know how to do this for very simple cases, such as
n = 20, 10, 7, etc.
I can give you the recursive formula for Bell numbers.
for convenience.
If you more, I can post more.
Bell numbers http://www.mathhelpforum.com/math-he...relations.html
See this link http://www.mathhelpforum.com/math-he...relations.html
Thanks, I actually found this earlier in my search for answers. It helps somewhat but I am still rather confused.
By the way on the same note. Would you know the follwowing?
If I have a set S{1,2,3} and partition like so
How do I determine the number of E-relations. I was reading through the document you posted but it is confusing to me. Is there a clear cut way to determine the number of E-relations?Code:{1,2,3} {2,3} {1} {1,3} {2} {3} {1,2} {3} {2} {1}
Thanks for working out the bell numbers for me. What about the E-relation though? Is the number of partitions of a set equal to the number of E-relations. So if S{1,2,3} has 5 partitions, does that mean it has 5 E-relations? What about s{1,2,3,4} has 15 partitions, does that mean it always has 15 E-relations?