Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[\frac{x}{y \cdot 2}\]
↓
\[0.5 \cdot \frac{x}{y}\]
\frac{x}{y \cdot 2}
↓
0.5 \cdot \frac{x}{y}
double f(double x, double y) {
        double r146733 = x;
        double r146734 = y;
        double r146735 = 2.0;
        double r146736 = r146734 * r146735;
        double r146737 = r146733 / r146736;
        return r146737;
}
↓
double f(double x, double y) {
        double r146738 = 0.5;
        double r146739 = x;
        double r146740 = y;
        double r146741 = r146739 / r146740;
        double r146742 = r146738 * r146741;
        return r146742;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{x}{y \cdot 2}\]

  2. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{0.5 \cdot \frac{x}{y}}\]

  3. Final simplification0.0

    \[\leadsto 0.5 \cdot \frac{x}{y}\]

Reproduce

herbie shell --seed 2019235 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, C"
  :precision binary64
  (/ x (* y 2)))