Average Error: 0.0 → 0.0
Time: 871.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 r62658 = x;
        double r62659 = 1.0;
        double r62660 = 0.5;
        double r62661 = r62658 * r62660;
        double r62662 = r62659 - r62661;
        double r62663 = r62658 * r62662;
        return r62663;
}
↓
double f(double x) {
        double r62664 = x;
        double r62665 = 1.0;
        double r62666 = 0.5;
        double r62667 = r62664 * r62666;
        double r62668 = r62665 - r62667;
        double r62669 = r62664 * r62668;
        return r62669;
}

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