Average Error: 0.1 → 0.1
Time: 6.6s
Precision: 64
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1 - x \cdot \left(0.253 + x \cdot 0.12\right)
double f(double x) {
        double r82980 = 1.0;
        double r82981 = x;
        double r82982 = 0.253;
        double r82983 = 0.12;
        double r82984 = r82981 * r82983;
        double r82985 = r82982 + r82984;
        double r82986 = r82981 * r82985;
        double r82987 = r82980 - r82986;
        return r82987;
}
↓
double f(double x) {
        double r82988 = 1.0;
        double r82989 = x;
        double r82990 = 0.253;
        double r82991 = 0.12;
        double r82992 = r82989 * r82991;
        double r82993 = r82990 + r82992;
        double r82994 = r82989 * r82993;
        double r82995 = r82988 - r82994;
        return r82995;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

  2. Final simplification0.1

    \[\leadsto 1 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

Reproduce

herbie shell --seed 2020046 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1 (* x (+ 0.253 (* x 0.12)))))