Average Error: 0.2 → 0.2
Time: 3.7s
Precision: binary64
\[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\]
↓
\[m \cdot \left(m \cdot \frac{1 - m}{v} - 1\right)\]
\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m
↓
m \cdot \left(m \cdot \frac{1 - m}{v} - 1\right)
double code(double m, double v) {
	return ((double) (((double) ((((double) (m * ((double) (1.0 - m)))) / v) - 1.0)) * m));
}
↓
double code(double m, double v) {
	return ((double) (m * ((double) (((double) (m * (((double) (1.0 - m)) / v))) - 1.0))));
}

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. Simplified0.2

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

  3. Final simplification0.2

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

Reproduce

herbie shell --seed 2020182 
(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.0 m)) v) 1.0) m))