Average Error: 39.4 → 0.0
Time: 8.0s
Precision: binary64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[{x}^{2} + 2 \cdot x\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
{x}^{2} + 2 \cdot x
double code(double x) {
	return ((double) (((double) (((double) (x + 1.0)) * ((double) (x + 1.0)))) - 1.0));
}
↓
double code(double x) {
	return ((double) (((double) pow(x, 2.0)) + ((double) (2.0 * x))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.4

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

  2. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{2 \cdot x + {x}^{2}}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(x + 2\right)}\]
  4. Using strategy rm

  5. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot x + x \cdot 2}\]

  6. Simplified0.0

    \[\leadsto \color{blue}{{x}^{2}} + x \cdot 2\]

  7. Simplified0.0

    \[\leadsto {x}^{2} + \color{blue}{2 \cdot x}\]

  8. Final simplification0.0

    \[\leadsto {x}^{2} + 2 \cdot x\]

Reproduce

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