Average Error: 0.2 → 0.2
Time: 2.9s
Precision: binary64
\[\]
\[\]
↓
\[\]
↓
double code(double m, double v) {
	return ((double) (((double) (((double) (((double) (m * ((double) (1.0 - m)))) / v)) - 1.0)) * m));
}

↓
double code(double m, double v) {
	return ((double) (((double) (((double) (m * ((double) (m / v)))) * ((double) (1.0 - m)))) - ((double) (m * 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
    \[\]
  2. Using strategy rm
  3. Applied clear-num0.2
    \[\leadsto \]
  4. Taylor expanded around 0 7.0
    \[\leadsto \]
  5. Simplified0.2
    \[\leadsto \]
  6. Taylor expanded around 0 7.0
    \[\leadsto \]
  7. Simplified0.2
    \[\leadsto \]
  8. Final simplification0.2
    \[\leadsto \]
Reproduce
herbie shell --seed 2020190 
(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))