Average Error: 0 → 0
Time: 567.0ms
Precision: binary64
\[\frac{x}{y \cdot 2}\]
↓
\[\frac{x}{y \cdot 2}\]
\frac{x}{y \cdot 2}
↓
\frac{x}{y \cdot 2}
(FPCore (x y) :precision binary64 (/ x (* y 2.0)))
↓
(FPCore (x y) :precision binary64 (/ x (* y 2.0)))
double code(double x, double y) {
	return (x / ((double) (y * 2.0)));
}
↓
double code(double x, double y) {
	return (x / ((double) (y * 2.0)));
}

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 Error: 0 bits

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

  2. Final simplificationError: 0 bits

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

Reproduce

herbie shell --seed 2020204 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, C"
  :precision binary64
  (/ x (* y 2.0)))