Average Error: 0.0 → 0.0
Time: 893.0ms
Precision: 64
\[x \cdot \left(1 - x \cdot 0.5\right)\]
↓
\[x \cdot \left(1 - x \cdot 0.5\right)\]
x \cdot \left(1 - x \cdot 0.5\right)
↓
x \cdot \left(1 - x \cdot 0.5\right)
double f(double x) {
        double r60762 = x;
        double r60763 = 1.0;
        double r60764 = 0.5;
        double r60765 = r60762 * r60764;
        double r60766 = r60763 - r60765;
        double r60767 = r60762 * r60766;
        return r60767;
}
↓
double f(double x) {
        double r60768 = x;
        double r60769 = 1.0;
        double r60770 = 0.5;
        double r60771 = r60768 * r60770;
        double r60772 = r60769 - r60771;
        double r60773 = r60768 * r60772;
        return r60773;
}

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

    \[x \cdot \left(1 - x \cdot 0.5\right)\]

  2. Final simplification0.0

    \[\leadsto x \cdot \left(1 - x \cdot 0.5\right)\]

Reproduce

herbie shell --seed 2019352 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))