Average Error: 0.0 → 0.0
Time: 1.6s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (x - ((double) (((double) (2.30753 + ((double) (x * 0.27061)))) / ((double) (1.0 + ((double) (((double) (0.99229 + ((double) (x * 0.04481)))) * x))))))));
}

↓
double code(double x) {
	return ((double) (x - ((double) (((double) (2.30753 + ((double) (x * 0.27061)))) / ((double) (1.0 + ((double) cbrt(((double) (((double) pow(x, 3.0)) * ((double) pow(((double) (0.99229 + ((double) (x * 0.04481)))), 3.0))))))))))));
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Using strategy rm
  3. Applied add-cbrt-cube0.0
    \[\leadsto \]
  4. Applied add-cbrt-cube0.0
    \[\leadsto \]
  5. Applied cbrt-unprod0.0
    \[\leadsto \]
  6. Simplified0.0
    \[\leadsto \]
  7. Using strategy rm
  8. Applied unpow-prod-down0.0
    \[\leadsto \]
  9. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, D"
  :precision binary64
  (- x (/ (+ 2.30753 (* x 0.27061)) (+ 1.0 (* (+ 0.99229 (* x 0.04481)) x)))))