Lines Matching defs:binomial
78 double binomial(unsigned int n, unsigned int k)
135 Tjk = binomial(n-2*k-1, j-k);
145 // basis so we need to divide them by (n, j) binomial coefficient
148 bz[j] /= binomial(n, j);
332 Tjk = sgn(j, k) * binomial(n-j-k, j-k) * binomial(n, k);
338 Tjk = sgn(j, k) * binomial(n-j-k-1, j-k-1) * binomial(n, k);
347 Tjk = sgn(q,k) * binomial(n, k);
350 sb[q][0] += (binomial(n, q) * bz[q]);
380 Tjk = sgn(j, k) * binomial(n-j-k, j-k) * binomial(n, k);
388 Tjk = sgn(j, k) * binomial(n-j-k-1, j-k-1) * binomial(n, k);
399 Tjk = sgn(q,k) * binomial(n, k);
403 sb[X][q][0] += (binomial(n, q) * bz[q][X]);
405 sb[Y][q][0] += (binomial(n, q) * bz[q][Y]);