
(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 11 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.7%
*-commutative99.7%
associate-*r*99.7%
div-sub99.7%
metadata-eval99.7%
div-inv99.7%
pow-sub99.8%
pow1/299.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%
Simplified99.8%
Final simplification99.8%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* 2.0 n)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
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)));
}
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)));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $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(2 \cdot n\right)\\
\frac{\sqrt{t_0}}{\sqrt{k \cdot {t_0}^{k}}}
\end{array}
\end{array}
Initial program 99.7%
*-commutative99.7%
associate-*r*99.7%
div-sub99.7%
metadata-eval99.7%
div-inv99.7%
pow-sub99.8%
pow1/299.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%
Simplified99.8%
div-inv99.7%
pow1/299.7%
pow-unpow99.7%
pow-prod-down99.7%
Applied egg-rr99.7%
associate-*r/99.8%
*-rgt-identity99.8%
unpow1/299.8%
Simplified99.8%
Final simplification99.8%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* 2.0 n))))
(if (<= k 1.7e-16)
(/ (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.7e-16) {
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.7e-16) {
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.7e-16: 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.7e-16) 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.7e-16) 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.7e-16], 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.7 \cdot 10^{-16}:\\
\;\;\;\;\frac{\sqrt{t_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.7e-16Initial program 99.3%
add-sqr-sqrt98.9%
sqrt-unprod68.2%
*-commutative68.2%
div-inv68.2%
*-commutative68.2%
div-inv68.3%
frac-times68.2%
Applied egg-rr68.3%
Simplified68.5%
Taylor expanded in k around 0 68.5%
associate-*r/68.5%
associate-*r*68.5%
*-commutative68.5%
sqrt-div99.5%
Applied egg-rr99.5%
if 1.7e-16 < k Initial program 99.9%
add-sqr-sqrt99.9%
sqrt-unprod99.9%
*-commutative99.9%
div-inv99.9%
*-commutative99.9%
div-inv99.9%
frac-times99.9%
Applied egg-rr99.9%
Simplified99.9%
Final simplification99.7%
(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.7%
associate-*l/99.7%
*-lft-identity99.7%
sqr-pow99.5%
pow-sqr99.7%
associate-*l*99.7%
*-commutative99.7%
associate-*l/99.7%
associate-/l*99.7%
metadata-eval99.7%
/-rgt-identity99.7%
div-sub99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 * (math.pi / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}
\end{array}
Initial program 99.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
associate-/l*33.1%
associate-/r/33.0%
Simplified33.0%
pow1/233.0%
associate-*r*33.0%
unpow-prod-down47.2%
*-commutative47.2%
pow1/247.2%
Applied egg-rr47.2%
unpow1/247.2%
Simplified47.2%
Final simplification47.2%
(FPCore (k n) :precision binary64 (* (sqrt (* PI (/ 2.0 k))) (sqrt n)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 / k))) * sqrt(n);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 / k))) * Math.sqrt(n);
}
def code(k, n): return math.sqrt((math.pi * (2.0 / k))) * math.sqrt(n)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(2.0 / k))) * sqrt(n)) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 / k))) * sqrt(n); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \frac{2}{k}} \cdot \sqrt{n}
\end{array}
Initial program 99.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
associate-/l*33.1%
associate-/r/33.0%
Simplified33.0%
pow1/233.0%
associate-*r*33.0%
unpow-prod-down47.2%
*-commutative47.2%
pow1/247.2%
Applied egg-rr47.2%
unpow1/247.2%
*-lft-identity47.2%
associate-*l/47.2%
associate-*r*47.2%
metadata-eval47.2%
associate-/r/47.2%
remove-double-div47.2%
Simplified47.2%
Final simplification47.2%
(FPCore (k n) :precision binary64 (* (sqrt (/ PI k)) (sqrt (* 2.0 n))))
double code(double k, double n) {
return sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
}
def code(k, n): return math.sqrt((math.pi / k)) * math.sqrt((2.0 * n))
function code(k, n) return Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))) end
function tmp = code(k, n) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}
\end{array}
Initial program 99.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
associate-/l*33.1%
associate-/r/33.0%
Simplified33.0%
sqrt-prod47.3%
*-commutative47.3%
Applied egg-rr47.3%
Final simplification47.3%
(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.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
sqrt-div47.3%
Applied egg-rr47.3%
Final simplification47.3%
(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.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
associate-/l*33.1%
associate-/r/33.0%
Simplified33.0%
associate-*l/33.1%
sqrt-undiv47.3%
clear-num47.2%
*-commutative47.2%
*-commutative47.2%
associate-*r*47.2%
sqrt-undiv34.1%
Applied egg-rr34.1%
Final simplification34.1%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ (/ k (* 2.0 n)) PI))))
double code(double k, double n) {
return 1.0 / sqrt(((k / (2.0 * n)) / ((double) M_PI)));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt(((k / (2.0 * n)) / Math.PI));
}
def code(k, n): return 1.0 / math.sqrt(((k / (2.0 * n)) / math.pi))
function code(k, n) return Float64(1.0 / sqrt(Float64(Float64(k / Float64(2.0 * n)) / pi))) end
function tmp = code(k, n) tmp = 1.0 / sqrt(((k / (2.0 * n)) / pi)); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(N[(k / N[(2.0 * n), $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{\frac{k}{2 \cdot n}}{\pi}}}
\end{array}
Initial program 99.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
associate-/l*33.1%
associate-/r/33.0%
Simplified33.0%
associate-*l/33.1%
sqrt-undiv47.3%
clear-num47.2%
*-commutative47.2%
*-commutative47.2%
associate-*r*47.2%
sqrt-undiv34.1%
Applied egg-rr34.1%
associate-*r*34.1%
associate-/r*34.2%
*-commutative34.2%
Simplified34.2%
Final simplification34.2%
(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.7%
add-sqr-sqrt99.5%
sqrt-unprod85.4%
*-commutative85.4%
div-inv85.4%
*-commutative85.4%
div-inv85.5%
frac-times85.4%
Applied egg-rr85.5%
Simplified85.6%
Taylor expanded in k around 0 33.1%
associate-*r/33.1%
associate-*r*33.1%
*-commutative33.1%
associate-/l*33.1%
associate-/r/33.0%
Simplified33.0%
Taylor expanded in k around 0 33.1%
associate-*l/33.1%
Simplified33.1%
Final simplification33.1%
herbie shell --seed 2023312
(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))))