Average Error: 39.2 → 0.0
Time: 2.0s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[x \cdot 2 + {x}^{2}\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot 2 + {x}^{2}
double f(double x) {
        double r4835 = x;
        double r4836 = 1.0;
        double r4837 = r4835 + r4836;
        double r4838 = r4837 * r4837;
        double r4839 = r4838 - r4836;
        return r4839;
}
↓
double f(double x) {
        double r4840 = x;
        double r4841 = 2.0;
        double r4842 = r4840 * r4841;
        double r4843 = 2.0;
        double r4844 = pow(r4840, r4843);
        double r4845 = r4842 + r4844;
        return r4845;
}

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(2 + x\right)}\]
  4. Using strategy rm

  5. Applied distribute-lft-in0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

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