Average Error: 6.3 → 6.3
Time: 1.3s
Precision: binary64
\[left + i \cdot \frac{left - right}{count}\]
↓
\[left + i \cdot \frac{left - right}{count}\]
left + i \cdot \frac{left - right}{count}
↓
left + i \cdot \frac{left - right}{count}
double code(double left, double i, double right, double count) {
	return ((double) (left + ((double) (i * ((double) (((double) (left - right)) / count))))));
}
↓
double code(double left, double i, double right, double count) {
	return ((double) (left + ((double) (i * ((double) (((double) (left - right)) / count))))));
}

Error

Bits error versus left

Bits error versus i

Bits error versus right

Bits error versus count

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 6.3

    \[left + i \cdot \frac{left - right}{count}\]

  2. Final simplification6.3

    \[\leadsto left + i \cdot \frac{left - right}{count}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (left i right count)
  :name "(+ left (* i (/ (- left right) count)))"
  :precision binary64
  (+ left (* i (/ (- left right) count))))