Average Error: 0.5 → 0.5
Time: 1.1s
Precision: binary64
\[{\left(1 + \frac{x}{2048}\right)}^{2048}\]
↓
\[{\left(1 + \frac{x}{2048}\right)}^{2048}\]
{\left(1 + \frac{x}{2048}\right)}^{2048}
↓
{\left(1 + \frac{x}{2048}\right)}^{2048}
double code(double x) {
	return ((double) pow(((double) (1.0 + ((double) (x / 2048.0)))), 2048.0));
}
↓
double code(double x) {
	return ((double) pow(((double) (1.0 + ((double) (x / 2048.0)))), 2048.0));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.5

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

  2. Final simplification0.5

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

Reproduce

herbie shell --seed 2020153 
(FPCore (x)
  :name "(pow (+ 1 (/ x 2048)) 2048)"
  :precision binary64
  (pow (+ 1.0 (/ x 2048.0)) 2048.0))