Average Error: 0.5 → 0.5
Time: 2.0min
Precision: binary64
\[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}\]
↓
\[\frac{{\left(\sqrt{n \cdot \left(2 \cdot \pi\right)}\right)}^{\left(1 - k\right)}}{\sqrt{k}}\]
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
↓
\frac{{\left(\sqrt{n \cdot \left(2 \cdot \pi\right)}\right)}^{\left(1 - k\right)}}{\sqrt{k}}
(FPCore (k n)
 :precision binary64
 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
↓
(FPCore (k n)
 :precision binary64
 (/ (pow (sqrt (* n (* 2.0 PI))) (- 1.0 k)) (sqrt k)))
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 pow(sqrt(n * (2.0 * ((double) M_PI))), (1.0 - k)) / 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

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

  2. Simplified0.5

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

  3. Taylor expanded around 0 3.5

    \[\leadsto \frac{\color{blue}{e^{0.5 \cdot \left(\left(\log n + \log \left(2 \cdot \pi\right)\right) \cdot \left(1 - k\right)\right)}}}{\sqrt{k}}\]

  4. Simplified0.5

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

  5. Final simplification0.5

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

Reproduce

herbie shell --seed 2021090 
(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))))