A Combinatorical Proof

Prove the following combinatorial:

The number of ways of placing nn labeled balls into nn indistinguishable boxes is equal to

k=0(k+1)n1k!e\dfrac{\displaystyle \sum_{k=0}^{\infty} \dfrac {(k+1)^{n-1}}{k!}}{e}

Note by Sharky Kesa
3 years, 1 month ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

What you are counting is the Bell numbers, and your result is known as Dobinski's formula.

(By the way, this is not a bijection. A bijection is a 1-1 correspondence between two sets. What you want to prove is that a certain combinatorial formula is true.)

Jon Haussmann - 3 years, 1 month ago

Log in to reply

OK, thanks! However, I thought that a bijection could be constructed between these two by changing the summation.

Sharky Kesa - 3 years, 1 month ago

Log in to reply

Okay so I have a solution for putting nn balls in exactly kk boxes:

Define a function that takes an ordered pair of naturals to a nonnegative integer:

f(n,k)={1k=11n=k0k>nkf(n1,k)+f(n1,k1)for other casesf(n,k)=\begin{cases} 1 & k=1 \\ 1 & n=k \\0 & k>n\\kf(n-1,k)+f(n-1,k-1) & \text{for other cases}\end{cases}

This function should satisfy it if my LaTeX is correct.

Now for putting nn balls in nn boxes, just do

x=1nf(n,x)\displaystyle \sum_{x=1}^{n}f(n,x)

Wen Z - 3 years, 1 month ago

Log in to reply

Now you just need to biject this summation to the other summation.

Sharky Kesa - 3 years, 1 month ago

Log in to reply

I looked it up and it I haven't seen any solutions which use a combinatorial bijection.

Wen Z - 3 years, 1 month ago

Log in to reply

@Wen Z Can you think of any other solution tghen? It might help to create a bijection.

Sharky Kesa - 3 years, 1 month ago

Log in to reply

Are you sure that's correct? For example when n=1n=1 we have 11 way of putting a ball in a box, but the sum indicates that there are a few more than 1 way; for k=0k=0 that term alone is already 11.

Wen Z - 3 years, 1 month ago

Log in to reply

I forgot to put a denominator in the sum but it has been rectified.

Sharky Kesa - 3 years, 1 month ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...