Average Error: 0.1 → 0.1
Time: 3.8s
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 r79661 = 1.0;
        double r79662 = x;
        double r79663 = 0.253;
        double r79664 = 0.12;
        double r79665 = r79662 * r79664;
        double r79666 = r79663 + r79665;
        double r79667 = r79662 * r79666;
        double r79668 = r79661 - r79667;
        return r79668;
}
↓
double f(double x) {
        double r79669 = 1.0;
        double r79670 = x;
        double r79671 = 0.253;
        double r79672 = 0.12;
        double r79673 = r79670 * r79672;
        double r79674 = r79671 + r79673;
        double r79675 = r79670 * r79674;
        double r79676 = r79669 - r79675;
        return r79676;
}

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)))))