Average Error: 0.1 → 0.1
Time: 3.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 r8895 = m;
        double r8896 = 1.0;
        double r8897 = r8896 - r8895;
        double r8898 = r8895 * r8897;
        double r8899 = v;
        double r8900 = r8898 / r8899;
        double r8901 = r8900 - r8896;
        double r8902 = r8901 * r8897;
        return r8902;
}
↓
double f(double m, double v) {
        double r8903 = m;
        double r8904 = 1.0;
        double r8905 = r8904 - r8903;
        double r8906 = r8903 * r8905;
        double r8907 = v;
        double r8908 = r8906 / r8907;
        double r8909 = r8908 - r8904;
        double r8910 = r8909 * r8905;
        return r8910;
}

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 2019353 +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)))