Average Error: 0.0 → 0.0
Time: 4.5s
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 r42389 = x;
        double r42390 = 1.0;
        double r42391 = 0.5;
        double r42392 = r42389 * r42391;
        double r42393 = r42390 - r42392;
        double r42394 = r42389 * r42393;
        return r42394;
}
↓
double f(double x) {
        double r42395 = x;
        double r42396 = 1.0;
        double r42397 = 0.5;
        double r42398 = r42395 * r42397;
        double r42399 = r42396 - r42398;
        double r42400 = r42395 * r42399;
        return r42400;
}

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