Average Error: 0.0 → 0.0
Time: 449.0ms
Precision: binary64
\[x + \frac{1 \cdot 3}{100}\]
↓
\[x + \frac{1 \cdot 3}{100}\]
x + \frac{1 \cdot 3}{100}
↓
x + \frac{1 \cdot 3}{100}
double code(double x) {
	return ((double) (x + ((double) (((double) (1.0 * 3.0)) / 100.0))));
}
↓
double code(double x) {
	return ((double) (x + ((double) (((double) (1.0 * 3.0)) / 100.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.0

    \[x + \frac{1 \cdot 3}{100}\]

  2. Final simplification0.0

    \[\leadsto x + \frac{1 \cdot 3}{100}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (x)
  :name "(+ x (/ (* 1 3) 100))"
  :precision binary64
  (+ x (/ (* 1.0 3.0) 100.0)))