Average Error: 0.0 → 0.0
Time: 830.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 r63226 = x;
        double r63227 = 1.0;
        double r63228 = 0.5;
        double r63229 = r63226 * r63228;
        double r63230 = r63227 - r63229;
        double r63231 = r63226 * r63230;
        return r63231;
}
↓
double f(double x) {
        double r63232 = x;
        double r63233 = 1.0;
        double r63234 = 0.5;
        double r63235 = r63232 * r63234;
        double r63236 = r63233 - r63235;
        double r63237 = r63232 * r63236;
        return r63237;
}

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