Average Error: 0.0 → 0.0
Time: 7.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 r59532 = x;
        double r59533 = 1.0;
        double r59534 = 0.5;
        double r59535 = r59532 * r59534;
        double r59536 = r59533 - r59535;
        double r59537 = r59532 * r59536;
        return r59537;
}
↓
double f(double x) {
        double r59538 = x;
        double r59539 = 1.0;
        double r59540 = 0.5;
        double r59541 = r59538 * r59540;
        double r59542 = r59539 - r59541;
        double r59543 = r59538 * r59542;
        return r59543;
}

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