Average Error: 0.0 → 0.0
Time: 809.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 r53188 = x;
        double r53189 = 1.0;
        double r53190 = 0.5;
        double r53191 = r53188 * r53190;
        double r53192 = r53189 - r53191;
        double r53193 = r53188 * r53192;
        return r53193;
}
↓
double f(double x) {
        double r53194 = x;
        double r53195 = 1.0;
        double r53196 = 0.5;
        double r53197 = r53194 * r53196;
        double r53198 = r53195 - r53197;
        double r53199 = r53194 * r53198;
        return r53199;
}

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