Average Error: 39.5 → 0.0
Time: 6.1s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[x \cdot \left(2 + x\right)\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot \left(2 + x\right)
double f(double x) {
        double r11275 = x;
        double r11276 = 1.0;
        double r11277 = r11275 + r11276;
        double r11278 = r11277 * r11277;
        double r11279 = r11278 - r11276;
        return r11279;
}
↓
double f(double x) {
        double r11280 = x;
        double r11281 = 2.0;
        double r11282 = r11281 + r11280;
        double r11283 = r11280 * r11282;
        return r11283;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.5

    \[\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(2 + x\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019305 +o rules:numerics
(FPCore (x)
  :name "Expanding a square"
  :precision binary64
  (- (* (+ x 1) (+ x 1)) 1))