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 r44742 = x;
        double r44743 = r44742 * r44742;
        double r44744 = 2.0;
        double r44745 = r44743 * r44744;
        double r44746 = 1.0;
        double r44747 = r44745 - r44746;
        return r44747;
}
↓
double f(double x) {
        double r44748 = x;
        double r44749 = r44748 * r44748;
        double r44750 = 2.0;
        double r44751 = r44749 * r44750;
        double r44752 = 1.0;
        double r44753 = r44751 - r44752;
        return r44753;
}

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