Average Error: 0.1 → 0.1
Time: 4.3s
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 r80413 = 1.0;
        double r80414 = x;
        double r80415 = 0.253;
        double r80416 = 0.12;
        double r80417 = r80414 * r80416;
        double r80418 = r80415 + r80417;
        double r80419 = r80414 * r80418;
        double r80420 = r80413 - r80419;
        return r80420;
}
↓
double f(double x) {
        double r80421 = 1.0;
        double r80422 = x;
        double r80423 = 0.253;
        double r80424 = 0.12;
        double r80425 = r80422 * r80424;
        double r80426 = r80423 + r80425;
        double r80427 = r80422 * r80426;
        double r80428 = r80421 - r80427;
        return r80428;
}

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