Average Error: 0.0 → 0.0
Time: 3.1s
Precision: binary64
\[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}\]
↓
\[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(\left(\sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}} \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right) \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}\]
1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}
↓
1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(\left(\sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}} \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right) \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}
double code(double t) {
	return ((double) (1.0 - ((double) (1.0 / ((double) (2.0 + ((double) (((double) (2.0 - ((double) (((double) (2.0 / t)) / ((double) (1.0 + ((double) (1.0 / t)))))))) * ((double) (2.0 - ((double) (((double) (2.0 / t)) / ((double) (1.0 + ((double) (1.0 / t))))))))))))))));
}
↓
double code(double t) {
	return ((double) (1.0 - ((double) (1.0 / ((double) (2.0 + ((double) (((double) (2.0 - ((double) (((double) (2.0 / t)) / ((double) (1.0 + ((double) (1.0 / t)))))))) * ((double) (((double) (((double) cbrt(((double) (2.0 - ((double) (((double) (2.0 / t)) / ((double) (1.0 + ((double) (1.0 / t)))))))))) * ((double) cbrt(((double) (2.0 - ((double) (((double) (2.0 / t)) / ((double) (1.0 + ((double) (1.0 / t)))))))))))) * ((double) cbrt(((double) (2.0 - ((double) (((double) (2.0 / t)) / ((double) (1.0 + ((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

    \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}\]
  2. Using strategy rm

  3. Applied add-cube-cbrt0.0

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\left(\left(\sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}} \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right) \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}}\]

  4. Final simplification0.0

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(\left(\sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}} \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right) \cdot \sqrt[3]{2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}\]

Reproduce

herbie shell --seed 2020174 
(FPCore (t)
  :name "Kahan p13 Example 3"
  :precision binary64
  (- 1.0 (/ 1.0 (+ 2.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))))))))