Samples are drawn from a hypergeometric distribution with specified
parameters, ngood (ways to make a good selection), nbad (ways to make
a bad selection), and nsample = number of items sampled, which is less
than or equal to the sum ngood + nbad.

Parameters:

ngood : int or array_like of ints

Number of ways to make a good selection. Must be nonnegative.

nbad : int or array_like of ints

Number of ways to make a bad selection. Must be nonnegative.

nsample : int or array_like of ints

Number of items sampled. Must be at least 1 and at most
ngood+nbad.

size : int or tuple of ints, optional

Output shape. If the given shape is, e.g., (m,n,k), then
m*n*k samples are drawn. If size is None (default),
a single value is returned if ngood, nbad, and nsample
are all scalars. Otherwise, np.broadcast(ngood,nbad,nsample).size
samples are drawn.

for P(x) the probability of x successes, n = ngood, m = nbad, and
N = number of samples.

Consider an urn with black and white marbles in it, ngood of them
black and nbad are white. If you draw nsample balls without
replacement, then the hypergeometric distribution describes the
distribution of black balls in the drawn sample.

Note that this distribution is very similar to the binomial
distribution, except that in this case, samples are drawn without
replacement, whereas in the Binomial case samples are drawn with
replacement (or the sample space is infinite). As the sample space
becomes large, this distribution approaches the binomial.

>>> ngood,nbad,nsamp=100,2,10# number of good, number of bad, and number of samples>>> s=np.random.hypergeometric(ngood,nbad,nsamp,1000)>>> hist(s)# note that it is very unlikely to grab both bad items

Suppose you have an urn with 15 white and 15 black marbles.
If you pull 15 marbles at random, how likely is it that
12 or more of them are one color?