Average Error: 0.0 → 0.0
Time: 652.0ms
Precision: binary64
\[\frac{\left(2 + \left(n - 1\right)\right) \cdot n}{2}\]
↓
\[\frac{\left(2 + \left(n - 1\right)\right) \cdot n}{2}\]
\frac{\left(2 + \left(n - 1\right)\right) \cdot n}{2}
↓
\frac{\left(2 + \left(n - 1\right)\right) \cdot n}{2}
double code(double n) {
	return ((double) (((double) (((double) (2.0 + ((double) (n - 1.0)))) * n)) / 2.0));
}
↓
double code(double n) {
	return ((double) (((double) (((double) (2.0 + ((double) (n - 1.0)))) * n)) / 2.0));
}

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{\left(2 + \left(n - 1\right)\right) \cdot n}{2}\]

  2. Final simplification0.0

    \[\leadsto \frac{\left(2 + \left(n - 1\right)\right) \cdot n}{2}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (n)
  :name "(/ (* (+ 2 (- n 1)) n) 2)"
  :precision binary64
  (/ (* (+ 2.0 (- n 1.0)) n) 2.0))