Average Error: 0.5 → 0.4
Time: 9.3s
Precision: binary64
\[\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)} \]
↓
\[\left(\sqrt{\frac{1}{k}} \cdot {\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(k \cdot -0.5\right)}\right) \cdot {\left(\frac{\pi \cdot -2}{\frac{-1}{n}}\right)}^{0.5} \]
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
↓
\left(\sqrt{\frac{1}{k}} \cdot {\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(k \cdot -0.5\right)}\right) \cdot {\left(\frac{\pi \cdot -2}{\frac{-1}{n}}\right)}^{0.5}

(FPCore (k n)
 :precision binary64
 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
↓
(FPCore (k n)
 :precision binary64
 (*
  (* (sqrt (/ 1.0 k)) (pow (* 2.0 (* n PI)) (* k -0.5)))
  (pow (/ (* PI -2.0) (/ -1.0 n)) 0.5)))
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 (sqrt(1.0 / k) * pow((2.0 * (n * ((double) M_PI))), (k * -0.5))) * pow(((((double) M_PI) * -2.0) / (-1.0 / n)), 0.5);
}

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.4

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

  3. Taylor expanded in n around -inf 64.0

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

  4. Simplified0.5

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

  5. Applied fma-udef_binary640.5

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

  6. Applied unpow-prod-up_binary640.4

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

  7. Applied associate-*r*_binary640.4

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

  8. Simplified0.4

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

  9. Final simplification0.4

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

Reproduce

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