Average Error: 0.0 → 0.0
Time: 810.0ms
Precision: binary64
\[\frac{range}{len} - 1 \cdot f\]
↓
\[\frac{range}{len} - 1 \cdot f\]
\frac{range}{len} - 1 \cdot f
↓
\frac{range}{len} - 1 \cdot f
double code(double range, double len, double f) {
	return ((double) (((double) (range / len)) - ((double) (1.0 * f))));
}
↓
double code(double range, double len, double f) {
	return ((double) (((double) (range / len)) - ((double) (1.0 * f))));
}

Error

Bits error versus range

Bits error versus len

Bits error versus f

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{range}{len} - 1 \cdot f\]

  2. Final simplification0.0

    \[\leadsto \frac{range}{len} - 1 \cdot f\]

Reproduce

herbie shell --seed 2020152 
(FPCore (range len f)
  :name "(- (/ range len) (* 1.0 f))"
  :precision binary64
  (- (/ range len) (* 1.0 f)))