Average Error: 0.0 → 0.0
Time: 392.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 r67743 = x;
        double r67744 = 1.0;
        double r67745 = 0.5;
        double r67746 = r67743 * r67745;
        double r67747 = r67744 - r67746;
        double r67748 = r67743 * r67747;
        return r67748;
}
↓
double f(double x) {
        double r67749 = x;
        double r67750 = 1.0;
        double r67751 = 0.5;
        double r67752 = r67749 * r67751;
        double r67753 = r67750 - r67752;
        double r67754 = r67749 * r67753;
        return r67754;
}

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