Average Error: 0.2 → 0.2
Time: 4.8s
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{m}{\frac{v}{1 - m}} - 1\right) \cdot m\]
\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m
↓
\left(\frac{m}{\frac{v}{1 - m}} - 1\right) \cdot m
double f(double m, double v) {
        double r12999 = m;
        double r13000 = 1.0;
        double r13001 = r13000 - r12999;
        double r13002 = r12999 * r13001;
        double r13003 = v;
        double r13004 = r13002 / r13003;
        double r13005 = r13004 - r13000;
        double r13006 = r13005 * r12999;
        return r13006;
}
↓
double f(double m, double v) {
        double r13007 = m;
        double r13008 = v;
        double r13009 = 1.0;
        double r13010 = r13009 - r13007;
        double r13011 = r13008 / r13010;
        double r13012 = r13007 / r13011;
        double r13013 = r13012 - r13009;
        double r13014 = r13013 * r13007;
        return r13014;
}

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 associate-/l*0.2

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

  4. Final simplification0.2

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

Reproduce

herbie shell --seed 2020033 
(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))