Average Error: 0.1 → 0.1
Time: 2.0s
Precision: binary64
\[{\left(2 + x\right)}^{\left(n + 3\right)}\]
↓
\[{\left(2 + x\right)}^{\left(n + 3\right)}\]
{\left(2 + x\right)}^{\left(n + 3\right)}
↓
{\left(2 + x\right)}^{\left(n + 3\right)}
double code(double x, double n) {
	return ((double) pow(((double) (2.0 + x)), ((double) (n + 3.0))));
}
↓
double code(double x, double n) {
	return ((double) pow(((double) (2.0 + x)), ((double) (n + 3.0))));
}

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 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2020152 
(FPCore (x n)
  :name "(pow (+ 2 x) (+ n 3))"
  :precision binary64
  (pow (+ 2.0 x) (+ n 3.0)))