Average Error: 46.0 → 0.2
Time: 1.8s
Precision: binary64
\[\]
\[\]
↓
\[\]
↓
double code(double i) {
	return ((double) (((double) (((double) (((double) (i * i)) * ((double) (i * i)))) / ((double) (((double) (2.0 * i)) * ((double) (2.0 * i)))))) / ((double) (((double) (((double) (2.0 * i)) * ((double) (2.0 * i)))) - 1.0))));
}

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

Error
Bits error versus i
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 46.0
    \[\]
  2. Simplified0.2
    \[\leadsto \]
  3. Using strategy rm
  4. Applied associate-/r*0.2
    \[\leadsto \]
  5. Final simplification0.2
    \[\leadsto \]
Reproduce
herbie shell --seed 2020179 
(FPCore (i)
  :name "Octave 3.8, jcobi/4, as called"
  :precision binary64
  :pre (and (> i 0.0))
  (/ (/ (* (* i i) (* i i)) (* (* 2.0 i) (* 2.0 i))) (- (* (* 2.0 i) (* 2.0 i)) 1.0)))