
(FPCore (k n) :precision binary64 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return (1.0 / sqrt(k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return (1.0 / Math.sqrt(k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return (1.0 / math.sqrt(k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(Float64(1.0 / sqrt(k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (1.0 / sqrt(k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (k n) :precision binary64 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return (1.0 / sqrt(k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return (1.0 / Math.sqrt(k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return (1.0 / math.sqrt(k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(Float64(1.0 / sqrt(k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (1.0 / sqrt(k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
(FPCore (k n) :precision binary64 (/ (pow k -0.5) (pow (* PI (* n 2.0)) (- -0.5 (* k -0.5)))))
double code(double k, double n) {
return pow(k, -0.5) / pow((((double) M_PI) * (n * 2.0)), (-0.5 - (k * -0.5)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow((Math.PI * (n * 2.0)), (-0.5 - (k * -0.5)));
}
def code(k, n): return math.pow(k, -0.5) / math.pow((math.pi * (n * 2.0)), (-0.5 - (k * -0.5)))
function code(k, n) return Float64((k ^ -0.5) / (Float64(pi * Float64(n * 2.0)) ^ Float64(-0.5 - Float64(k * -0.5)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / ((pi * (n * 2.0)) ^ (-0.5 - (k * -0.5))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(-0.5 - N[(k * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(-0.5 - k \cdot -0.5\right)}}
\end{array}
Initial program 99.5%
associate-/r/99.5%
*-commutative99.5%
associate-*r*99.5%
div-sub99.5%
metadata-eval99.5%
associate-*r*99.5%
*-commutative99.5%
associate-*l*99.5%
sub-neg99.5%
div-inv99.5%
metadata-eval99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
Applied egg-rr99.5%
inv-pow99.5%
div-inv99.4%
unpow-prod-down99.4%
sqrt-pow299.5%
metadata-eval99.5%
associate-*r*99.5%
*-commutative99.5%
*-commutative99.5%
pow-flip99.5%
*-commutative99.5%
+-commutative99.5%
fma-def99.5%
Applied egg-rr99.5%
unpow-199.5%
associate-*r/99.5%
*-rgt-identity99.5%
*-commutative99.5%
*-commutative99.5%
associate-*l*99.5%
*-commutative99.5%
neg-sub099.5%
metadata-eval99.5%
fma-udef99.5%
*-commutative99.5%
+-commutative99.5%
*-commutative99.5%
associate--r+99.5%
metadata-eval99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 1.3e+114) (* (pow k -0.5) (sqrt (* n (* PI 2.0)))) (pow (* (pow (* n (/ PI k)) 3.0) 8.0) 0.16666666666666666)))
double code(double k, double n) {
double tmp;
if (k <= 1.3e+114) {
tmp = pow(k, -0.5) * sqrt((n * (((double) M_PI) * 2.0)));
} else {
tmp = pow((pow((n * (((double) M_PI) / k)), 3.0) * 8.0), 0.16666666666666666);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.3e+114) {
tmp = Math.pow(k, -0.5) * Math.sqrt((n * (Math.PI * 2.0)));
} else {
tmp = Math.pow((Math.pow((n * (Math.PI / k)), 3.0) * 8.0), 0.16666666666666666);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.3e+114: tmp = math.pow(k, -0.5) * math.sqrt((n * (math.pi * 2.0))) else: tmp = math.pow((math.pow((n * (math.pi / k)), 3.0) * 8.0), 0.16666666666666666) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.3e+114) tmp = Float64((k ^ -0.5) * sqrt(Float64(n * Float64(pi * 2.0)))); else tmp = Float64((Float64(n * Float64(pi / k)) ^ 3.0) * 8.0) ^ 0.16666666666666666; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.3e+114) tmp = (k ^ -0.5) * sqrt((n * (pi * 2.0))); else tmp = (((n * (pi / k)) ^ 3.0) * 8.0) ^ 0.16666666666666666; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.3e+114], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[Power[N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision] * 8.0), $MachinePrecision], 0.16666666666666666], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.3 \cdot 10^{+114}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{n \cdot \left(\pi \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(n \cdot \frac{\pi}{k}\right)}^{3} \cdot 8\right)}^{0.16666666666666666}\\
\end{array}
\end{array}
if k < 1.3e114Initial program 99.3%
Taylor expanded in k around 0 73.1%
expm1-log1p-u70.3%
expm1-udef42.5%
sqrt-unprod42.5%
*-commutative42.5%
*-commutative42.5%
associate-*r*42.5%
*-commutative42.5%
*-commutative42.5%
Applied egg-rr42.5%
expm1-def70.4%
expm1-log1p73.2%
Simplified73.2%
expm1-log1p-u67.7%
expm1-udef77.3%
inv-pow77.3%
sqrt-pow277.3%
metadata-eval77.3%
Applied egg-rr77.3%
expm1-def67.7%
expm1-log1p73.2%
Simplified73.2%
if 1.3e114 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
expm1-log1p-u2.7%
expm1-udef33.3%
associate-*l/33.3%
*-un-lft-identity33.3%
sqrt-unprod33.3%
*-commutative33.3%
*-commutative33.3%
sqrt-undiv33.3%
associate-*r*33.3%
*-commutative33.3%
*-commutative33.3%
Applied egg-rr33.3%
expm1-def2.6%
expm1-log1p2.6%
associate-*r*2.6%
*-commutative2.6%
*-commutative2.6%
*-commutative2.6%
associate-*r/2.6%
associate-/l*2.6%
Simplified2.6%
Taylor expanded in n around 0 2.6%
associate-*r/2.6%
Simplified2.6%
Applied egg-rr20.4%
associate-*r*20.4%
cube-prod20.4%
associate-*r/20.4%
associate-/l*20.4%
associate-/r/20.4%
*-commutative20.4%
metadata-eval20.4%
Simplified20.4%
Final simplification57.7%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (pow (* 2.0 (* PI n)) (+ (* k -0.5) 0.5))))
double code(double k, double n) {
return pow(k, -0.5) * pow((2.0 * (((double) M_PI) * n)), ((k * -0.5) + 0.5));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow((2.0 * (Math.PI * n)), ((k * -0.5) + 0.5));
}
def code(k, n): return math.pow(k, -0.5) * math.pow((2.0 * (math.pi * n)), ((k * -0.5) + 0.5))
function code(k, n) return Float64((k ^ -0.5) * (Float64(2.0 * Float64(pi * n)) ^ Float64(Float64(k * -0.5) + 0.5))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * ((2.0 * (pi * n)) ^ ((k * -0.5) + 0.5)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(N[(k * -0.5), $MachinePrecision] + 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(k \cdot -0.5 + 0.5\right)}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
sqr-pow99.3%
pow-sqr99.5%
*-commutative99.5%
associate-*l*99.5%
associate-*r/99.5%
*-commutative99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
div-inv99.5%
associate-*r*99.5%
*-commutative99.5%
associate-*l*99.5%
sub-neg99.5%
div-inv99.5%
metadata-eval99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
inv-pow99.5%
sqrt-pow299.5%
metadata-eval99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* n 2.0)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (n * 2.0)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (n * 2.0)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (n * 2.0)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(n * 2.0)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (n * 2.0)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
sqr-pow99.3%
pow-sqr99.5%
*-commutative99.5%
associate-*l*99.5%
associate-*r/99.5%
*-commutative99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (sqrt (* n (* PI 2.0)))))
double code(double k, double n) {
return pow(k, -0.5) * sqrt((n * (((double) M_PI) * 2.0)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.sqrt((n * (Math.PI * 2.0)));
}
def code(k, n): return math.pow(k, -0.5) * math.sqrt((n * (math.pi * 2.0)))
function code(k, n) return Float64((k ^ -0.5) * sqrt(Float64(n * Float64(pi * 2.0)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * sqrt((n * (pi * 2.0))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot \sqrt{n \cdot \left(\pi \cdot 2\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 52.5%
expm1-log1p-u50.5%
expm1-udef30.8%
sqrt-unprod30.8%
*-commutative30.8%
*-commutative30.8%
associate-*r*30.8%
*-commutative30.8%
*-commutative30.8%
Applied egg-rr30.8%
expm1-def50.5%
expm1-log1p52.5%
Simplified52.5%
expm1-log1p-u48.7%
expm1-udef69.0%
inv-pow69.0%
sqrt-pow269.0%
metadata-eval69.0%
Applied egg-rr69.0%
expm1-def48.7%
expm1-log1p52.6%
Simplified52.6%
Final simplification52.6%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (fabs (* n (/ PI k))))))
double code(double k, double n) {
return sqrt((2.0 * fabs((n * (((double) M_PI) / k)))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * Math.abs((n * (Math.PI / k)))));
}
def code(k, n): return math.sqrt((2.0 * math.fabs((n * (math.pi / k)))))
function code(k, n) return sqrt(Float64(2.0 * abs(Float64(n * Float64(pi / k))))) end
function tmp = code(k, n) tmp = sqrt((2.0 * abs((n * (pi / k))))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[Abs[N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left|n \cdot \frac{\pi}{k}\right|}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 52.5%
expm1-log1p-u49.1%
expm1-udef51.5%
associate-*l/51.5%
*-un-lft-identity51.5%
sqrt-unprod51.5%
*-commutative51.5%
*-commutative51.5%
sqrt-undiv38.7%
associate-*r*38.7%
*-commutative38.7%
*-commutative38.7%
Applied egg-rr38.7%
expm1-def36.4%
expm1-log1p38.4%
associate-*r*38.4%
*-commutative38.4%
*-commutative38.4%
*-commutative38.4%
associate-*r/38.4%
associate-/l*38.4%
Simplified38.4%
associate-/r/38.4%
add-sqr-sqrt38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down22.2%
pow222.2%
*-commutative22.2%
Applied egg-rr22.2%
unpow1/222.2%
unpow222.2%
rem-sqrt-square38.4%
associate-*r/38.4%
*-commutative38.4%
associate-*r/38.4%
Simplified38.4%
Final simplification38.4%
(FPCore (k n) :precision binary64 (* (sqrt (* n 2.0)) (sqrt (/ PI k))))
double code(double k, double n) {
return sqrt((n * 2.0)) * sqrt((((double) M_PI) / k));
}
public static double code(double k, double n) {
return Math.sqrt((n * 2.0)) * Math.sqrt((Math.PI / k));
}
def code(k, n): return math.sqrt((n * 2.0)) * math.sqrt((math.pi / k))
function code(k, n) return Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt((n * 2.0)) * sqrt((pi / k)); end
code[k_, n_] := N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot 2} \cdot \sqrt{\frac{\pi}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 52.5%
expm1-log1p-u49.1%
expm1-udef51.5%
associate-*l/51.5%
*-un-lft-identity51.5%
sqrt-unprod51.5%
*-commutative51.5%
*-commutative51.5%
sqrt-undiv38.7%
associate-*r*38.7%
*-commutative38.7%
*-commutative38.7%
Applied egg-rr38.7%
expm1-def36.4%
expm1-log1p38.4%
associate-*r*38.4%
*-commutative38.4%
*-commutative38.4%
*-commutative38.4%
associate-*r/38.4%
associate-/l*38.4%
Simplified38.4%
Taylor expanded in n around 0 38.4%
associate-*r/38.4%
Simplified38.4%
associate-*r*38.4%
*-commutative38.4%
sqrt-prod52.5%
Applied egg-rr52.5%
Final simplification52.5%
(FPCore (k n) :precision binary64 (/ (sqrt (* n (* PI 2.0))) (sqrt k)))
double code(double k, double n) {
return sqrt((n * (((double) M_PI) * 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((n * (Math.PI * 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((n * (math.pi * 2.0))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(n * Float64(pi * 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((n * (pi * 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n \cdot \left(\pi \cdot 2\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 52.5%
associate-*l/52.4%
*-un-lft-identity52.4%
sqrt-unprod52.5%
*-commutative52.5%
*-commutative52.5%
associate-*r*52.5%
*-commutative52.5%
*-commutative52.5%
Applied egg-rr52.5%
Final simplification52.5%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (* n (/ PI k)))))
double code(double k, double n) {
return sqrt((2.0 * (n * (((double) M_PI) / k))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n * (Math.PI / k))));
}
def code(k, n): return math.sqrt((2.0 * (n * (math.pi / k))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n * (pi / k)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(n \cdot \frac{\pi}{k}\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 52.5%
expm1-log1p-u49.1%
expm1-udef51.5%
associate-*l/51.5%
*-un-lft-identity51.5%
sqrt-unprod51.5%
*-commutative51.5%
*-commutative51.5%
sqrt-undiv38.7%
associate-*r*38.7%
*-commutative38.7%
*-commutative38.7%
Applied egg-rr38.7%
expm1-def36.4%
expm1-log1p38.4%
associate-*r*38.4%
*-commutative38.4%
*-commutative38.4%
*-commutative38.4%
associate-*r/38.4%
associate-/l*38.4%
Simplified38.4%
Taylor expanded in n around 0 38.4%
associate-*r/38.4%
Simplified38.4%
Final simplification38.4%
(FPCore (k n) :precision binary64 (sqrt (* n (/ (* PI 2.0) k))))
double code(double k, double n) {
return sqrt((n * ((((double) M_PI) * 2.0) / k)));
}
public static double code(double k, double n) {
return Math.sqrt((n * ((Math.PI * 2.0) / k)));
}
def code(k, n): return math.sqrt((n * ((math.pi * 2.0) / k)))
function code(k, n) return sqrt(Float64(n * Float64(Float64(pi * 2.0) / k))) end
function tmp = code(k, n) tmp = sqrt((n * ((pi * 2.0) / k))); end
code[k_, n_] := N[Sqrt[N[(n * N[(N[(Pi * 2.0), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \frac{\pi \cdot 2}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 52.5%
expm1-log1p-u49.1%
expm1-udef51.5%
associate-*l/51.5%
*-un-lft-identity51.5%
sqrt-unprod51.5%
*-commutative51.5%
*-commutative51.5%
sqrt-undiv38.7%
associate-*r*38.7%
*-commutative38.7%
*-commutative38.7%
Applied egg-rr38.7%
expm1-def36.4%
expm1-log1p38.4%
*-rgt-identity38.4%
associate-*r/38.4%
associate-*l*38.4%
associate-*r/38.4%
*-commutative38.4%
associate-*r*38.4%
*-rgt-identity38.4%
*-commutative38.4%
Simplified38.4%
Final simplification38.4%
herbie shell --seed 2024027
(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))))