Average Error: 0.0 → 0.0
Time: 712.0ms
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 r27894 = x;
        double r27895 = r27894 * r27894;
        double r27896 = 2.0;
        double r27897 = r27895 * r27896;
        double r27898 = 1.0;
        double r27899 = r27897 - r27898;
        return r27899;
}
↓
double f(double x) {
        double r27900 = x;
        double r27901 = r27900 * r27900;
        double r27902 = 2.0;
        double r27903 = r27901 * r27902;
        double r27904 = 1.0;
        double r27905 = r27903 - r27904;
        return r27905;
}

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