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

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 34.1

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

  2. Final simplification34.1

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

Reproduce

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