MathPHP\Probability\CombinatoricsAxiomsTest::testRisingFactorialAsLahNumberAndFallingFactorial PHP Метод

testRisingFactorialAsLahNumberAndFallingFactorial() публичный Метод

Axiom: x⁽ⁿ⁾ = L⟮n,k⟯ x₍k₎ Rising factorial can be represented as the summation of Lah numbers and falling factorials
    public function testRisingFactorialAsLahNumberAndFallingFactorial(int $x, $n)
    {
        $x⁽ⁿ⁾ = Combinatorics::risingFactorial($x, $n);
        $∑L⟮n、k⟯x₍k₎ = 0;
        for ($k = 1; $k <= $n; $k++) {
            $x₍k₎ = Combinatorics::fallingFactorial($x, $k);
            $L⟮n、k⟯ = Combinatorics::lahNumber($n, $k);
            $∑L⟮n、k⟯x₍k₎ += $L⟮n、k⟯ * $x₍k₎;
        }
        $this->assertEquals($x⁽ⁿ⁾, $∑L⟮n、k⟯x₍k₎);
    }