
(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 9 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 (* PI (* 2.0 n)))) (/ (sqrt t_0) (* (sqrt k) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return sqrt(t_0) / (sqrt(k) * pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / (math.sqrt(k) * math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[(N[Sqrt[k], $MachinePrecision] * N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\frac{\sqrt{t_0}}{\sqrt{k} \cdot {t_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.5%
unpow-prod-down68.9%
unpow-prod-down99.5%
div-sub99.5%
metadata-eval99.5%
pow-sub99.7%
pow1/299.7%
frac-times99.8%
*-un-lft-identity99.8%
associate-*l*99.8%
associate-*l*99.8%
div-inv99.8%
metadata-eval99.8%
Applied egg-rr99.8%
associate-*r*99.8%
*-commutative99.8%
associate-*l*99.8%
associate-*r*99.8%
*-commutative99.8%
associate-*l*99.8%
*-commutative99.8%
Simplified99.8%
Final simplification99.8%
(FPCore (k n) :precision binary64 (if (<= k 5.5e-17) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (/ 1.0 (sqrt (/ k (pow (* n (* PI 2.0)) (- 1.0 k)))))))
double code(double k, double n) {
double tmp;
if (k <= 5.5e-17) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = 1.0 / sqrt((k / pow((n * (((double) M_PI) * 2.0)), (1.0 - k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5.5e-17) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = 1.0 / Math.sqrt((k / Math.pow((n * (Math.PI * 2.0)), (1.0 - k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5.5e-17: tmp = math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k) else: tmp = 1.0 / math.sqrt((k / math.pow((n * (math.pi * 2.0)), (1.0 - k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 5.5e-17) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = Float64(1.0 / sqrt(Float64(k / (Float64(n * Float64(pi * 2.0)) ^ Float64(1.0 - k))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5.5e-17) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); else tmp = 1.0 / sqrt((k / ((n * (pi * 2.0)) ^ (1.0 - k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5.5e-17], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k / N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5.5 \cdot 10^{-17}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{\frac{k}{{\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(1 - k\right)}}}}\\
\end{array}
\end{array}
if k < 5.50000000000000001e-17Initial program 99.4%
Taylor expanded in k around 0 99.1%
associate-*l/99.3%
*-commutative99.3%
pow1/299.3%
metadata-eval99.3%
pow1/299.3%
metadata-eval99.3%
pow-prod-down99.5%
*-commutative99.5%
associate-*l*99.5%
*-commutative99.5%
metadata-eval99.5%
pow1/299.4%
*-un-lft-identity99.4%
associate-*l*99.4%
Applied egg-rr99.4%
if 5.50000000000000001e-17 < k Initial program 99.6%
*-commutative99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.7%
expm1-log1p-u99.6%
expm1-udef97.7%
Applied egg-rr97.7%
expm1-def99.6%
expm1-log1p99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
clear-num99.6%
sqrt-div99.6%
metadata-eval99.6%
associate-*r*99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* 2.0 n))))
(if (<= k 2.4e-19)
(/ (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 <= 2.4e-19) {
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 <= 2.4e-19) {
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 <= 2.4e-19: 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 <= 2.4e-19) 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 <= 2.4e-19) 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, 2.4e-19], 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 2.4 \cdot 10^{-19}:\\
\;\;\;\;\frac{\sqrt{t_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.40000000000000023e-19Initial program 99.4%
Taylor expanded in k around 0 99.1%
associate-*l/99.3%
*-commutative99.3%
pow1/299.3%
metadata-eval99.3%
pow1/299.3%
metadata-eval99.3%
pow-prod-down99.5%
*-commutative99.5%
associate-*l*99.5%
*-commutative99.5%
metadata-eval99.5%
pow1/299.4%
*-un-lft-identity99.4%
associate-*l*99.4%
Applied egg-rr99.4%
if 2.40000000000000023e-19 < k Initial program 99.6%
*-commutative99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.7%
expm1-log1p-u99.6%
expm1-udef97.7%
Applied egg-rr97.7%
expm1-def99.6%
expm1-log1p99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (* n (* PI 2.0)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((n * (((double) M_PI) * 2.0)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((n * (Math.PI * 2.0)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((n * (math.pi * 2.0)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(n * Float64(pi * 2.0)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((n * (pi * 2.0)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(n * N[(Pi * 2.0), $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(\pi \cdot 2\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
sqr-pow99.4%
pow-sqr99.6%
*-commutative99.6%
associate-*l/99.6%
associate-/l*99.6%
metadata-eval99.6%
/-rgt-identity99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 1.05e+236) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (cbrt (pow (* 2.0 (* PI (/ n k))) 1.5))))
double code(double k, double n) {
double tmp;
if (k <= 1.05e+236) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = cbrt(pow((2.0 * (((double) M_PI) * (n / k))), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.05e+236) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = Math.cbrt(Math.pow((2.0 * (Math.PI * (n / k))), 1.5));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 1.05e+236) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = cbrt((Float64(2.0 * Float64(pi * Float64(n / k))) ^ 1.5)); end return tmp end
code[k_, n_] := If[LessEqual[k, 1.05e+236], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(2.0 * N[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.05 \cdot 10^{+236}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(2 \cdot \left(\pi \cdot \frac{n}{k}\right)\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 1.05000000000000003e236Initial program 99.5%
Taylor expanded in k around 0 50.6%
associate-*l/50.7%
*-commutative50.7%
pow1/250.7%
metadata-eval50.7%
pow1/250.7%
metadata-eval50.7%
pow-prod-down50.7%
*-commutative50.7%
associate-*l*50.7%
*-commutative50.7%
metadata-eval50.7%
pow1/250.7%
*-un-lft-identity50.7%
associate-*l*50.7%
Applied egg-rr50.7%
if 1.05000000000000003e236 < k Initial program 100.0%
*-commutative100.0%
div-sub100.0%
metadata-eval100.0%
div-inv100.0%
expm1-log1p-u100.0%
expm1-udef100.0%
Applied egg-rr100.0%
expm1-def100.0%
expm1-log1p100.0%
associate-*r*100.0%
*-commutative100.0%
associate-*l*100.0%
Simplified100.0%
sub-neg100.0%
unpow-prod-up100.0%
pow1100.0%
associate-*r*100.0%
associate-*r*100.0%
Applied egg-rr100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
associate-/r/2.6%
Simplified2.6%
add-cbrt-cube15.2%
add-sqr-sqrt15.2%
pow115.2%
pow1/215.2%
pow-prod-up15.2%
*-commutative15.2%
metadata-eval15.2%
Applied egg-rr15.2%
Final simplification45.5%
(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 43.5%
associate-*l/43.6%
*-commutative43.6%
pow1/243.6%
metadata-eval43.6%
pow1/243.6%
metadata-eval43.6%
pow-prod-down43.6%
*-commutative43.6%
associate-*l*43.6%
*-commutative43.6%
metadata-eval43.6%
pow1/243.6%
*-un-lft-identity43.6%
associate-*l*43.6%
Applied egg-rr43.6%
Final simplification43.6%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ k (* n (* PI 2.0))))))
double code(double k, double n) {
return 1.0 / sqrt((k / (n * (((double) M_PI) * 2.0))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((k / (n * (Math.PI * 2.0))));
}
def code(k, n): return 1.0 / math.sqrt((k / (n * (math.pi * 2.0))))
function code(k, n) return Float64(1.0 / sqrt(Float64(k / Float64(n * Float64(pi * 2.0))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((k / (n * (pi * 2.0)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(k / N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{k}{n \cdot \left(\pi \cdot 2\right)}}}
\end{array}
Initial program 99.5%
*-commutative99.5%
div-sub99.5%
metadata-eval99.5%
div-inv99.6%
expm1-log1p-u97.1%
expm1-udef87.6%
Applied egg-rr79.1%
expm1-def88.6%
expm1-log1p90.1%
associate-*r*90.1%
*-commutative90.1%
associate-*l*90.1%
Simplified90.1%
clear-num90.1%
sqrt-div91.5%
metadata-eval91.5%
associate-*r*91.5%
Applied egg-rr91.5%
Taylor expanded in k around 0 35.5%
associate-*r*35.5%
*-commutative35.5%
associate-*l*35.5%
Simplified35.5%
Final simplification35.5%
(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%
*-commutative99.5%
div-sub99.5%
metadata-eval99.5%
div-inv99.6%
expm1-log1p-u97.1%
expm1-udef87.6%
Applied egg-rr79.1%
expm1-def88.6%
expm1-log1p90.1%
associate-*r*90.1%
*-commutative90.1%
associate-*l*90.1%
Simplified90.1%
sub-neg90.1%
unpow-prod-up90.3%
pow190.3%
associate-*r*90.3%
associate-*r*90.3%
Applied egg-rr90.3%
Taylor expanded in k around 0 34.1%
associate-/l*34.1%
associate-/r/34.1%
Simplified34.1%
Final simplification34.1%
(FPCore (k n) :precision binary64 (sqrt (* (* PI 2.0) (/ n k))))
double code(double k, double n) {
return sqrt(((((double) M_PI) * 2.0) * (n / k)));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI * 2.0) * (n / k)));
}
def code(k, n): return math.sqrt(((math.pi * 2.0) * (n / k)))
function code(k, n) return sqrt(Float64(Float64(pi * 2.0) * Float64(n / k))) end
function tmp = code(k, n) tmp = sqrt(((pi * 2.0) * (n / k))); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * 2.0), $MachinePrecision] * N[(n / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\pi \cdot 2\right) \cdot \frac{n}{k}}
\end{array}
Initial program 99.5%
*-commutative99.5%
div-sub99.5%
metadata-eval99.5%
div-inv99.6%
expm1-log1p-u97.1%
expm1-udef87.6%
Applied egg-rr79.1%
expm1-def88.6%
expm1-log1p90.1%
associate-*r*90.1%
*-commutative90.1%
associate-*l*90.1%
Simplified90.1%
sub-neg90.1%
unpow-prod-up90.3%
pow190.3%
associate-*r*90.3%
associate-*r*90.3%
Applied egg-rr90.3%
Taylor expanded in k around 0 34.1%
associate-/l*34.1%
associate-/r/34.1%
Simplified34.1%
Taylor expanded in n around 0 34.1%
*-commutative34.1%
associate-*r/34.1%
associate-*r*34.1%
Simplified34.1%
Final simplification34.1%
herbie shell --seed 2023279
(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))))