Combinatorics + function = lot of fun

Let A = { a 1 , a 2 , , a 100 } A = \{a_1, a_2, \ldots, a_{100}\} and B = { b 1 , b 2 , , b 50 } B = \{b_1, b_2, \ldots, b_{50}\} be two sets of real numbers.

How many non-decreasing function from A A to B B are there such that every element of B B has an inverse image?

None 102 C 50 ^{102}C_{50} 149 C 49 ^{149}C_{49} 99 C 50 ^{99}C_{50} 100 C 49 ^{100}C_{49} 100 C 50 ^{100}C_{50}

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Abdelhamid Saadi
Sep 11, 2015

This problem is equivalent to the number of ordered partition of 100 into 50 parts.

We know that the number of ordered partition of n into k parts is C n 1 k 1 C_{n-1}^{k-1} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...