Average Error: 0.0 → 0.0
Time: 1.3s
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 r39765 = x;
        double r39766 = r39765 * r39765;
        double r39767 = 2.0;
        double r39768 = r39766 * r39767;
        double r39769 = 1.0;
        double r39770 = r39768 - r39769;
        return r39770;
}
↓
double f(double x) {
        double r39771 = x;
        double r39772 = r39771 * r39771;
        double r39773 = 2.0;
        double r39774 = r39772 * r39773;
        double r39775 = 1.0;
        double r39776 = r39774 - r39775;
        return r39776;
}

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 2020100 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))