int k, IterationOrder iterationOrder) { CombinatoricsUtils.checkBinomial(n, k); this.n = n; this.k = k;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 1d;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 1;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 0;
int k, IterationOrder iterationOrder) { CombinatoricsUtils.checkBinomial(n, k); this.n = n; this.k = k;
int k, IterationOrder iterationOrder) { CombinatoricsUtils.checkBinomial(n, k); this.n = n; this.k = k;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 1d;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 0;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 1d;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 1;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 1;
CombinatoricsUtils.checkBinomial(n, k); if ((n == k) || (k == 0)) { return 0;