Redirect to:
derangement number or the subfactorial of n or n th de Montmort number (after Pierre Remond de Montmort). Notations for subfactorials in common use include...
Click to read more »(Number)". metanumbers.com. Sloane, N. J. A. (ed.). "Sequence A000166 (Subfactorial or rencontres numbers, or derangements)". The On-Line Encyclopedia of...
Click to read more »Alternating factorial · Factorial moment · Factorial number system · Subfactorial · Primorial · Lanczos approximation · Stirling's approximation Structures...
Click to read more »coefficients, double factorials, falling factorials, primorials, and subfactorials. Implementations of the factorial function are commonly used as an example...
Click to read more »Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A000166 (Subfactorial or rencontres numbers, or derangements: number of permutations of n elements...
Click to read more »n". 3. Subfactorial: if n is a positive integer, !n is the number of derangements of a set of n elements, and is read as "the subfactorial of n". *...
Click to read more »which is a smaller value. In front of a number (!n) represents the subfactorial. It is used to represent the uniqueness quantifier. In linear logic,...
Click to read more »}{\lambda ^{n}}}\sum _{k=0}^{n}{\frac {(-1)^{k}}{k!}}.} where !n is the subfactorial of n. The median of X is given by m [ X ] = ln ( 2 ) λ < E [ X...
Click to read more »Alternating factorial · Factorial moment · Factorial number system · Subfactorial · Primorial · Lanczos approximation · Stirling's approximation Structures...
Click to read more »the hatcheck problem. The number of derangements is also known as the subfactorial of n, written !n. It follows that if all bijections are assigned the...
Click to read more »(given first in red) and a subfactorial (given second in blue). In this order each column corresponds to one subfactorial: T ( n , i ) = ( n i )...
Click to read more »theorem Stirling number Stirling transform Stirling's approximation Subfactorial Table of Newtonian series Taylor series Trinomial expansion Vandermonde's...
Click to read more »x + 1 , − 1 ) e {\displaystyle (!x)={\frac {\Gamma (x+1,-1)}{e}}} is subfactorial, B a ( x ) = − a ζ ( − a + 1 , x ) {\displaystyle B_{a}(x)=-a\zeta (-a+1...
Click to read more »allowed by some variations include the reciprocal function ("1/x"), subfactorial ("!" before the number: !4 equals 9), overline (an infinitely repeated...
Click to read more »counts all permutations of an ordered set S with cardinality n, and the subfactorial (a.k.a. the derangement function) !n, which counts the amount of permutations...
Click to read more »(1983), and was based on the earlier work by Luks (1982) combined with a subfactorial algorithm of V. N. Zemlyachenko (Zemlyachenko, Korneenko & Tyshkevich...
Click to read more »a random variable X, still commonly in use, and he coined the name "subfactorial" for the number of derangements of n items. Another of Whitworth's contributions...
Click to read more »denotes a modified Bessel function, ! n {\displaystyle !n} denotes the subfactorial function, af ( n ) {\displaystyle \operatorname {af} (n)} denotes the...
Click to read more »variants of Wilson's theorem stated in terms of the hyperfactorials, subfactorials, and superfactorials are given in. For integers k ≥ 1 {\displaystyle...
Click to read more »