Average Error: 39.2 → 0.0
Time: 6.2s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[x \cdot \left(x + 2\right)\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot \left(x + 2\right)
double f(double x) {
        double r24568 = x;
        double r24569 = 1.0;
        double r24570 = r24568 + r24569;
        double r24571 = r24570 * r24570;
        double r24572 = r24571 - r24569;
        return r24572;
}
↓
double f(double x) {
        double r24573 = x;
        double r24574 = 2.0;
        double r24575 = r24573 + r24574;
        double r24576 = r24573 * r24575;
        return r24576;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.2

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

  2. Taylor expanded around 0 0.0

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

  3. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(x + 2\right)}\]

  4. Final simplification0.0

    \[\leadsto x \cdot \left(x + 2\right)\]

Reproduce

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