Average Error: 0.2 → 0.2
Time: 3.4s
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) (1.0 * ((double) (((double) (m * ((double) (m / v)))) - m)))) - ((double) (((double) (m / v)) * ((double) (m * m))))));
}

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 associate-/l*0.2
    \[\leadsto \]
  4. Taylor expanded around 0 7.1
    \[\leadsto \]
  5. Simplified0.2
    \[\leadsto \]
  6. Using strategy rm
  7. Applied *-un-lft-identity0.2
    \[\leadsto \]
  8. Applied add-cube-cbrt0.5
    \[\leadsto \]
  9. Applied unpow-prod-down0.5
    \[\leadsto \]
  10. Applied times-frac0.5
    \[\leadsto \]
  11. Simplified0.3
    \[\leadsto \]
  12. Simplified0.2
    \[\leadsto \]
  13. Final simplification0.2
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(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))