Average Error: 0.0 → 0.0
Time: 2.8s
Precision: 64
\[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 + \sqrt[3]{{\left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}^{6}}}\]
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 + \sqrt[3]{{\left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}^{6}}}
double code(double t) {
	return (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))))))));
}
↓
double code(double t) {
	return (1.0 - (1.0 / (2.0 + cbrt(pow((2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))), 6.0)))));
}

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-cbrt-cube0.0

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

  4. Applied add-cbrt-cube0.0

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

  5. Applied cbrt-unprod0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

herbie shell --seed 2020053 
(FPCore (t)
  :name "Kahan p13 Example 3"
  :precision binary64
  (- 1 (/ 1 (+ 2 (* (- 2 (/ (/ 2 t) (+ 1 (/ 1 t)))) (- 2 (/ (/ 2 t) (+ 1 (/ 1 t)))))))))