Average Error: 0.0 → 0.0
Time: 890.0ms
Precision: binary64
\[a + 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)
double code(double a, double t, double b) {
	return ((double) (a + ((double) (t * ((double) (b - a))))));
}
↓
double code(double a, double t, double b) {
	return ((double) (a + ((double) (t * ((double) (b - a))))));
}

Error

Bits error versus a

Bits error versus t

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

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