Average Error: 0.5 → 0.3
Time: 4.6s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double v, double t) {
	return ((double) (((double) (1.0 - ((double) (5.0 * ((double) (v * v)))))) / ((double) (((double) (((double) (((double) M_PI) * t)) * ((double) sqrt(((double) (2.0 * ((double) (1.0 - ((double) (3.0 * ((double) (v * v)))))))))))) * ((double) (1.0 - ((double) (v * v))))))));
}

↓
double code(double v, double t) {
	return ((double) (((double) (((double) (((double) (1.0 - ((double) (v * ((double) (v * 5.0)))))) / ((double) M_PI))) / ((double) (t * ((double) (((double) sqrt(((double) (2.0 * ((double) (1.0 - ((double) (3.0 * ((double) (v * v)))))))))) * ((double) (((double) (1.0 * 1.0)) - ((double) pow(v, 4.0)))))))))) * ((double) (1.0 + ((double) (v * v))))));
}

Error
Bits error versus v
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.5
    \[\]
  2. Using strategy rm
  3. Applied flip--0.5
    \[\leadsto \]
  4. Applied associate-*r/0.5
    \[\leadsto \]
  5. Applied associate-/r/0.5
    \[\leadsto \]
  6. Simplified0.5
    \[\leadsto \]
  7. Using strategy rm
  8. Applied associate-/r*0.3
    \[\leadsto \]
  9. Final simplification0.3
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (v t)
  :name "Falkner and Boettcher, Equation (20:1,3)"
  :precision binary64
  (/ (- 1.0 (* 5.0 (* v v))) (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))