Average Error: 0.0 → 0.0
Time: 4.5s
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 r35029 = x;
        double r35030 = r35029 * r35029;
        double r35031 = 2.0;
        double r35032 = r35030 * r35031;
        double r35033 = 1.0;
        double r35034 = r35032 - r35033;
        return r35034;
}
↓
double f(double x) {
        double r35035 = x;
        double r35036 = r35035 * r35035;
        double r35037 = 2.0;
        double r35038 = r35036 * r35037;
        double r35039 = 1.0;
        double r35040 = r35038 - r35039;
        return r35040;
}

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