comb(N, k, exact=False, repetition=False)
This is often expressed as "N choose k".
Array arguments accepted only for exact=False case.
If N < 0, or k < 0, then 0 is returned.
If k > N and repetition=False, then 0 is returned.
Number of things.
Number of elements taken.
If :None:None:`exact` is False, then floating point precision is used, otherwise exact long integer is computed.
If :None:None:`repetition` is True, then the number of combinations with repetition is computed.
The total number of combinations.
The number of combinations of N things taken k at a time.
binom
Binomial coefficient ufunc
>>> from scipy.special import comb
... k = np.array([3, 4])
... n = np.array([10, 10])
... comb(n, k, exact=False) array([ 120., 210.])
>>> comb(10, 3, exact=True) 120
>>> comb(10, 3, exact=True, repetition=True) 220See :
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.linalg._special_matrices.invpascal
scipy.special._basic.comb
scipy.linalg._special_matrices.pascal
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them