Average Error: 0 → 0
Time: 503.0ms
Precision: 64
\[\left(x \cdot 16\right) \cdot x\]
↓
\[\left(x \cdot 16\right) \cdot x\]
\left(x \cdot 16\right) \cdot x
↓
\left(x \cdot 16\right) \cdot x
double f(double x) {
        double r138688 = x;
        double r138689 = 16.0;
        double r138690 = r138688 * r138689;
        double r138691 = r138690 * r138688;
        return r138691;
}
↓
double f(double x) {
        double r138692 = x;
        double r138693 = 16.0;
        double r138694 = r138692 * r138693;
        double r138695 = r138694 * r138692;
        return r138695;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0

    \[\left(x \cdot 16\right) \cdot x\]

  2. Final simplification0

    \[\leadsto \left(x \cdot 16\right) \cdot x\]

Reproduce

herbie shell --seed 2020034 
(FPCore (x)
  :name "Graphics.Rasterific.CubicBezier:isSufficientlyFlat from Rasterific-0.6.1"
  :precision binary64
  (* (* x 16) x))