Average Error: 14.9 → 0.1
Time: 2.5s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (((double) (1.0 / ((double) (x + 1.0)))) - ((double) (1.0 / ((double) (x - 1.0))))));
}

↓
double code(double x) {
	return ((double) (((double) (((double) (1.0 / ((double) (1.0 + x)))) * ((double) (1.0 * -2.0)))) / ((double) (x - 1.0))));
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 14.9
    \[\]
  2. Using strategy rm
  3. Applied frac-sub14.4
    \[\leadsto \]
  4. Simplified0.4
    \[\leadsto \]
  5. Simplified0.4
    \[\leadsto \]
  6. Using strategy rm
  7. Applied difference-of-squares0.4
    \[\leadsto \]
  8. Applied associate-/r*0.1
    \[\leadsto \]
  9. Simplified0.1
    \[\leadsto \]
  10. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x)
  :name "Asymptote A"
  :precision binary64
  (- (/ 1.0 (+ x 1.0)) (/ 1.0 (- x 1.0))))