Average Error: 0.1 → 0.1
Time: 3.4s
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 r92959 = 1.0;
        double r92960 = x;
        double r92961 = 0.253;
        double r92962 = 0.12;
        double r92963 = r92960 * r92962;
        double r92964 = r92961 + r92963;
        double r92965 = r92960 * r92964;
        double r92966 = r92959 - r92965;
        return r92966;
}
↓
double f(double x) {
        double r92967 = 1.0;
        double r92968 = x;
        double r92969 = 0.253;
        double r92970 = 0.12;
        double r92971 = r92968 * r92970;
        double r92972 = r92969 + r92971;
        double r92973 = r92968 * r92972;
        double r92974 = r92967 - r92973;
        return r92974;
}

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 2020027 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  :precision binary64
  (- 1 (* x (+ 0.253 (* x 0.12)))))