Average Error: 0.5 → 0.4
Time: 7.7s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double k, double n) {
	return ((double) (((double) (1.0 / ((double) sqrt(k)))) * ((double) pow(((double) (((double) (2.0 * ((double) M_PI))) * n)), ((double) (((double) (1.0 - k)) / 2.0))))));
}

↓
double code(double k, double n) {
	return ((double) (1.0 * ((double) (((double) (((double) pow(((double) (2.0 * ((double) (((double) M_PI) * n)))), ((double) (1.0 / 2.0)))) / ((double) pow(((double) (2.0 * ((double) (((double) M_PI) * n)))), ((double) (k / 2.0)))))) / ((double) sqrt(k))))));
}

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.5
    \[\]
  2. Simplified0.5
    \[\leadsto \]
  3. Using strategy rm
  4. Applied div-sub0.5
    \[\leadsto \]
  5. Applied pow-sub0.4
    \[\leadsto \]
  6. Final simplification0.4
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (k n)
  :name "Migdal et al, Equation (51)"
  :precision binary64
  (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))