Average Error: 0.2 → 0.2
Time: 15.2s
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 r11086 = m;
        double r11087 = 1.0;
        double r11088 = r11087 - r11086;
        double r11089 = r11086 * r11088;
        double r11090 = v;
        double r11091 = r11089 / r11090;
        double r11092 = r11091 - r11087;
        double r11093 = r11092 * r11086;
        return r11093;
}
↓
double f(double m, double v) {
        double r11094 = 1.0;
        double r11095 = v;
        double r11096 = m;
        double r11097 = 1.0;
        double r11098 = r11097 - r11096;
        double r11099 = r11096 * r11098;
        double r11100 = r11095 / r11099;
        double r11101 = r11094 / r11100;
        double r11102 = r11101 - r11097;
        double r11103 = r11102 * r11096;
        return r11103;
}

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 
(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))