Average Error: 0.0 → 0.0
Time: 2.1s
Precision: binary64
\[\frac{\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) + g}{n}\]
↓
\[\frac{\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) + g}{n}\]
\frac{\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) + g}{n}
↓
\frac{\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) + g}{n}
double code(double a, double b, double c, double d, double e, double f, double g, double n) {
	return ((double) (((double) (((double) (((double) (((double) (((double) (((double) (a + b)) + c)) + d)) + e)) + f)) + g)) / n));
}
↓
double code(double a, double b, double c, double d, double e, double f, double g, double n) {
	return ((double) (((double) (((double) (((double) (((double) (((double) (((double) (a + b)) + c)) + d)) + e)) + f)) + g)) / n));
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Bits error versus e

Bits error versus f

Bits error versus g

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) + g}{n}\]

  2. Final simplification0.0

    \[\leadsto \frac{\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) + g}{n}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (a b c d e f g n)
  :name "(/ (+ (+ (+ (+ (+ (+ a b) c) d) e) f) g) n)"
  :precision binary64
  (/ (+ (+ (+ (+ (+ (+ a b) c) d) e) f) g) n))