Combinations Problem (math not excel) - Page 2
Thanks:  0
Likes:  0

# Thread: Combinations Problem (math not excel)

1. ## Re: Combinations Problem (math not excel)

Originally Posted by pgc01
Can it be that easy?
Yes. It follows directly from the recursive relationship you identified:

Originally Posted by Eric W
Is there an upper limit to the number of people who can sit at a table? If so, the member/table problem will start to diverge from the Bell numbers once n exceeds that number.
You'll also get divergence if you put some bounds at the lower end. I'm not tempted to join Mike's "club" if 25 of us come for dinner and we all sit at separate tables .

2. ## Re: Combinations Problem (math not excel)

Originally Posted by Eric W
One thing I wondered about though. Is there an upper limit to the number of people who can sit at a table? If so, the member/table problem will start to diverge from the Bell numbers once n exceeds that number.
No limit to the number of people at a table or the number of tables in the room.

Thanks to all for all of this, I see that I have a bit of studying to understand the math behind this.

3. ## Re: Combinations Problem (math not excel)

Originally Posted by StephenCrump
Yes. It follows directly from the recursive relationship you identified:
Yes, that's what I noticed at the end. I was pleasantly surprised that the solution was such a simple formula.

4. ## Re: Combinations Problem (math not excel)

Now, a perfect ending to this thread will be to come up with a closed formula (no loops, no recursion) for a Bell number.

No one in the world has ever been able to do it, but that does not not frighten us.

## User Tag List

#### Posting Permissions

• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•