Average Error: 20.1 → 20.1
Time: 1.1s
Precision: binary64
\[\frac{\left(G \cdot m\right) \cdot M}{r \cdot r}\]
↓
\[\frac{\left(G \cdot m\right) \cdot M}{r \cdot r}\]
\frac{\left(G \cdot m\right) \cdot M}{r \cdot r}
↓
\frac{\left(G \cdot m\right) \cdot M}{r \cdot r}
double code(double G, double m, double M, double r) {
	return ((double) (((double) (((double) (G * m)) * M)) / ((double) (r * r))));
}
↓
double code(double G, double m, double M, double r) {
	return ((double) (((double) (((double) (G * m)) * M)) / ((double) (r * r))));
}

Error

Bits error versus G

Bits error versus m

Bits error versus M

Bits error versus r

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 20.1

    \[\frac{\left(G \cdot m\right) \cdot M}{r \cdot r}\]

  2. Final simplification20.1

    \[\leadsto \frac{\left(G \cdot m\right) \cdot M}{r \cdot r}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (G m M r)
  :name "(/ (* (* G m) M) (* r r))"
  :precision binary64
  (/ (* (* G m) M) (* r r)))