0
$\begingroup$

Making a group of p people using m out of n available nationalities can be one of these two scenarios;

$m \le p \le n$ or $m \le n \le p$.

Using p,m, and n, how to evaluate the number of ways of making a group of p people using m out of n available nationalities?

$\endgroup$
2
  • 1
    $\begingroup$ what is your attempt? $\endgroup$
    – Klangen
    Commented Jun 27, 2019 at 8:38
  • $\begingroup$ @Klangen I could not reach to the way. I think there is no exact formula for that. And I think it is related to partitions (Ramanujan partitions asymptotic formula should be used I think). $\endgroup$ Commented Jun 27, 2019 at 12:32

0

You must log in to answer this question.