MCPcopy Create free account
hub / github.com/DistributedML/Biscotti / Binomial

Function Binomial

lib/gonum/stat/combin/combin.go:27–43  ·  view source on GitHub ↗

Binomial returns the binomial coefficient of (n,k), also commonly referred to as "n choose k". The binomial coefficient, C(n,k), is the number of unordered combinations of k elements in a set that is n elements big, and is defined as C(n,k) = n!/((n-k)!k!) n and k must be non-negative with n >= k

(n, k int)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 3

NewCombinationGeneratorFunction · 0.85
CombinationsFunction · 0.85
TestBinomialFunction · 0.85

Calls

no outgoing calls

Tested by 1

TestBinomialFunction · 0.68