The number of functions $f$ from $A={0,1,2}$ into $B={0,1,2,3,4,5,6,7}$ such that
$f(i) \le f(j)$ for $i
Go to Discussion
NIMCET Previous Year PYQ
NIMCET NIMCET 2008 PYQ
Solution
Number of non-decreasing functions = combinations with repetition
$= \binom{8+3-1}{3}=\binom{10}{3}$