
(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 (let* ((t_0 (* (* 2.0 n) PI))) (/ (pow k -0.5) (/ (pow t_0 (* k 0.5)) (sqrt t_0)))))
double code(double k, double n) {
double t_0 = (2.0 * n) * ((double) M_PI);
return pow(k, -0.5) / (pow(t_0, (k * 0.5)) / sqrt(t_0));
}
public static double code(double k, double n) {
double t_0 = (2.0 * n) * Math.PI;
return Math.pow(k, -0.5) / (Math.pow(t_0, (k * 0.5)) / Math.sqrt(t_0));
}
def code(k, n): t_0 = (2.0 * n) * math.pi return math.pow(k, -0.5) / (math.pow(t_0, (k * 0.5)) / math.sqrt(t_0))
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) return Float64((k ^ -0.5) / Float64((t_0 ^ Float64(k * 0.5)) / sqrt(t_0))) end
function tmp = code(k, n) t_0 = (2.0 * n) * pi; tmp = (k ^ -0.5) / ((t_0 ^ (k * 0.5)) / sqrt(t_0)); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]}, N[(N[Power[k, -0.5], $MachinePrecision] / N[(N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(2 \cdot n\right) \cdot \pi\\
\frac{{k}^{-0.5}}{\frac{{t_0}^{\left(k \cdot 0.5\right)}}{\sqrt{t_0}}}
\end{array}
\end{array}
Initial program 99.3%
unpow-prod-down74.6%
unpow-prod-down99.3%
div-sub99.3%
metadata-eval99.3%
pow-sub99.5%
pow1/299.5%
associate-*r/99.5%
inv-pow99.5%
sqrt-pow299.7%
metadata-eval99.7%
associate-*l*99.7%
associate-*l*99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
associate-/l*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
*-commutative99.6%
associate-*r*99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (let* ((t_0 (* (* 2.0 n) PI))) (/ (sqrt t_0) (* (pow t_0 (* k 0.5)) (sqrt k)))))
double code(double k, double n) {
double t_0 = (2.0 * n) * ((double) M_PI);
return sqrt(t_0) / (pow(t_0, (k * 0.5)) * sqrt(k));
}
public static double code(double k, double n) {
double t_0 = (2.0 * n) * Math.PI;
return Math.sqrt(t_0) / (Math.pow(t_0, (k * 0.5)) * Math.sqrt(k));
}
def code(k, n): t_0 = (2.0 * n) * math.pi return math.sqrt(t_0) / (math.pow(t_0, (k * 0.5)) * math.sqrt(k))
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) return Float64(sqrt(t_0) / Float64((t_0 ^ Float64(k * 0.5)) * sqrt(k))) end
function tmp = code(k, n) t_0 = (2.0 * n) * pi; tmp = sqrt(t_0) / ((t_0 ^ (k * 0.5)) * sqrt(k)); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[(N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sqrt[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(2 \cdot n\right) \cdot \pi\\
\frac{\sqrt{t_0}}{{t_0}^{\left(k \cdot 0.5\right)} \cdot \sqrt{k}}
\end{array}
\end{array}
Initial program 99.3%
unpow-prod-down74.6%
unpow-prod-down99.3%
div-sub99.3%
metadata-eval99.3%
pow-sub99.5%
pow1/299.5%
frac-times99.6%
*-un-lft-identity99.6%
associate-*l*99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (pow (* n (* 2.0 PI)) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return pow(k, -0.5) * pow((n * (2.0 * ((double) M_PI))), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow((n * (2.0 * Math.PI)), ((1.0 - k) / 2.0));
}
def code(k, n): return math.pow(k, -0.5) * math.pow((n * (2.0 * math.pi)), ((1.0 - k) / 2.0))
function code(k, n) return Float64((k ^ -0.5) * (Float64(n * Float64(2.0 * pi)) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * ((n * (2.0 * pi)) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.3%
expm1-log1p-u96.0%
expm1-udef72.1%
inv-pow72.1%
sqrt-pow272.1%
metadata-eval72.1%
Applied egg-rr72.1%
expm1-def96.0%
expm1-log1p99.4%
Simplified99.4%
Final simplification99.4%
(FPCore (k n) :precision binary64 (/ (pow k -0.5) (pow (* 2.0 (* n PI)) (- (* k 0.5) 0.5))))
double code(double k, double n) {
return pow(k, -0.5) / pow((2.0 * (n * ((double) M_PI))), ((k * 0.5) - 0.5));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow((2.0 * (n * Math.PI)), ((k * 0.5) - 0.5));
}
def code(k, n): return math.pow(k, -0.5) / math.pow((2.0 * (n * math.pi)), ((k * 0.5) - 0.5))
function code(k, n) return Float64((k ^ -0.5) / (Float64(2.0 * Float64(n * pi)) ^ Float64(Float64(k * 0.5) - 0.5))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / ((2.0 * (n * pi)) ^ ((k * 0.5) - 0.5)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision], N[(N[(k * 0.5), $MachinePrecision] - 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(k \cdot 0.5 - 0.5\right)}}
\end{array}
Initial program 99.3%
unpow-prod-down74.6%
unpow-prod-down99.3%
div-sub99.3%
metadata-eval99.3%
pow-sub99.5%
pow1/299.5%
associate-*r/99.5%
inv-pow99.5%
sqrt-pow299.7%
metadata-eval99.7%
associate-*l*99.7%
associate-*l*99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
associate-/l*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
*-commutative99.6%
associate-*r*99.6%
Simplified99.6%
*-commutative99.6%
metadata-eval99.6%
div-inv99.6%
associate-*l*99.6%
*-commutative99.6%
pow1/299.6%
associate-*l*99.6%
*-commutative99.6%
pow-div99.5%
div-inv99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 6.2e-14) (* (pow k -0.5) (sqrt (* 2.0 (* n PI)))) (sqrt (/ (pow (* (* 2.0 n) PI) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 6.2e-14) {
tmp = pow(k, -0.5) * sqrt((2.0 * (n * ((double) M_PI))));
} else {
tmp = sqrt((pow(((2.0 * n) * ((double) M_PI)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6.2e-14) {
tmp = Math.pow(k, -0.5) * Math.sqrt((2.0 * (n * Math.PI)));
} else {
tmp = Math.sqrt((Math.pow(((2.0 * n) * Math.PI), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6.2e-14: tmp = math.pow(k, -0.5) * math.sqrt((2.0 * (n * math.pi))) else: tmp = math.sqrt((math.pow(((2.0 * n) * math.pi), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 6.2e-14) tmp = Float64((k ^ -0.5) * sqrt(Float64(2.0 * Float64(n * pi)))); else tmp = sqrt(Float64((Float64(Float64(2.0 * n) * pi) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6.2e-14) tmp = (k ^ -0.5) * sqrt((2.0 * (n * pi))); else tmp = sqrt(((((2.0 * n) * pi) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6.2e-14], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.2 \cdot 10^{-14}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{2 \cdot \left(n \cdot \pi\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(2 \cdot n\right) \cdot \pi\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 6.20000000000000009e-14Initial program 99.0%
associate-*l/99.1%
*-lft-identity99.1%
sqr-pow98.8%
pow-sqr99.1%
*-commutative99.1%
associate-*l/99.1%
associate-/l*99.1%
metadata-eval99.1%
/-rgt-identity99.1%
div-sub99.1%
metadata-eval99.1%
Simplified99.1%
add-cube-cbrt98.4%
pow398.4%
associate-*l*98.4%
Applied egg-rr98.4%
Taylor expanded in k around 0 98.7%
pow-base-198.7%
*-lft-identity98.7%
Simplified98.7%
div-inv98.6%
sqrt-unprod98.7%
pow1/298.7%
pow-flip98.9%
metadata-eval98.9%
Applied egg-rr98.9%
*-commutative98.9%
Simplified98.9%
if 6.20000000000000009e-14 < k Initial program 99.6%
*-commutative99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.6%
expm1-log1p-u99.6%
expm1-udef96.9%
Applied egg-rr96.9%
expm1-def99.6%
expm1-log1p99.7%
*-commutative99.7%
associate-*r*99.7%
Simplified99.7%
Final simplification99.3%
(FPCore (k n) :precision binary64 (/ (pow (* n (* 2.0 PI)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((n * (2.0 * ((double) M_PI))), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((n * (2.0 * Math.PI)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((n * (2.0 * math.pi)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((n * (2.0 * pi)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.3%
associate-*l/99.4%
*-lft-identity99.4%
sqr-pow99.2%
pow-sqr99.4%
*-commutative99.4%
associate-*l/99.4%
associate-/l*99.4%
metadata-eval99.4%
/-rgt-identity99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
Final simplification99.4%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (sqrt (* 2.0 (* n PI)))))
double code(double k, double n) {
return pow(k, -0.5) * sqrt((2.0 * (n * ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.sqrt((2.0 * (n * Math.PI)));
}
def code(k, n): return math.pow(k, -0.5) * math.sqrt((2.0 * (n * math.pi)))
function code(k, n) return Float64((k ^ -0.5) * sqrt(Float64(2.0 * Float64(n * pi)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * sqrt((2.0 * (n * pi))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot \sqrt{2 \cdot \left(n \cdot \pi\right)}
\end{array}
Initial program 99.3%
associate-*l/99.4%
*-lft-identity99.4%
sqr-pow99.2%
pow-sqr99.4%
*-commutative99.4%
associate-*l/99.4%
associate-/l*99.4%
metadata-eval99.4%
/-rgt-identity99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
add-cube-cbrt99.0%
pow399.0%
associate-*l*99.0%
Applied egg-rr99.0%
Taylor expanded in k around 0 49.1%
pow-base-149.1%
*-lft-identity49.1%
Simplified49.1%
div-inv49.0%
sqrt-unprod49.1%
pow1/249.1%
pow-flip49.2%
metadata-eval49.2%
Applied egg-rr49.2%
*-commutative49.2%
Simplified49.2%
Final simplification49.2%
(FPCore (k n) :precision binary64 (/ (sqrt (* 2.0 (* n PI))) (sqrt k)))
double code(double k, double n) {
return sqrt((2.0 * (n * ((double) M_PI)))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n * Math.PI))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((2.0 * (n * math.pi))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(2.0 * Float64(n * pi))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n * pi))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2 \cdot \left(n \cdot \pi\right)}}{\sqrt{k}}
\end{array}
Initial program 99.3%
associate-*l/99.4%
*-lft-identity99.4%
sqr-pow99.2%
pow-sqr99.4%
*-commutative99.4%
associate-*l/99.4%
associate-/l*99.4%
metadata-eval99.4%
/-rgt-identity99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
add-cube-cbrt99.0%
pow399.0%
associate-*l*99.0%
Applied egg-rr99.0%
Taylor expanded in k around 0 49.1%
pow-base-149.1%
*-lft-identity49.1%
Simplified49.1%
expm1-log1p-u46.4%
expm1-udef45.9%
sqrt-unprod45.9%
Applied egg-rr45.9%
expm1-def46.4%
expm1-log1p49.1%
*-commutative49.1%
Simplified49.1%
Final simplification49.1%
(FPCore (k n) :precision binary64 (sqrt (* (/ 2.0 k) (* n PI))))
double code(double k, double n) {
return sqrt(((2.0 / k) * (n * ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.sqrt(((2.0 / k) * (n * Math.PI)));
}
def code(k, n): return math.sqrt(((2.0 / k) * (n * math.pi)))
function code(k, n) return sqrt(Float64(Float64(2.0 / k) * Float64(n * pi))) end
function tmp = code(k, n) tmp = sqrt(((2.0 / k) * (n * pi))); end
code[k_, n_] := N[Sqrt[N[(N[(2.0 / k), $MachinePrecision] * N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{2}{k} \cdot \left(n \cdot \pi\right)}
\end{array}
Initial program 99.3%
associate-*l/99.4%
*-lft-identity99.4%
sqr-pow99.2%
pow-sqr99.4%
*-commutative99.4%
associate-*l/99.4%
associate-/l*99.4%
metadata-eval99.4%
/-rgt-identity99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
add-cube-cbrt99.0%
pow399.0%
associate-*l*99.0%
Applied egg-rr99.0%
Taylor expanded in k around 0 49.1%
pow-base-149.1%
*-lft-identity49.1%
Simplified49.1%
expm1-log1p-u46.4%
expm1-udef45.9%
sqrt-unprod45.9%
Applied egg-rr45.9%
expm1-def46.4%
expm1-log1p49.1%
*-commutative49.1%
Simplified49.1%
expm1-log1p-u46.4%
expm1-udef45.9%
sqrt-undiv35.5%
Applied egg-rr35.5%
expm1-def36.0%
expm1-log1p37.7%
associate-/l*37.6%
*-commutative37.6%
associate-/r/37.6%
Simplified37.6%
Final simplification37.6%
(FPCore (k n) :precision binary64 (sqrt (/ (* n (* 2.0 PI)) k)))
double code(double k, double n) {
return sqrt(((n * (2.0 * ((double) M_PI))) / k));
}
public static double code(double k, double n) {
return Math.sqrt(((n * (2.0 * Math.PI)) / k));
}
def code(k, n): return math.sqrt(((n * (2.0 * math.pi)) / k))
function code(k, n) return sqrt(Float64(Float64(n * Float64(2.0 * pi)) / k)) end
function tmp = code(k, n) tmp = sqrt(((n * (2.0 * pi)) / k)); end
code[k_, n_] := N[Sqrt[N[(N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{n \cdot \left(2 \cdot \pi\right)}{k}}
\end{array}
Initial program 99.3%
*-commutative99.3%
div-sub99.3%
metadata-eval99.3%
div-inv99.4%
expm1-log1p-u96.6%
expm1-udef86.5%
Applied egg-rr76.1%
expm1-def86.2%
expm1-log1p87.9%
*-commutative87.9%
associate-*r*87.9%
Simplified87.9%
associate-*l*87.9%
*-commutative87.9%
sub-neg87.9%
unpow-prod-up87.7%
pow187.7%
Applied egg-rr87.7%
Taylor expanded in k around 0 37.7%
*-commutative37.7%
associate-*r*37.7%
Simplified37.7%
Final simplification37.7%
herbie shell --seed 2023273
(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))))