Average Error: 54.5 → 54.5
Time: 6.5s
Precision: binary64
\[{\left(1 + \frac{i}{n}\right)}^{n} - 1\]
↓
\[{\left(1 + \frac{i}{n}\right)}^{n} - 1\]
{\left(1 + \frac{i}{n}\right)}^{n} - 1
↓
{\left(1 + \frac{i}{n}\right)}^{n} - 1
double code(double i, double n) {
	return ((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) - 1.0));
}
↓
double code(double i, double n) {
	return ((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) - 1.0));
}

Error

Bits error versus i

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 54.5

    \[{\left(1 + \frac{i}{n}\right)}^{n} - 1\]

  2. Final simplification54.5

    \[\leadsto {\left(1 + \frac{i}{n}\right)}^{n} - 1\]

Reproduce

herbie shell --seed 2020153 
(FPCore (i n)
  :name "(- (pow (+ 1 (/ i n)) n) 1)"
  :precision binary64
  (- (pow (+ 1.0 (/ i n)) n) 1.0))