\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}\left(\frac{1}{\sqrt{k}} \cdot \left({2}^{\left(\frac{1 - k}{2}\right)} \cdot {\pi}^{\left(\frac{1 - k}{2}\right)}\right)\right) \cdot {n}^{\left(\frac{1 - k}{2}\right)}double f(double k, double n) {
double r110370 = 1.0;
double r110371 = k;
double r110372 = sqrt(r110371);
double r110373 = r110370 / r110372;
double r110374 = 2.0;
double r110375 = atan2(1.0, 0.0);
double r110376 = r110374 * r110375;
double r110377 = n;
double r110378 = r110376 * r110377;
double r110379 = r110370 - r110371;
double r110380 = r110379 / r110374;
double r110381 = pow(r110378, r110380);
double r110382 = r110373 * r110381;
return r110382;
}
double f(double k, double n) {
double r110383 = 1.0;
double r110384 = k;
double r110385 = sqrt(r110384);
double r110386 = r110383 / r110385;
double r110387 = 2.0;
double r110388 = r110383 - r110384;
double r110389 = r110388 / r110387;
double r110390 = pow(r110387, r110389);
double r110391 = atan2(1.0, 0.0);
double r110392 = pow(r110391, r110389);
double r110393 = r110390 * r110392;
double r110394 = r110386 * r110393;
double r110395 = n;
double r110396 = pow(r110395, r110389);
double r110397 = r110394 * r110396;
return r110397;
}



Bits error versus k



Bits error versus n
Results
Initial program 0.4
rmApplied unpow-prod-down0.5
Applied associate-*r*0.5
rmApplied unpow-prod-down0.5
Final simplification0.5
herbie shell --seed 2019325 +o rules:numerics
(FPCore (k n)
:name "Migdal et al, Equation (51)"
:precision binary64
(* (/ 1 (sqrt k)) (pow (* (* 2 PI) n) (/ (- 1 k) 2))))