Average Error: 0.0 → 0.0
Time: 4.9s
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[\left(x \cdot x\right) \cdot 2 - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
\left(x \cdot x\right) \cdot 2 - 1
double f(double x) {
        double r39539 = x;
        double r39540 = r39539 * r39539;
        double r39541 = 2.0;
        double r39542 = r39540 * r39541;
        double r39543 = 1.0;
        double r39544 = r39542 - r39543;
        return r39544;
}
↓
double f(double x) {
        double r39545 = x;
        double r39546 = r39545 * r39545;
        double r39547 = 2.0;
        double r39548 = r39546 * r39547;
        double r39549 = 1.0;
        double r39550 = r39548 - r39549;
        return r39550;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot x\right) \cdot 2 - 1\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot x\right) \cdot 2 - 1\]

Reproduce

herbie shell --seed 2019303 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))