let A ={1,2,3,4,5} and B={6,7,8,9,10}
then how many non decreasing functions are possible from A to B?
First, I think the answer in reply #2 is incorrect.
Suppose that you selected ten numbers from set B allowing repeated memberships.
Here is an example of such a multiset: [9,6,8,6,8].
I can rearrange that selection this way: [6,6,8,8,9].
That can be thought of as a non-decreasing function from .
Written in permutation notation: so .
So any multi-selection of five from set B corresponds to non-decreasing function from .
There are such selections.
Another way to look at it would be:
A non-decreasing function could hit 1, 2, 3, 4, or all 5 of the values in . So, if it hits only 1 value, there are functions that would do that.
If it hits two values, there are different choices for the two values. Since must go to the lesser number, there are possible choices for numbers such that is the least element of that goes to the higher element of .
If it hits three values, there are different choices for the three values, then choices for the two elements in that will map to the higher two elements.
If it hits four values, there are different choices for four values, then choices for the three elements in that will map to the higher three elements.
Finally, if it hits all five values, there is one possible function that will map it.
So, adding them all up, we get: just as Plato got. (In case you are not familiar with multi-set permutations).