Average Error: 0.0 → 0.0
Time: 568.0ms
Precision: binary64
\[\frac{2 \cdot x}{N}\]
↓
\[\frac{2 \cdot x}{N}\]
\frac{2 \cdot x}{N}
↓
\frac{2 \cdot x}{N}
double code(double x, double N) {
	return ((double) (((double) (2.0 * x)) / N));
}
↓
double code(double x, double N) {
	return ((double) (((double) (2.0 * x)) / N));
}

Error

Bits error versus x

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020153 
(FPCore (x N)
  :name "(/ (* 2 x) N)"
  :precision binary64
  (/ (* 2.0 x) N))