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

Error

Bits error versus r

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(r - b\right) \cdot \left(r + b\right) - 1\]

  2. Final simplification0.0

    \[\leadsto \left(r - b\right) \cdot \left(r + b\right) - 1\]

Reproduce

herbie shell --seed 2020153 
(FPCore (r b)
  :name "(- (* (- r b) (+ r b)) 1)"
  :precision binary64
  (- (* (- r b) (+ r b)) 1.0))