Average Error: 0.4 → 0.4
Time: 797.0ms
Precision: binary64
\[\frac{\left(2 \cdot k - 1\right) \cdot \pi}{2 \cdot n}\]
↓
\[\frac{\left(2 \cdot k - 1\right) \cdot \pi}{2 \cdot n}\]
\frac{\left(2 \cdot k - 1\right) \cdot \pi}{2 \cdot n}
↓
\frac{\left(2 \cdot k - 1\right) \cdot \pi}{2 \cdot n}
double code(double k, double n) {
	return ((double) (((double) (((double) (((double) (2.0 * k)) - 1.0)) * ((double) M_PI))) / ((double) (2.0 * n))));
}
↓
double code(double k, double n) {
	return ((double) (((double) (((double) (((double) (2.0 * k)) - 1.0)) * ((double) M_PI))) / ((double) (2.0 * n))));
}

Error

Bits error versus k

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.4

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

  2. Final simplification0.4

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

Reproduce

herbie shell --seed 2020153 
(FPCore (k n)
  :name "(/ (* (- (* 2 k) 1) PI) (* 2 n))"
  :precision binary64
  (/ (* (- (* 2.0 k) 1.0) PI) (* 2.0 n)))