Average Error: 0.0 → 0.0
Time: 873.0ms
Precision: binary64
\[\frac{i + 1 \cdot f}{subdivisions}\]
↓
\[\frac{i + 1 \cdot f}{subdivisions}\]
\frac{i + 1 \cdot f}{subdivisions}
↓
\frac{i + 1 \cdot f}{subdivisions}
double code(double i, double f, double subdivisions) {
	return ((double) (((double) (i + ((double) (1.0 * f)))) / subdivisions));
}
↓
double code(double i, double f, double subdivisions) {
	return ((double) (((double) (i + ((double) (1.0 * f)))) / subdivisions));
}

Error

Bits error versus i

Bits error versus f

Bits error versus subdivisions

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{i + 1 \cdot f}{subdivisions}\]

  2. Final simplification0.0

    \[\leadsto \frac{i + 1 \cdot f}{subdivisions}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (i f subdivisions)
  :name "(/ (+ i (* 1 f)) subdivisions)"
  :precision binary64
  (/ (+ i (* 1.0 f)) subdivisions))