Average Error: 0.2 → 0.2
Time: 37.6s
Precision: 64
\[0 \lt m \land 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 r790392 = m;
        double r790393 = 1.0;
        double r790394 = r790393 - r790392;
        double r790395 = r790392 * r790394;
        double r790396 = v;
        double r790397 = r790395 / r790396;
        double r790398 = r790397 - r790393;
        double r790399 = r790398 * r790392;
        return r790399;
}
↓
double f(double m, double v) {
        double r790400 = 1.0;
        double r790401 = v;
        double r790402 = m;
        double r790403 = r790400 - r790402;
        double r790404 = r790402 * r790403;
        double r790405 = r790401 / r790404;
        double r790406 = r790400 / r790405;
        double r790407 = r790406 - r790400;
        double r790408 = r790407 * r790402;
        return r790408;
}

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 2019144 
(FPCore (m v)
  :name "a parameter of renormalized beta distribution"
  :pre (and (< 0 m) (< 0 v) (< v 0.25))
  (* (- (/ (* m (- 1 m)) v) 1) m))