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

Error

Bits error versus x

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 5.6

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

  2. Final simplification5.6

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

Reproduce

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