
(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 (/ (pow k -0.5) (pow (* PI (* n 2.0)) (- -0.5 (* k -0.5)))))
double code(double k, double n) {
return pow(k, -0.5) / pow((((double) M_PI) * (n * 2.0)), (-0.5 - (k * -0.5)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow((Math.PI * (n * 2.0)), (-0.5 - (k * -0.5)));
}
def code(k, n): return math.pow(k, -0.5) / math.pow((math.pi * (n * 2.0)), (-0.5 - (k * -0.5)))
function code(k, n) return Float64((k ^ -0.5) / (Float64(pi * Float64(n * 2.0)) ^ Float64(-0.5 - Float64(k * -0.5)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / ((pi * (n * 2.0)) ^ (-0.5 - (k * -0.5))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(-0.5 - N[(k * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(-0.5 - k \cdot -0.5\right)}}
\end{array}
Initial program 99.3%
add-sqr-sqrt99.2%
sqrt-unprod86.2%
*-commutative86.2%
*-commutative86.2%
associate-*r*86.2%
div-sub86.2%
metadata-eval86.2%
div-inv86.3%
*-commutative86.3%
Applied egg-rr86.4%
Simplified86.4%
Applied egg-rr99.3%
unpow-199.3%
associate-*r/99.4%
*-rgt-identity99.4%
*-commutative99.4%
associate-*r*99.4%
*-commutative99.4%
*-commutative99.4%
distribute-neg-in99.4%
metadata-eval99.4%
unsub-neg99.4%
Simplified99.4%
Final simplification99.4%
(FPCore (k n) :precision binary64 (if (<= k 6e-120) (* (sqrt (/ PI k)) (sqrt (* n 2.0))) (/ 1.0 (sqrt (/ k (pow (* PI (* n 2.0)) (- 1.0 k)))))))
double code(double k, double n) {
double tmp;
if (k <= 6e-120) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
} else {
tmp = 1.0 / sqrt((k / pow((((double) M_PI) * (n * 2.0)), (1.0 - k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6e-120) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((n * 2.0));
} else {
tmp = 1.0 / Math.sqrt((k / Math.pow((Math.PI * (n * 2.0)), (1.0 - k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6e-120: tmp = math.sqrt((math.pi / k)) * math.sqrt((n * 2.0)) else: tmp = 1.0 / math.sqrt((k / math.pow((math.pi * (n * 2.0)), (1.0 - k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 6e-120) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))); else tmp = Float64(1.0 / sqrt(Float64(k / (Float64(pi * Float64(n * 2.0)) ^ Float64(1.0 - k))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6e-120) tmp = sqrt((pi / k)) * sqrt((n * 2.0)); else tmp = 1.0 / sqrt((k / ((pi * (n * 2.0)) ^ (1.0 - k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6e-120], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k / N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6 \cdot 10^{-120}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{\frac{k}{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(1 - k\right)}}}}\\
\end{array}
\end{array}
if k < 6.00000000000000022e-120Initial program 99.2%
add-sqr-sqrt99.0%
sqrt-unprod61.8%
*-commutative61.8%
*-commutative61.8%
associate-*r*61.8%
div-sub61.8%
metadata-eval61.8%
div-inv61.8%
*-commutative61.8%
Applied egg-rr62.0%
Simplified62.1%
Taylor expanded in k around 0 62.1%
associate-*r*62.1%
*-commutative62.1%
*-commutative62.1%
Simplified62.1%
Taylor expanded in n around 0 62.1%
associate-/l*62.1%
associate-*r/62.1%
*-commutative62.1%
associate-/l*62.1%
associate-*r/62.1%
Simplified62.1%
*-commutative62.1%
sqrt-prod99.5%
Applied egg-rr99.5%
if 6.00000000000000022e-120 < k Initial program 99.3%
associate-*l/99.4%
*-lft-identity99.4%
sqr-pow99.3%
pow-sqr99.4%
*-commutative99.4%
associate-*l*99.4%
associate-*r/99.4%
*-commutative99.4%
associate-/l*99.4%
metadata-eval99.4%
/-rgt-identity99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
div-inv99.3%
associate-*r*99.3%
*-commutative99.3%
associate-*l*99.3%
div-inv99.3%
metadata-eval99.3%
pow1/299.3%
pow-flip99.4%
metadata-eval99.4%
Applied egg-rr99.4%
metadata-eval99.4%
pow-flip99.3%
pow1/299.3%
div-inv99.4%
Applied egg-rr99.3%
*-commutative99.3%
associate-*r*99.3%
*-commutative99.3%
*-commutative99.3%
Simplified99.3%
Final simplification99.3%
(FPCore (k n) :precision binary64 (if (<= k 5e-12) (* (sqrt n) (sqrt (* 2.0 (/ PI k)))) (sqrt (/ (pow (* n (* PI 2.0)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 5e-12) {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
} else {
tmp = sqrt((pow((n * (((double) M_PI) * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5e-12) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
} else {
tmp = Math.sqrt((Math.pow((n * (Math.PI * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 5e-12: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) else: tmp = math.sqrt((math.pow((n * (math.pi * 2.0)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 5e-12) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); else tmp = sqrt(Float64((Float64(n * Float64(pi * 2.0)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 5e-12) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); else tmp = sqrt((((n * (pi * 2.0)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 5e-12], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5 \cdot 10^{-12}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 4.9999999999999997e-12Initial program 99.0%
add-sqr-sqrt98.8%
sqrt-unprod73.1%
*-commutative73.1%
*-commutative73.1%
associate-*r*73.1%
div-sub73.1%
metadata-eval73.1%
div-inv73.2%
*-commutative73.2%
Applied egg-rr73.3%
Simplified73.5%
Taylor expanded in k around 0 73.3%
associate-*r*73.3%
*-commutative73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in n around 0 73.3%
associate-/l*73.3%
associate-*r/73.3%
*-commutative73.3%
associate-/l*73.3%
associate-*r/73.3%
Simplified73.3%
pow1/273.3%
associate-*l*73.3%
unpow-prod-down98.9%
pow1/298.9%
Applied egg-rr98.9%
unpow1/298.9%
Simplified98.9%
if 4.9999999999999997e-12 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.6%
*-commutative99.6%
*-commutative99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.6%
*-commutative99.6%
Applied egg-rr99.6%
Simplified99.6%
Final simplification99.2%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* n 2.0)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (n * 2.0)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (n * 2.0)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (n * 2.0)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(n * 2.0)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (n * 2.0)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(n \cdot 2\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-*r/99.4%
*-commutative99.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 (* (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.3%
add-sqr-sqrt99.2%
sqrt-unprod86.2%
*-commutative86.2%
*-commutative86.2%
associate-*r*86.2%
div-sub86.2%
metadata-eval86.2%
div-inv86.3%
*-commutative86.3%
Applied egg-rr86.4%
Simplified86.4%
Taylor expanded in k around 0 39.5%
associate-*r*39.5%
*-commutative39.5%
*-commutative39.5%
Simplified39.5%
Taylor expanded in n around 0 39.5%
associate-/l*39.5%
associate-*r/39.5%
*-commutative39.5%
associate-/l*39.5%
associate-*r/39.5%
Simplified39.5%
pow1/239.5%
associate-*l*39.5%
unpow-prod-down52.5%
pow1/252.5%
Applied egg-rr52.5%
unpow1/252.5%
Simplified52.5%
Final simplification52.5%
(FPCore (k n) :precision binary64 (pow (* (/ k PI) (/ 0.5 n)) -0.5))
double code(double k, double n) {
return pow(((k / ((double) M_PI)) * (0.5 / n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k / Math.PI) * (0.5 / n)), -0.5);
}
def code(k, n): return math.pow(((k / math.pi) * (0.5 / n)), -0.5)
function code(k, n) return Float64(Float64(k / pi) * Float64(0.5 / n)) ^ -0.5 end
function tmp = code(k, n) tmp = ((k / pi) * (0.5 / n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k / Pi), $MachinePrecision] * N[(0.5 / n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{\pi} \cdot \frac{0.5}{n}\right)}^{-0.5}
\end{array}
Initial program 99.3%
add-sqr-sqrt99.2%
sqrt-unprod86.2%
*-commutative86.2%
*-commutative86.2%
associate-*r*86.2%
div-sub86.2%
metadata-eval86.2%
div-inv86.3%
*-commutative86.3%
Applied egg-rr86.4%
Simplified86.4%
Taylor expanded in k around 0 39.5%
associate-*r*39.5%
*-commutative39.5%
*-commutative39.5%
Simplified39.5%
clear-num39.5%
sqrt-div40.3%
metadata-eval40.3%
Applied egg-rr40.3%
associate-/r*40.2%
/-rgt-identity40.2%
associate-/l*40.2%
metadata-eval40.2%
associate-/r/40.2%
associate-/l/40.3%
associate-/r*40.3%
Simplified40.3%
inv-pow40.3%
sqrt-pow240.4%
associate-/l/40.4%
metadata-eval40.4%
Applied egg-rr40.4%
associate-*l/40.4%
times-frac40.3%
Simplified40.3%
Final simplification40.3%
(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.3%
add-sqr-sqrt99.2%
sqrt-unprod86.2%
*-commutative86.2%
*-commutative86.2%
associate-*r*86.2%
div-sub86.2%
metadata-eval86.2%
div-inv86.3%
*-commutative86.3%
Applied egg-rr86.4%
Simplified86.4%
Taylor expanded in k around 0 39.5%
associate-*r*39.5%
*-commutative39.5%
*-commutative39.5%
Simplified39.5%
clear-num39.5%
sqrt-div40.3%
metadata-eval40.3%
Applied egg-rr40.3%
associate-/r*40.2%
/-rgt-identity40.2%
associate-/l*40.2%
metadata-eval40.2%
associate-/r/40.2%
associate-/l/40.3%
associate-/r*40.3%
Simplified40.3%
inv-pow40.3%
sqrt-pow240.4%
associate-/l/40.4%
metadata-eval40.4%
Applied egg-rr40.4%
Final simplification40.4%
(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.3%
add-sqr-sqrt99.2%
sqrt-unprod86.2%
*-commutative86.2%
*-commutative86.2%
associate-*r*86.2%
div-sub86.2%
metadata-eval86.2%
div-inv86.3%
*-commutative86.3%
Applied egg-rr86.4%
Simplified86.4%
Taylor expanded in k around 0 39.5%
associate-*r*39.5%
*-commutative39.5%
*-commutative39.5%
Simplified39.5%
Taylor expanded in n around 0 39.5%
associate-/l*39.5%
associate-*r/39.5%
*-commutative39.5%
associate-/l*39.5%
associate-*r/39.5%
Simplified39.5%
Taylor expanded in n around 0 39.5%
*-commutative39.5%
associate-*r/39.5%
Simplified39.5%
Final simplification39.5%
(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.3%
add-sqr-sqrt99.2%
sqrt-unprod86.2%
*-commutative86.2%
*-commutative86.2%
associate-*r*86.2%
div-sub86.2%
metadata-eval86.2%
div-inv86.3%
*-commutative86.3%
Applied egg-rr86.4%
Simplified86.4%
Taylor expanded in k around 0 39.5%
associate-*r*39.5%
*-commutative39.5%
*-commutative39.5%
Simplified39.5%
div-inv39.5%
associate-*r*39.5%
*-commutative39.5%
add-sqr-sqrt39.4%
sqrt-unprod39.4%
sqrt-unprod39.4%
inv-pow39.4%
metadata-eval39.4%
pow-prod-up39.4%
swap-sqr39.4%
pow239.4%
Applied egg-rr39.5%
Final simplification39.5%
herbie shell --seed 2024031
(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))))