Average Error: 0.0 → 0.0
Time: 2.6s
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 r72422 = x;
        double r72423 = 1.0;
        double r72424 = 0.5;
        double r72425 = r72422 * r72424;
        double r72426 = r72423 - r72425;
        double r72427 = r72422 * r72426;
        return r72427;
}
↓
double f(double x) {
        double r72428 = x;
        double r72429 = 1.0;
        double r72430 = 0.5;
        double r72431 = r72428 * r72430;
        double r72432 = r72429 - r72431;
        double r72433 = r72428 * r72432;
        return r72433;
}

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 2020047 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1 (* x 0.5))))