Average Error: 0.0 → 0.0
Time: 397.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 r56386 = x;
        double r56387 = 1.0;
        double r56388 = 0.5;
        double r56389 = r56386 * r56388;
        double r56390 = r56387 - r56389;
        double r56391 = r56386 * r56390;
        return r56391;
}
↓
double f(double x) {
        double r56392 = x;
        double r56393 = 1.0;
        double r56394 = 0.5;
        double r56395 = r56392 * r56394;
        double r56396 = r56393 - r56395;
        double r56397 = r56392 * r56396;
        return r56397;
}

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