Average Error: 39.2 → 0.0
Time: 19.1s
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 r11533 = x;
        double r11534 = 1.0;
        double r11535 = r11533 + r11534;
        double r11536 = r11535 * r11535;
        double r11537 = r11536 - r11534;
        return r11537;
}
↓
double f(double x) {
        double r11538 = x;
        double r11539 = 2.0;
        double r11540 = r11538 + r11539;
        double r11541 = r11538 * r11540;
        return r11541;
}

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 2019304 
(FPCore (x)
  :name "Expanding a square"
  :precision binary64
  (- (* (+ x 1) (+ x 1)) 1))