Average Error: 0.0 → 0.0
Time: 5.4s
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 r42949 = x;
        double r42950 = 1.0;
        double r42951 = 0.5;
        double r42952 = r42949 * r42951;
        double r42953 = r42950 - r42952;
        double r42954 = r42949 * r42953;
        return r42954;
}
↓
double f(double x) {
        double r42955 = x;
        double r42956 = 1.0;
        double r42957 = 0.5;
        double r42958 = r42955 * r42957;
        double r42959 = r42956 - r42958;
        double r42960 = r42955 * r42959;
        return r42960;
}

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