Average Error: 0.2 → 0.2
Time: 17.1s
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 m\]
↓
\[\left(\frac{1}{\frac{v}{m \cdot \left(1 - m\right)}} - 1\right) \cdot m\]
\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m
↓
\left(\frac{1}{\frac{v}{m \cdot \left(1 - m\right)}} - 1\right) \cdot m
double f(double m, double v) {
        double r11333 = m;
        double r11334 = 1.0;
        double r11335 = r11334 - r11333;
        double r11336 = r11333 * r11335;
        double r11337 = v;
        double r11338 = r11336 / r11337;
        double r11339 = r11338 - r11334;
        double r11340 = r11339 * r11333;
        return r11340;
}
↓
double f(double m, double v) {
        double r11341 = 1.0;
        double r11342 = v;
        double r11343 = m;
        double r11344 = 1.0;
        double r11345 = r11344 - r11343;
        double r11346 = r11343 * r11345;
        double r11347 = r11342 / r11346;
        double r11348 = r11341 / r11347;
        double r11349 = r11348 - r11344;
        double r11350 = r11349 * r11343;
        return r11350;
}

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.2

    \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m\]
  2. Using strategy rm

  3. Applied clear-num0.2

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

  4. Final simplification0.2

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

Reproduce

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