Average Error: 0.0 → 0.0
Time: 817.0ms
Precision: binary64
\[M + \frac{M + x}{count}\]
↓
\[M + \frac{M + x}{count}\]
M + \frac{M + x}{count}
↓
M + \frac{M + x}{count}
double code(double M, double x, double count) {
	return ((double) (M + ((double) (((double) (M + x)) / count))));
}
↓
double code(double M, double x, double count) {
	return ((double) (M + ((double) (((double) (M + x)) / count))));
}

Error

Bits error versus M

Bits error versus x

Bits error versus count

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[M + \frac{M + x}{count}\]

  2. Final simplification0.0

    \[\leadsto M + \frac{M + x}{count}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (M x count)
  :name "(+ M (/ (+ M x) count))"
  :precision binary64
  (+ M (/ (+ M x) count)))