Average Error: 38.6 → 38.6
Time: 684.0ms
Precision: binary64
Cost: 576
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
\left(x + 1\right) \cdot \left(x + 1\right) - 1
(FPCore (x) :precision binary64 (- (* (+ x 1.0) (+ x 1.0)) 1.0))
↓
(FPCore (x) :precision binary64 (- (* (+ x 1.0) (+ x 1.0)) 1.0))
double code(double x) {
	return ((x + 1.0) * (x + 1.0)) - 1.0;
}
↓
double code(double x) {
	return ((x + 1.0) * (x + 1.0)) - 1.0;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.6

    \[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]

Reproduce

herbie shell --seed 2021044 
(FPCore (x)
  :name "Expanding a square"
  :precision binary64
  (- (* (+ x 1.0) (+ x 1.0)) 1.0))