
(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 (* PI (* n 2.0)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (n * 2.0);
return sqrt(t_0) / sqrt((k * pow(t_0, k)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (n * 2.0);
return Math.sqrt(t_0) / Math.sqrt((k * Math.pow(t_0, k)));
}
def code(k, n): t_0 = math.pi * (n * 2.0) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(pi * Float64(n * 2.0)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = pi * (n * 2.0); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(n \cdot 2\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k \cdot {t\_0}^{k}}}
\end{array}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-un-lft-identity99.4%
associate-*r*99.4%
div-sub99.4%
metadata-eval99.4%
pow-div99.7%
pow1/299.7%
associate-/l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
associate-/l/99.7%
unpow1/299.7%
metadata-eval99.7%
pow-sqr99.6%
fabs-sqr99.6%
pow-sqr99.7%
metadata-eval99.7%
unpow1/299.7%
fabs-neg99.7%
neg-mul-199.7%
rem-square-sqrt0.0%
unpow1/20.0%
metadata-eval0.0%
pow-sqr0.0%
unswap-sqr0.0%
fabs-sqr0.0%
unswap-sqr0.0%
rem-square-sqrt24.4%
pow-sqr24.4%
metadata-eval24.4%
unpow1/224.4%
Simplified99.7%
div-inv99.7%
pow1/299.7%
pow-unpow99.7%
pow-prod-down99.7%
Applied egg-rr99.7%
associate-*r/99.7%
*-rgt-identity99.7%
*-commutative99.7%
unpow1/299.7%
*-commutative99.7%
Simplified99.7%
(FPCore (k n) :precision binary64 (if (<= k 1.08e-30) (* (sqrt (/ PI k)) (sqrt (* n 2.0))) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.08e-30) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
} else {
tmp = sqrt((pow((2.0 * (((double) M_PI) * n)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.08e-30) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((n * 2.0));
} else {
tmp = Math.sqrt((Math.pow((2.0 * (Math.PI * n)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.08e-30: tmp = math.sqrt((math.pi / k)) * math.sqrt((n * 2.0)) else: tmp = math.sqrt((math.pow((2.0 * (math.pi * n)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.08e-30) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))); else tmp = sqrt(Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.08e-30) tmp = sqrt((pi / k)) * sqrt((n * 2.0)); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.08e-30], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.08 \cdot 10^{-30}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.08000000000000005e-30Initial program 99.3%
Taylor expanded in k around 0 76.4%
*-commutative76.4%
associate-/l*76.3%
Simplified76.3%
pow176.3%
*-commutative76.3%
sqrt-unprod76.7%
Applied egg-rr76.7%
unpow176.7%
associate-*l*76.7%
Simplified76.7%
associate-*r*76.7%
div-inv76.6%
sqrt-prod76.3%
*-commutative76.3%
sqrt-prod99.1%
associate-*r*99.1%
sqrt-prod99.3%
*-commutative99.3%
div-inv99.5%
Applied egg-rr99.5%
*-commutative99.5%
Simplified99.5%
if 1.08000000000000005e-30 < k Initial program 99.5%
Applied egg-rr99.5%
distribute-rgt-in99.5%
metadata-eval99.5%
associate-*l*99.5%
metadata-eval99.5%
*-commutative99.5%
neg-mul-199.5%
sub-neg99.5%
*-commutative99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 4.5e-31) (* (sqrt (/ PI k)) (sqrt (* n 2.0))) (sqrt (* n (+ -1.0 (fma 2.0 (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 4.5e-31) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
} else {
tmp = sqrt((n * (-1.0 + fma(2.0, (((double) M_PI) / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 4.5e-31) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))); else tmp = sqrt(Float64(n * Float64(-1.0 + fma(2.0, Float64(pi / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 4.5e-31], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(n * N[(-1.0 + N[(2.0 * N[(Pi / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.5 \cdot 10^{-31}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(-1 + \mathsf{fma}\left(2, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 4.5000000000000004e-31Initial program 99.3%
Taylor expanded in k around 0 76.4%
*-commutative76.4%
associate-/l*76.3%
Simplified76.3%
pow176.3%
*-commutative76.3%
sqrt-unprod76.7%
Applied egg-rr76.7%
unpow176.7%
associate-*l*76.7%
Simplified76.7%
associate-*r*76.7%
div-inv76.6%
sqrt-prod76.3%
*-commutative76.3%
sqrt-prod99.1%
associate-*r*99.1%
sqrt-prod99.3%
*-commutative99.3%
div-inv99.5%
Applied egg-rr99.5%
*-commutative99.5%
Simplified99.5%
if 4.5000000000000004e-31 < k Initial program 99.5%
Taylor expanded in k around 0 11.7%
*-commutative11.7%
associate-/l*11.7%
Simplified11.7%
pow111.7%
*-commutative11.7%
sqrt-unprod11.7%
Applied egg-rr11.7%
unpow111.7%
associate-*l*11.7%
Simplified11.7%
expm1-log1p-u11.6%
expm1-undefine49.7%
*-commutative49.7%
Applied egg-rr49.7%
sub-neg49.7%
metadata-eval49.7%
+-commutative49.7%
log1p-undefine49.7%
rem-exp-log49.8%
+-commutative49.8%
fma-define49.8%
Simplified49.8%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* PI n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (Math.PI * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((2.0 * (math.pi * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((2.0 * (pi * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-lft-identity99.4%
associate-*l*99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
(FPCore (k n) :precision binary64 (* (sqrt (/ PI k)) (sqrt (* n 2.0))))
double code(double k, double n) {
return sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / k)) * Math.sqrt((n * 2.0));
}
def code(k, n): return math.sqrt((math.pi / k)) * math.sqrt((n * 2.0))
function code(k, n) return Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))) end
function tmp = code(k, n) tmp = sqrt((pi / k)) * sqrt((n * 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.7%
*-commutative38.7%
associate-/l*38.7%
Simplified38.7%
pow138.7%
*-commutative38.7%
sqrt-unprod38.9%
Applied egg-rr38.9%
unpow138.9%
associate-*l*38.9%
Simplified38.9%
associate-*r*38.9%
div-inv38.9%
sqrt-prod38.7%
*-commutative38.7%
sqrt-prod48.3%
associate-*r*48.3%
sqrt-prod48.4%
*-commutative48.4%
div-inv48.4%
Applied egg-rr48.4%
*-commutative48.4%
Simplified48.4%
(FPCore (k n) :precision binary64 (* (sqrt (* 2.0 (/ PI k))) (sqrt n)))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) / k))) * sqrt(n);
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI / k))) * Math.sqrt(n);
}
def code(k, n): return math.sqrt((2.0 * (math.pi / k))) * math.sqrt(n)
function code(k, n) return Float64(sqrt(Float64(2.0 * Float64(pi / k))) * sqrt(n)) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi / k))) * sqrt(n); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi}{k}} \cdot \sqrt{n}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.7%
*-commutative38.7%
associate-/l*38.7%
Simplified38.7%
pow138.7%
*-commutative38.7%
sqrt-unprod38.9%
Applied egg-rr38.9%
unpow138.9%
associate-*l*38.9%
Simplified38.9%
*-commutative38.9%
sqrt-prod48.4%
*-commutative48.4%
Applied egg-rr48.4%
(FPCore (k n) :precision binary64 (pow (* k (/ (/ 0.5 PI) n)) -0.5))
double code(double k, double n) {
return pow((k * ((0.5 / ((double) M_PI)) / n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k * ((0.5 / Math.PI) / n)), -0.5);
}
def code(k, n): return math.pow((k * ((0.5 / math.pi) / n)), -0.5)
function code(k, n) return Float64(k * Float64(Float64(0.5 / pi) / n)) ^ -0.5 end
function tmp = code(k, n) tmp = (k * ((0.5 / pi) / n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(k * N[(N[(0.5 / Pi), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(k \cdot \frac{\frac{0.5}{\pi}}{n}\right)}^{-0.5}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.7%
*-commutative38.7%
associate-/l*38.7%
Simplified38.7%
pow138.7%
*-commutative38.7%
sqrt-unprod38.9%
Applied egg-rr38.9%
unpow138.9%
associate-*l*38.9%
Simplified38.9%
associate-*r*38.9%
div-inv38.9%
sqrt-prod38.7%
*-commutative38.7%
sqrt-unprod38.9%
associate-*r*38.8%
associate-*r*38.8%
associate-*r*38.8%
*-commutative38.8%
div-inv38.9%
clear-num38.9%
sqrt-div39.8%
metadata-eval39.8%
*-un-lft-identity39.8%
*-commutative39.8%
associate-*r*39.8%
times-frac39.7%
metadata-eval39.7%
*-commutative39.7%
Applied egg-rr39.7%
*-un-lft-identity39.7%
pow1/239.7%
pow-flip39.8%
associate-*r/39.8%
times-frac39.8%
metadata-eval39.8%
Applied egg-rr39.8%
*-lft-identity39.8%
*-commutative39.8%
times-frac39.8%
associate-*r/39.8%
*-commutative39.8%
associate-/r*39.8%
Simplified39.8%
(FPCore (k n) :precision binary64 (pow (* 0.5 (/ k (* PI n))) -0.5))
double code(double k, double n) {
return pow((0.5 * (k / (((double) M_PI) * n))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((0.5 * (k / (Math.PI * n))), -0.5);
}
def code(k, n): return math.pow((0.5 * (k / (math.pi * n))), -0.5)
function code(k, n) return Float64(0.5 * Float64(k / Float64(pi * n))) ^ -0.5 end
function tmp = code(k, n) tmp = (0.5 * (k / (pi * n))) ^ -0.5; end
code[k_, n_] := N[Power[N[(0.5 * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(0.5 \cdot \frac{k}{\pi \cdot n}\right)}^{-0.5}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.7%
*-commutative38.7%
associate-/l*38.7%
Simplified38.7%
pow138.7%
*-commutative38.7%
sqrt-unprod38.9%
Applied egg-rr38.9%
unpow138.9%
associate-*l*38.9%
Simplified38.9%
associate-*r*38.9%
div-inv38.9%
sqrt-prod38.7%
*-commutative38.7%
sqrt-unprod38.9%
associate-*r*38.8%
associate-*r*38.8%
associate-*r*38.8%
*-commutative38.8%
div-inv38.9%
clear-num38.9%
sqrt-div39.8%
metadata-eval39.8%
*-un-lft-identity39.8%
*-commutative39.8%
associate-*r*39.8%
times-frac39.7%
metadata-eval39.7%
*-commutative39.7%
Applied egg-rr39.7%
*-un-lft-identity39.7%
pow1/239.7%
pow-flip39.8%
associate-*r/39.8%
times-frac39.8%
metadata-eval39.8%
Applied egg-rr39.8%
*-lft-identity39.8%
times-frac39.8%
*-commutative39.8%
associate-*r/39.8%
Simplified39.8%
Final simplification39.8%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ PI (/ k n)))))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) / (k / n))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI / (k / n))));
}
def code(k, n): return math.sqrt((2.0 * (math.pi / (k / n))))
function code(k, n) return sqrt(Float64(2.0 * Float64(pi / Float64(k / n)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi / (k / n)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(Pi / N[(k / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi}{\frac{k}{n}}}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.7%
*-commutative38.7%
associate-/l*38.7%
Simplified38.7%
pow138.7%
*-commutative38.7%
sqrt-unprod38.9%
Applied egg-rr38.9%
unpow138.9%
associate-*l*38.9%
Simplified38.9%
associate-*r*38.9%
div-inv38.9%
sqrt-prod38.7%
*-commutative38.7%
*-un-lft-identity38.7%
sqrt-unprod38.9%
div-inv38.9%
clear-num38.8%
un-div-inv38.9%
Applied egg-rr38.9%
*-lft-identity38.9%
associate-/r/38.9%
Simplified38.9%
*-commutative38.9%
clear-num38.9%
un-div-inv38.9%
Applied egg-rr38.9%
(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.4%
Taylor expanded in k around 0 38.7%
*-commutative38.7%
associate-/l*38.7%
Simplified38.7%
pow138.7%
*-commutative38.7%
sqrt-unprod38.9%
Applied egg-rr38.9%
unpow138.9%
associate-*l*38.9%
Simplified38.9%
associate-*r*38.9%
div-inv38.9%
sqrt-prod38.7%
*-commutative38.7%
*-un-lft-identity38.7%
sqrt-unprod38.9%
div-inv38.9%
clear-num38.8%
un-div-inv38.9%
Applied egg-rr38.9%
*-lft-identity38.9%
associate-/r/38.9%
Simplified38.9%
Final simplification38.9%
herbie shell --seed 2024160
(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))))