Average Error: 0.0 → 0.0
Time: 2.3s
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[2 \cdot \left(x \cdot x\right) - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
2 \cdot \left(x \cdot x\right) - 1
double f(double x) {
        double r2506766 = x;
        double r2506767 = r2506766 * r2506766;
        double r2506768 = 2.0;
        double r2506769 = r2506767 * r2506768;
        double r2506770 = 1.0;
        double r2506771 = r2506769 - r2506770;
        return r2506771;
}
↓
double f(double x) {
        double r2506772 = 2.0;
        double r2506773 = x;
        double r2506774 = r2506773 * r2506773;
        double r2506775 = r2506772 * r2506774;
        double r2506776 = 1.0;
        double r2506777 = r2506775 - r2506776;
        return r2506777;
}

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 2 \cdot \left(x \cdot x\right) - 1\]

Reproduce

herbie shell --seed 2019169 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  (- (* (* x x) 2.0) 1.0))