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

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

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. Using strategy rm
  3. Applied unpow-prod-down0.7
    \[\leadsto \]
  4. Final simplification0.7
    \[\leadsto \]
Reproduce
herbie shell --seed 2020322 
(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))))