Average Error: 0.2 → 0.2
Time: 26.0s
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 r55723 = m;
        double r55724 = 1.0;
        double r55725 = r55724 - r55723;
        double r55726 = r55723 * r55725;
        double r55727 = v;
        double r55728 = r55726 / r55727;
        double r55729 = r55728 - r55724;
        double r55730 = r55729 * r55723;
        return r55730;
}
↓
double f(double m, double v) {
        double r55731 = 1.0;
        double r55732 = v;
        double r55733 = m;
        double r55734 = 1.0;
        double r55735 = r55734 - r55733;
        double r55736 = r55733 * r55735;
        double r55737 = r55732 / r55736;
        double r55738 = r55731 / r55737;
        double r55739 = r55738 - r55734;
        double r55740 = r55739 * r55733;
        return r55740;
}

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 2020042 +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))