Average Error: 0.1 → 0.1
Time: 17.9s
Precision: 64
\[0.0 \lt m \land 0.0 \lt v \land v \lt 0.25\]
\[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)\]
↓
\[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)\]
\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)
↓
\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)
double f(double m, double v) {
        double r30524 = m;
        double r30525 = 1.0;
        double r30526 = r30525 - r30524;
        double r30527 = r30524 * r30526;
        double r30528 = v;
        double r30529 = r30527 / r30528;
        double r30530 = r30529 - r30525;
        double r30531 = r30530 * r30526;
        return r30531;
}
↓
double f(double m, double v) {
        double r30532 = m;
        double r30533 = 1.0;
        double r30534 = r30533 - r30532;
        double r30535 = r30532 * r30534;
        double r30536 = v;
        double r30537 = r30535 / r30536;
        double r30538 = r30537 - r30533;
        double r30539 = r30538 * r30534;
        return r30539;
}

Error

Bits error versus m

Bits error versus v

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)\]

  2. Final simplification0.1

    \[\leadsto \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)\]

Reproduce

herbie shell --seed 2019212 +o rules:numerics
(FPCore (m v)
  :name "b parameter of renormalized beta distribution"
  :precision binary64
  :pre (and (< 0.0 m) (< 0.0 v) (< v 0.25))
  (* (- (/ (* m (- 1 m)) v) 1) (- 1 m)))