Average Error: 0.0 → 0.0
Time: 1.3s
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 r63359 = x;
        double r63360 = 1.0;
        double r63361 = 0.5;
        double r63362 = r63359 * r63361;
        double r63363 = r63360 - r63362;
        double r63364 = r63359 * r63363;
        return r63364;
}
↓
double f(double x) {
        double r63365 = x;
        double r63366 = 1.0;
        double r63367 = 0.5;
        double r63368 = r63365 * r63367;
        double r63369 = r63366 - r63368;
        double r63370 = r63365 * r63369;
        return r63370;
}

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