Average Error: 0.0 → 0.0
Time: 2.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 r35822 = x;
        double r35823 = r35822 * r35822;
        double r35824 = 2.0;
        double r35825 = r35823 * r35824;
        double r35826 = 1.0;
        double r35827 = r35825 - r35826;
        return r35827;
}
↓
double f(double x) {
        double r35828 = x;
        double r35829 = r35828 * r35828;
        double r35830 = 2.0;
        double r35831 = r35829 * r35830;
        double r35832 = 1.0;
        double r35833 = r35831 - r35832;
        return r35833;
}

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