Average Error: 0.0 → 0.0
Time: 1.2s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double t) {
	return ((double) (((double) (1.0 + ((double) (((double) (((double) (2.0 * t)) / ((double) (1.0 + t)))) * ((double) (((double) (2.0 * t)) / ((double) (1.0 + t)))))))) / ((double) (2.0 + ((double) (((double) (((double) (2.0 * t)) / ((double) (1.0 + t)))) * ((double) (((double) (2.0 * t)) / ((double) (1.0 + t))))))))));
}

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

Error
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (t)
  :name "Kahan p13 Example 1"
  :precision binary64
  (/ (+ 1.0 (* (/ (* 2.0 t) (+ 1.0 t)) (/ (* 2.0 t) (+ 1.0 t)))) (+ 2.0 (* (/ (* 2.0 t) (+ 1.0 t)) (/ (* 2.0 t) (+ 1.0 t))))))