Average Error: 0.1 → 0.1
Time: 582.0ms
Precision: binary64
\[1 + \left(0.278393 + 0.23038900000000001 \cdot x\right) \cdot x\]
↓
\[1 + \left(0.278393 + 0.23038900000000001 \cdot x\right) \cdot x\]
1 + \left(0.278393 + 0.23038900000000001 \cdot x\right) \cdot x
↓
1 + \left(0.278393 + 0.23038900000000001 \cdot x\right) \cdot x
double code(double x) {
	return ((double) (1.0 + ((double) (((double) (0.278393 + ((double) (0.230389 * x)))) * x))));
}
↓
double code(double x) {
	return ((double) (1.0 + ((double) (((double) (0.278393 + ((double) (0.230389 * x)))) * x))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[1 + \left(0.278393 + 0.23038900000000001 \cdot x\right) \cdot x\]

  2. Final simplification0.1

    \[\leadsto 1 + \left(0.278393 + 0.23038900000000001 \cdot x\right) \cdot x\]

Reproduce

herbie shell --seed 2020153 
(FPCore (x)
  :name "(+ 1 (* (+ 0.278393 (* 0.230389 x)) x))"
  :precision binary64
  (+ 1.0 (* (+ 0.278393 (* 0.230389 x)) x)))