MathPHP\Probability\Distribution\Discrete\Bernoulli::PMF PHP Метод

PMF() публичный статический Метод

https://en.wikipedia.org/wiki/Bernoulli_distribution q = (1 - p) for k = 0 q = p for k = 1
public static PMF ( integer $k, float $p ) : float
$k integer number of successes k ∈ {0, 1} (int type hint with checkLimit enforces this)
$p float success probability 0 < p < 1
Результат float
    public static function PMF(int $k, float $p) : float
    {
        Support::checkLimits(self::LIMITS, ['k' => $k, 'p' => $p]);
        if ($k === 0) {
            return 1 - $p;
        } else {
            return $p;
        }
    }
Bernoulli