Average Error: 0.0 → 0.0
Time: 893.0ms
Precision: binary64
\[t \cdot \left(b - a\right) + a\]
↓
\[t \cdot \left(b - a\right) + a\]
t \cdot \left(b - a\right) + a
↓
t \cdot \left(b - a\right) + a
double code(double t, double b, double a) {
	return ((double) (((double) (t * ((double) (b - a)))) + a));
}
↓
double code(double t, double b, double a) {
	return ((double) (((double) (t * ((double) (b - a)))) + a));
}

Error

Bits error versus t

Bits error versus b

Bits error versus a

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[t \cdot \left(b - a\right) + a\]

  2. Final simplification0.0

    \[\leadsto t \cdot \left(b - a\right) + a\]

Reproduce

herbie shell --seed 2020153 
(FPCore (t b a)
  :name "(+ (* t (- b a)) a)"
  :precision binary64
  (+ (* t (- b a)) a))