Average Error: 0.0 → 0.0
Time: 855.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 r60379 = x;
        double r60380 = 1.0;
        double r60381 = 0.5;
        double r60382 = r60379 * r60381;
        double r60383 = r60380 - r60382;
        double r60384 = r60379 * r60383;
        return r60384;
}
↓
double f(double x) {
        double r60385 = x;
        double r60386 = 1.0;
        double r60387 = 0.5;
        double r60388 = r60385 * r60387;
        double r60389 = r60386 - r60388;
        double r60390 = r60385 * r60389;
        return r60390;
}

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