
(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 (* 2.0 n))))
(if (<= k 2e-38)
(* (sqrt t_0) (pow k -0.5))
(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 <= 2e-38) {
tmp = sqrt(t_0) * pow(k, -0.5);
} 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 <= 2e-38) {
tmp = Math.sqrt(t_0) * Math.pow(k, -0.5);
} 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 <= 2e-38: tmp = math.sqrt(t_0) * math.pow(k, -0.5) 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 <= 2e-38) tmp = Float64(sqrt(t_0) * (k ^ -0.5)); 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 <= 2e-38) tmp = sqrt(t_0) * (k ^ -0.5); 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, 2e-38], N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Power[k, -0.5], $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 \cdot 10^{-38}:\\
\;\;\;\;\sqrt{t_0} \cdot {k}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.9999999999999999e-38Initial program 99.3%
associate-*l/99.4%
*-lft-identity99.4%
*-commutative99.4%
associate-*l*99.4%
Simplified99.4%
div-inv99.3%
*-commutative99.3%
pow1/299.3%
pow-flip99.5%
metadata-eval99.5%
add-sqr-sqrt99.1%
sqrt-unprod99.5%
associate-*r*99.5%
*-commutative99.5%
associate-*r*99.5%
*-commutative99.5%
pow-prod-up99.5%
associate-*l*99.5%
Applied egg-rr99.5%
Taylor expanded in k around 0 99.5%
associate-*r*99.5%
*-commutative99.5%
*-commutative99.5%
Simplified99.5%
if 1.9999999999999999e-38 < k Initial program 99.7%
*-commutative99.7%
*-commutative99.7%
associate-*r*99.7%
div-inv99.7%
expm1-log1p-u99.3%
expm1-udef95.8%
Applied egg-rr95.8%
expm1-def99.3%
expm1-log1p99.7%
*-commutative99.7%
associate-*r*99.7%
Simplified99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (sqrt (* PI (* 2.0 n))) (- 1.0 k)) (sqrt k)))
double code(double k, double n) {
return pow(sqrt((((double) M_PI) * (2.0 * n))), (1.0 - k)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow(Math.sqrt((Math.PI * (2.0 * n))), (1.0 - k)) / Math.sqrt(k);
}
def code(k, n): return math.pow(math.sqrt((math.pi * (2.0 * n))), (1.0 - k)) / math.sqrt(k)
function code(k, n) return Float64((sqrt(Float64(pi * Float64(2.0 * n))) ^ Float64(1.0 - k)) / sqrt(k)) end
function tmp = code(k, n) tmp = (sqrt((pi * (2.0 * n))) ^ (1.0 - k)) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\sqrt{\pi \cdot \left(2 \cdot n\right)}\right)}^{\left(1 - k\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
inv-pow99.5%
pow1/299.5%
pow-pow99.6%
add-exp-log95.8%
pow-exp95.8%
metadata-eval95.8%
Applied egg-rr95.8%
pow-to-exp99.6%
metadata-eval99.6%
pow-div99.5%
Applied egg-rr99.5%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
sqrt-pow199.5%
add-sqr-sqrt99.4%
sqrt-unprod99.1%
sqrt-prod88.8%
pow-div88.9%
metadata-eval88.9%
pow-div88.9%
metadata-eval88.9%
pow-prod-up89.0%
metadata-eval89.0%
inv-pow89.0%
div-inv89.4%
Applied egg-rr99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (/ (- 1.0 k) 2.0)) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), ((1.0 - k) / 2.0)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), ((1.0 - k) / 2.0)) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), ((1.0 - k) / 2.0)) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(Float64(1.0 - k) / 2.0)) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ ((1.0 - k) / 2.0)) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(\frac{1 - k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (sqrt 2.0) (sqrt (/ k (* PI n)))))
double code(double k, double n) {
return sqrt(2.0) / sqrt((k / (((double) M_PI) * n)));
}
public static double code(double k, double n) {
return Math.sqrt(2.0) / Math.sqrt((k / (Math.PI * n)));
}
def code(k, n): return math.sqrt(2.0) / math.sqrt((k / (math.pi * n)))
function code(k, n) return Float64(sqrt(2.0) / sqrt(Float64(k / Float64(pi * n)))) end
function tmp = code(k, n) tmp = sqrt(2.0) / sqrt((k / (pi * n))); end
code[k_, n_] := N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2}}{\sqrt{\frac{k}{\pi \cdot n}}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
expm1-log1p-u52.1%
expm1-udef51.6%
Applied egg-rr42.5%
expm1-def42.9%
expm1-log1p45.1%
associate-/l*45.0%
*-commutative45.0%
associate-/r*45.1%
Simplified45.1%
sqrt-div45.9%
associate-/l/45.9%
Applied egg-rr45.9%
Final simplification45.9%
(FPCore (k n) :precision binary64 (/ (sqrt 2.0) (sqrt (/ (/ k n) PI))))
double code(double k, double n) {
return sqrt(2.0) / sqrt(((k / n) / ((double) M_PI)));
}
public static double code(double k, double n) {
return Math.sqrt(2.0) / Math.sqrt(((k / n) / Math.PI));
}
def code(k, n): return math.sqrt(2.0) / math.sqrt(((k / n) / math.pi))
function code(k, n) return Float64(sqrt(2.0) / sqrt(Float64(Float64(k / n) / pi))) end
function tmp = code(k, n) tmp = sqrt(2.0) / sqrt(((k / n) / pi)); end
code[k_, n_] := N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(N[(k / n), $MachinePrecision] / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2}}{\sqrt{\frac{\frac{k}{n}}{\pi}}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
expm1-log1p-u52.1%
expm1-udef51.6%
Applied egg-rr42.5%
expm1-def42.9%
expm1-log1p45.1%
associate-/l*45.0%
*-commutative45.0%
associate-/r*45.1%
Simplified45.1%
sqrt-div45.9%
associate-/l/45.9%
Applied egg-rr45.9%
associate-/l/45.9%
Simplified45.9%
Final simplification45.9%
(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%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
metadata-eval55.3%
sqrt-pow255.2%
inv-pow55.2%
associate-*r*55.2%
*-commutative55.2%
sqrt-prod55.2%
*-commutative55.2%
associate-*l/55.2%
*-un-lft-identity55.2%
sqrt-unprod55.3%
*-commutative55.3%
associate-*l*55.3%
*-commutative55.3%
associate-*r*55.3%
associate-*r*55.3%
*-commutative55.3%
associate-*l*55.3%
Applied egg-rr55.3%
associate-*r*55.3%
*-commutative55.3%
associate-*r*55.3%
Simplified55.3%
Final simplification55.3%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ (/ k (* PI n)) 2.0))))
double code(double k, double n) {
return 1.0 / sqrt(((k / (((double) M_PI) * n)) / 2.0));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt(((k / (Math.PI * n)) / 2.0));
}
def code(k, n): return 1.0 / math.sqrt(((k / (math.pi * n)) / 2.0))
function code(k, n) return Float64(1.0 / sqrt(Float64(Float64(k / Float64(pi * n)) / 2.0))) end
function tmp = code(k, n) tmp = 1.0 / sqrt(((k / (pi * n)) / 2.0)); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{\frac{k}{\pi \cdot n}}{2}}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
expm1-log1p-u52.1%
expm1-udef51.6%
Applied egg-rr42.5%
expm1-def42.9%
expm1-log1p45.1%
associate-/l*45.0%
*-commutative45.0%
associate-/r*45.1%
Simplified45.1%
clear-num45.1%
sqrt-div45.9%
metadata-eval45.9%
associate-/l/45.9%
Applied egg-rr45.9%
Final simplification45.9%
(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%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
expm1-log1p-u52.1%
expm1-udef51.6%
Applied egg-rr42.5%
expm1-def42.9%
expm1-log1p45.1%
associate-/l*45.0%
*-commutative45.0%
associate-/r*45.1%
Simplified45.1%
Taylor expanded in k around 0 45.1%
associate-/l*45.0%
Simplified45.0%
Final simplification45.0%
(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.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
expm1-log1p-u52.1%
expm1-udef51.6%
Applied egg-rr42.5%
expm1-def42.9%
expm1-log1p45.1%
associate-/l*45.0%
*-commutative45.0%
associate-/r*45.1%
Simplified45.1%
Taylor expanded in k around 0 45.1%
*-commutative45.1%
associate-/l*45.1%
Simplified45.1%
Final simplification45.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 * Float64(2.0 * n)) / k)) end
function tmp = code(k, n) tmp = sqrt(((pi * (2.0 * n)) / k)); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot \left(2 \cdot n\right)}{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*l*99.6%
Simplified99.6%
div-inv99.5%
*-commutative99.5%
pow1/299.5%
pow-flip99.6%
metadata-eval99.6%
add-sqr-sqrt99.4%
sqrt-unprod99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
pow-prod-up99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in k around 0 55.3%
associate-*r*55.3%
*-commutative55.3%
*-commutative55.3%
Simplified55.3%
expm1-log1p-u52.1%
expm1-udef51.6%
Applied egg-rr42.5%
expm1-def42.9%
expm1-log1p45.1%
associate-*r*45.1%
*-commutative45.1%
associate-*r*45.1%
Simplified45.1%
Final simplification45.1%
herbie shell --seed 2023256
(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))))