Average Error: 38.8 → 0.0
Time: 6.7s
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 r582577 = x;
        double r582578 = 1.0;
        double r582579 = r582577 + r582578;
        double r582580 = r582579 * r582579;
        double r582581 = r582580 - r582578;
        return r582581;
}
↓
double f(double x) {
        double r582582 = x;
        double r582583 = 2.0;
        double r582584 = r582583 + r582582;
        double r582585 = r582582 * r582584;
        return r582585;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 38.8

    \[\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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019179 +o rules:numerics
(FPCore (x)
  :name "Expanding a square"
  (- (* (+ x 1.0) (+ x 1.0)) 1.0))