Class FallingFactorial


  • public class FallingFactorial
    extends Object
    Implementations of the falling factorial (n)_k = (n-k+1)*...*n. In combinatorics this can be interpreted as the number of variations of (n-k) and k indistinguishable objects of two different kinds. Note that the coefficients of the expanded polynomial are (signed) Stirling numbers of the first kind. E.g. (n)_5 = (n-4)*(n-3)*(n-2)*(n-1)*n = 24n - 50n^2 + 35n^3 - 10n^4 + n^5 = s(5,1)n + s(5,2)n^2 + s(5,3)n^3 + s(5,4)n^4 + s(5,5)n^5
    Author:
    Tilman Neumann
    • Constructor Detail

      • FallingFactorial

        public FallingFactorial()
    • Method Detail

      • main

        public static void main​(String[] args)
        Test
        Parameters:
        args - ignored