Average Error: 0 → 0
Time: 398.0ms
Precision: binary64
\[\frac{1.00000000000000003 \cdot 10^{40} + x}{2}\]
↓
\[\frac{1.00000000000000003 \cdot 10^{40} + x}{2}\]
\frac{1.00000000000000003 \cdot 10^{40} + x}{2}
↓
\frac{1.00000000000000003 \cdot 10^{40} + x}{2}
double code(double x) {
	return ((double) (((double) (1e+40 + x)) / 2.0));
}
↓
double code(double x) {
	return ((double) (((double) (1e+40 + x)) / 2.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

    \[\frac{1.00000000000000003 \cdot 10^{40} + x}{2}\]

  2. Final simplification0

    \[\leadsto \frac{1.00000000000000003 \cdot 10^{40} + x}{2}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (x)
  :name "(/ (+ 1e+40 x) 2)"
  :precision binary64
  (/ (+ 1e+40 x) 2.0))