Average Error: 39.3 → 0.0
Time: 3.5s
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 r315903 = x;
        double r315904 = 1.0;
        double r315905 = r315903 + r315904;
        double r315906 = r315905 * r315905;
        double r315907 = r315906 - r315904;
        return r315907;
}
↓
double f(double x) {
        double r315908 = x;
        double r315909 = 2.0;
        double r315910 = r315909 + r315908;
        double r315911 = r315908 * r315910;
        return r315911;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 39.3

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

  4. Final simplification0.0

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

Reproduce

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