Average Error: 0.0 → 0.0
Time: 1.1s
Precision: binary64
\[py + m \cdot \left(x - px\right)\]
↓
\[py + m \cdot \left(x - px\right)\]
py + m \cdot \left(x - px\right)
↓
py + m \cdot \left(x - px\right)
double code(double py, double m, double x, double px) {
	return ((double) (py + ((double) (m * ((double) (x - px))))));
}
↓
double code(double py, double m, double x, double px) {
	return ((double) (py + ((double) (m * ((double) (x - px))))));
}

Error

Bits error versus py

Bits error versus m

Bits error versus x

Bits error versus px

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[py + m \cdot \left(x - px\right)\]

  2. Final simplification0.0

    \[\leadsto py + m \cdot \left(x - px\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (py m x px)
  :name "(+ py (* m (- x px)))"
  :precision binary64
  (+ py (* m (- x px))))