Average Error: 0.0 → 0.0
Time: 2.9s
Precision: 64
\[x - \frac{2.30753 + x \cdot 0.27061000000000002}{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}\]
↓
\[x - \frac{1}{\frac{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}{2.30753 + x \cdot 0.27061000000000002}}\]
x - \frac{2.30753 + x \cdot 0.27061000000000002}{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}
↓
x - \frac{1}{\frac{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}{2.30753 + x \cdot 0.27061000000000002}}
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) (1.0 / ((double) (((double) (1.0 + ((double) (((double) (0.99229 + ((double) (x * 0.04481)))) * x)))) / ((double) (2.30753 + ((double) (x * 0.27061))))))))));
}

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

    \[x - \frac{2.30753 + x \cdot 0.27061000000000002}{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}\]
  2. Using strategy rm

  3. Applied clear-num0.0

    \[\leadsto x - \color{blue}{\frac{1}{\frac{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}{2.30753 + x \cdot 0.27061000000000002}}}\]

  4. Final simplification0.0

    \[\leadsto x - \frac{1}{\frac{1 + \left(0.992290000000000005 + x \cdot 0.044810000000000003\right) \cdot x}{2.30753 + x \cdot 0.27061000000000002}}\]

Reproduce

herbie shell --seed 2020124 
(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)))))