
(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 (* PI n)))) (* (sqrt t_0) (* (pow t_0 (* k -0.5)) (pow k -0.5)))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
return sqrt(t_0) * (pow(t_0, (k * -0.5)) * pow(k, -0.5));
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
return Math.sqrt(t_0) * (Math.pow(t_0, (k * -0.5)) * Math.pow(k, -0.5));
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return math.sqrt(t_0) * (math.pow(t_0, (k * -0.5)) * math.pow(k, -0.5))
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(sqrt(t_0) * Float64((t_0 ^ Float64(k * -0.5)) * (k ^ -0.5))) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = sqrt(t_0) * ((t_0 ^ (k * -0.5)) * (k ^ -0.5)); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(N[Power[t$95$0, N[(k * -0.5), $MachinePrecision]], $MachinePrecision] * N[Power[k, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\sqrt{t_0} \cdot \left({t_0}^{\left(k \cdot -0.5\right)} \cdot {k}^{-0.5}\right)
\end{array}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
*-commutative99.5%
associate-*l*99.5%
div-sub99.5%
sub-neg99.5%
distribute-frac-neg99.5%
metadata-eval99.5%
neg-mul-199.5%
associate-/l*99.4%
associate-/r/99.5%
metadata-eval99.5%
Simplified99.5%
div-inv99.5%
unpow-prod-up99.7%
pow1/299.7%
associate-*l*99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*l*99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*l*99.7%
*-commutative99.7%
inv-pow99.7%
sqrt-pow299.7%
metadata-eval99.7%
Applied egg-rr99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* 2.0 (* PI n)))) (/ (* (sqrt t_0) (pow t_0 (* k -0.5))) (sqrt k))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
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 * (Math.PI * n);
return (Math.sqrt(t_0) * Math.pow(t_0, (k * -0.5))) / Math.sqrt(k);
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return (math.sqrt(t_0) * math.pow(t_0, (k * -0.5))) / math.sqrt(k)
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(Float64(sqrt(t_0) * (t_0 ^ Float64(k * -0.5))) / sqrt(k)) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = (sqrt(t_0) * (t_0 ^ (k * -0.5))) / sqrt(k); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Power[t$95$0, N[(k * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\frac{\sqrt{t_0} \cdot {t_0}^{\left(k \cdot -0.5\right)}}{\sqrt{k}}
\end{array}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
*-commutative99.5%
associate-*l*99.5%
div-sub99.5%
sub-neg99.5%
distribute-frac-neg99.5%
metadata-eval99.5%
neg-mul-199.5%
associate-/l*99.4%
associate-/r/99.5%
metadata-eval99.5%
Simplified99.5%
+-commutative99.5%
unpow-prod-up99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*l*99.7%
*-commutative99.7%
pow1/299.7%
associate-*r*99.7%
*-commutative99.7%
associate-*l*99.7%
Applied egg-rr99.7%
Final simplification99.7%
(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.5%
expm1-log1p-u96.1%
expm1-udef76.9%
pow1/276.9%
pow-flip76.9%
metadata-eval76.9%
Applied egg-rr76.9%
expm1-def96.1%
expm1-log1p99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* 2.0 n))))
(if (<= k 1.85e-28)
(/ (sqrt t_0) (sqrt k))
(sqrt (/ (pow t_0 (- 1.0 k)) k)))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
double tmp;
if (k <= 1.85e-28) {
tmp = sqrt(t_0) / sqrt(k);
} else {
tmp = sqrt((pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
double tmp;
if (k <= 1.85e-28) {
tmp = Math.sqrt(t_0) / Math.sqrt(k);
} else {
tmp = Math.sqrt((Math.pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): t_0 = math.pi * (2.0 * n) tmp = 0 if k <= 1.85e-28: tmp = math.sqrt(t_0) / math.sqrt(k) else: tmp = math.sqrt((math.pow(t_0, (1.0 - k)) / k)) return tmp
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) tmp = 0.0 if (k <= 1.85e-28) tmp = Float64(sqrt(t_0) / sqrt(k)); else tmp = sqrt(Float64((t_0 ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) t_0 = pi * (2.0 * n); tmp = 0.0; if (k <= 1.85e-28) tmp = sqrt(t_0) / sqrt(k); else tmp = sqrt(((t_0 ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.85e-28], N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[t$95$0, N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\mathbf{if}\;k \leq 1.85 \cdot 10^{-28}:\\
\;\;\;\;\frac{\sqrt{t_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.8500000000000001e-28Initial program 99.4%
Taylor expanded in k around 0 99.2%
associate-*l/99.3%
*-un-lft-identity99.3%
sqrt-unprod99.4%
*-commutative99.4%
*-commutative99.4%
associate-*r*99.4%
*-commutative99.4%
associate-*r*99.4%
*-commutative99.4%
Applied egg-rr99.4%
if 1.8500000000000001e-28 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
frac-times99.6%
Applied egg-rr99.6%
Simplified99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (+ 0.5 (* k -0.5))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), (0.5 + (k * -0.5))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), (0.5 + (k * -0.5))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), (0.5 + (k * -0.5))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(0.5 + Float64(k * -0.5))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ (0.5 + (k * -0.5))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(k * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(0.5 + k \cdot -0.5\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
*-commutative99.5%
associate-*l*99.5%
div-sub99.5%
sub-neg99.5%
distribute-frac-neg99.5%
metadata-eval99.5%
neg-mul-199.5%
associate-/l*99.4%
associate-/r/99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 4.8e+173) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (pow (pow (* (* 2.0 n) (/ PI k)) 3.0) 0.16666666666666666)))
double code(double k, double n) {
double tmp;
if (k <= 4.8e+173) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = pow(pow(((2.0 * n) * (((double) M_PI) / k)), 3.0), 0.16666666666666666);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 4.8e+173) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = Math.pow(Math.pow(((2.0 * n) * (Math.PI / k)), 3.0), 0.16666666666666666);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 4.8e+173: tmp = math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k) else: tmp = math.pow(math.pow(((2.0 * n) * (math.pi / k)), 3.0), 0.16666666666666666) return tmp
function code(k, n) tmp = 0.0 if (k <= 4.8e+173) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = (Float64(Float64(2.0 * n) * Float64(pi / k)) ^ 3.0) ^ 0.16666666666666666; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 4.8e+173) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); else tmp = (((2.0 * n) * (pi / k)) ^ 3.0) ^ 0.16666666666666666; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 4.8e+173], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(Pi / k), $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], 0.16666666666666666], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.8 \cdot 10^{+173}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(\left(2 \cdot n\right) \cdot \frac{\pi}{k}\right)}^{3}\right)}^{0.16666666666666666}\\
\end{array}
\end{array}
if k < 4.7999999999999998e173Initial program 99.4%
Taylor expanded in k around 0 63.3%
associate-*l/63.3%
*-un-lft-identity63.3%
sqrt-unprod63.4%
*-commutative63.4%
*-commutative63.4%
associate-*r*63.4%
*-commutative63.4%
associate-*r*63.4%
*-commutative63.4%
Applied egg-rr63.4%
if 4.7999999999999998e173 < k Initial program 100.0%
add-cube-cbrt100.0%
pow3100.0%
associate-*l/100.0%
*-un-lft-identity100.0%
associate-*l*100.0%
div-sub100.0%
metadata-eval100.0%
div-inv100.0%
metadata-eval100.0%
Applied egg-rr100.0%
Taylor expanded in k around 0 2.6%
*-commutative2.6%
sqrt-unprod2.6%
associate-/l*2.6%
Applied egg-rr2.6%
pow1/22.6%
metadata-eval2.6%
pow-pow6.0%
sqr-pow6.0%
pow-prod-down24.8%
pow-prod-up24.8%
associate-*r/24.8%
*-commutative24.8%
div-inv24.8%
clear-num24.8%
metadata-eval24.8%
metadata-eval24.8%
Applied egg-rr24.8%
Final simplification55.0%
(FPCore (k n) :precision binary64 (* (sqrt (/ 2.0 k)) (sqrt (* PI n))))
double code(double k, double n) {
return sqrt((2.0 / k)) * sqrt((((double) M_PI) * n));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 / k)) * Math.sqrt((Math.PI * n));
}
def code(k, n): return math.sqrt((2.0 / k)) * math.sqrt((math.pi * n))
function code(k, n) return Float64(sqrt(Float64(2.0 / k)) * sqrt(Float64(pi * n))) end
function tmp = code(k, n) tmp = sqrt((2.0 / k)) * sqrt((pi * n)); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{2}{k}} \cdot \sqrt{\pi \cdot n}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 50.0%
expm1-log1p-u47.3%
expm1-udef47.5%
Applied egg-rr38.1%
expm1-def37.8%
expm1-log1p39.6%
associate-*r*39.6%
*-commutative39.6%
associate-/l*39.6%
associate-/r/39.6%
*-commutative39.6%
Simplified39.6%
sqrt-prod50.1%
*-commutative50.1%
Applied egg-rr50.1%
Final simplification50.1%
(FPCore (k n) :precision binary64 (/ (sqrt (* PI (* 2.0 n))) (sqrt k)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 50.0%
associate-*l/50.1%
*-un-lft-identity50.1%
sqrt-unprod50.1%
*-commutative50.1%
*-commutative50.1%
associate-*r*50.1%
*-commutative50.1%
associate-*r*50.1%
*-commutative50.1%
Applied egg-rr50.1%
Final simplification50.1%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (* PI (/ n k)))))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) * (n / k))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI * (n / k))));
}
def code(k, n): return math.sqrt((2.0 * (math.pi * (n / k))))
function code(k, n) return sqrt(Float64(2.0 * Float64(pi * Float64(n / k)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi * (n / k)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(\pi \cdot \frac{n}{k}\right)}
\end{array}
Initial program 99.5%
add-cube-cbrt98.7%
pow398.8%
associate-*l/98.8%
*-un-lft-identity98.8%
associate-*l*98.8%
div-sub98.8%
metadata-eval98.8%
div-inv98.8%
metadata-eval98.8%
Applied egg-rr98.8%
Taylor expanded in k around 0 39.5%
*-commutative39.5%
sqrt-unprod39.6%
associate-/l*39.6%
Applied egg-rr39.6%
associate-/r/39.6%
Applied egg-rr39.6%
Final simplification39.6%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ n (/ k PI)))))
double code(double k, double n) {
return sqrt((2.0 * (n / (k / ((double) M_PI)))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n / (k / Math.PI))));
}
def code(k, n): return math.sqrt((2.0 * (n / (k / math.pi))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n / (k / pi)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n / N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{n}{\frac{k}{\pi}}}
\end{array}
Initial program 99.5%
add-cube-cbrt98.7%
pow398.8%
associate-*l/98.8%
*-un-lft-identity98.8%
associate-*l*98.8%
div-sub98.8%
metadata-eval98.8%
div-inv98.8%
metadata-eval98.8%
Applied egg-rr98.8%
Taylor expanded in k around 0 39.5%
*-commutative39.5%
sqrt-unprod39.6%
associate-/l*39.6%
Applied egg-rr39.6%
Final simplification39.6%
herbie shell --seed 2023325
(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))))