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 r55284 = x;
        double r55285 = 1.0;
        double r55286 = 0.5;
        double r55287 = r55284 * r55286;
        double r55288 = r55285 - r55287;
        double r55289 = r55284 * r55288;
        return r55289;
}
↓
double f(double x) {
        double r55290 = x;
        double r55291 = 1.0;
        double r55292 = 0.5;
        double r55293 = r55290 * r55292;
        double r55294 = r55291 - r55293;
        double r55295 = r55290 * r55294;
        return r55295;
}

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