Average Error: 0.0 → 0.0
Time: 1.2s
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 r140834 = x;
        double r140835 = y;
        double r140836 = 2.0;
        double r140837 = r140835 * r140836;
        double r140838 = r140834 / r140837;
        return r140838;
}
↓
double f(double x, double y) {
        double r140839 = 0.5;
        double r140840 = x;
        double r140841 = y;
        double r140842 = r140840 / r140841;
        double r140843 = r140839 * r140842;
        return r140843;
}

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 2019308 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, C"
  :precision binary64
  (/ x (* y 2)))