Average Error: 0.1 → 0.2
Time: 4.5s
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{1}{\frac{v}{m \cdot \left(1 - m\right)}} - 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{1}{\frac{v}{m \cdot \left(1 - m\right)}} - 1\right) \cdot \left(1 - m\right)
double f(double m, double v) {
        double r13769 = m;
        double r13770 = 1.0;
        double r13771 = r13770 - r13769;
        double r13772 = r13769 * r13771;
        double r13773 = v;
        double r13774 = r13772 / r13773;
        double r13775 = r13774 - r13770;
        double r13776 = r13775 * r13771;
        return r13776;
}
↓
double f(double m, double v) {
        double r13777 = 1.0;
        double r13778 = v;
        double r13779 = m;
        double r13780 = 1.0;
        double r13781 = r13780 - r13779;
        double r13782 = r13779 * r13781;
        double r13783 = r13778 / r13782;
        double r13784 = r13777 / r13783;
        double r13785 = r13784 - r13780;
        double r13786 = r13785 * r13781;
        return r13786;
}

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. 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 \left(1 - m\right)\]

  4. Final simplification0.2

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

Reproduce

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