Average Error: 16.2 → 16.2
Time: 1.3s
Precision: binary64
\[\frac{\left(8 \cdot m\right) \cdot n}{{r}^{2}}\]
↓
\[\frac{\left(8 \cdot m\right) \cdot n}{{r}^{2}}\]
\frac{\left(8 \cdot m\right) \cdot n}{{r}^{2}}
↓
\frac{\left(8 \cdot m\right) \cdot n}{{r}^{2}}
double code(double m, double n, double r) {
	return ((double) (((double) (((double) (8.0 * m)) * n)) / ((double) pow(r, 2.0))));
}
↓
double code(double m, double n, double r) {
	return ((double) (((double) (((double) (8.0 * m)) * n)) / ((double) pow(r, 2.0))));
}

Error

Bits error versus m

Bits error versus n

Bits error versus r

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 16.2

    \[\frac{\left(8 \cdot m\right) \cdot n}{{r}^{2}}\]

  2. Final simplification16.2

    \[\leadsto \frac{\left(8 \cdot m\right) \cdot n}{{r}^{2}}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (m n r)
  :name "(/ (* (* 8 m) n) (pow r 2))"
  :precision binary64
  (/ (* (* 8.0 m) n) (pow r 2.0)))