Average Error: 0.0 → 0.0
Time: 4.2s
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 r37853 = x;
        double r37854 = 1.0;
        double r37855 = 0.5;
        double r37856 = r37853 * r37855;
        double r37857 = r37854 - r37856;
        double r37858 = r37853 * r37857;
        return r37858;
}
↓
double f(double x) {
        double r37859 = x;
        double r37860 = 1.0;
        double r37861 = 0.5;
        double r37862 = r37859 * r37861;
        double r37863 = r37860 - r37862;
        double r37864 = r37859 * r37863;
        return r37864;
}

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