factorial

(redirected from Factorial function)
Also found in: Dictionary, Thesaurus, Encyclopedia.

fac·to·ri·al

(fak-tōr'ē-ăl),
1. Pertaining to a statistical factor or factors.
2. Of an integer, that integer multiplied by each smaller integer in succession down to one, written n!; for example, 5! equals 5 × 4 × 3 × 2 × 1 = 120.

fac·to·ri·al

(fak-tōr'ē-ăl)
Pertaining to a statistical factor or factors.
References in periodicals archive ?
n] of rank n is an Eulerian binomial poset with factorial function B(k) = k
It is not hard to see that in any n-interval of an Eulerian binomial poset P with factorial function B(k) for 1 [less than or equal to] k [less than or equal to] n, the Euler-Poincare relation is stated as follows:
Then the poset P and its factorial function B(n) satisfy the following conditions:
Let P be a binomial poset of rank n with factorial function B(k) = [2.
Thus the factorial function B(3) can only take the values 4 or 6 and therefore we are in one of these two cases.
3 shows that for any such poset of rank n [greater than or equal to] 6, the Sheffer factorial function D(3) can only take the values 4, 6 or 8.
and D(3) = 8 has the same factorial function as [C.
P has the following binomial factorial function B(k) = [2.
n is even and there is a positive integer [alpha] > 1 such that poset P has the binomial factorial function B(k) = [2.
Let P be an Eulerian Sheffer poset of even rank n = 2m + 2 > 4 with the binomial factorial function B(k) = [2.
Ehrenborg and Readdy [4] gave a complete classification of the factorial functions of infinite Eulerian binomial posets and infinite Eulerian Sheffer posets.