
(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 (* (* 2.0 n) PI))) (* (pow k -0.5) (/ (sqrt t_0) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = (2.0 * n) * ((double) M_PI);
return pow(k, -0.5) * (sqrt(t_0) / pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = (2.0 * n) * Math.PI;
return Math.pow(k, -0.5) * (Math.sqrt(t_0) / Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = (2.0 * n) * math.pi return math.pow(k, -0.5) * (math.sqrt(t_0) / math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) return Float64((k ^ -0.5) * Float64(sqrt(t_0) / (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = (2.0 * n) * pi; tmp = (k ^ -0.5) * (sqrt(t_0) / (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]}, N[(N[Power[k, -0.5], $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(2 \cdot n\right) \cdot \pi\\
{k}^{-0.5} \cdot \frac{\sqrt{t_0}}{{t_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.4%
div-sub99.4%
metadata-eval99.4%
pow-sub99.6%
pow1/299.6%
associate-*l*99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
Simplified99.6%
expm1-log1p-u96.3%
expm1-udef76.4%
pow1/276.4%
pow-flip76.4%
metadata-eval76.4%
Applied egg-rr76.4%
expm1-def96.3%
expm1-log1p99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (if (<= k 6e-18) (/ 1.0 (* (sqrt k) (sqrt (/ 0.5 (* n PI))))) (pow (/ k (pow (* n (* 2.0 PI)) (- 1.0 k))) -0.5)))
double code(double k, double n) {
double tmp;
if (k <= 6e-18) {
tmp = 1.0 / (sqrt(k) * sqrt((0.5 / (n * ((double) M_PI)))));
} else {
tmp = pow((k / pow((n * (2.0 * ((double) M_PI))), (1.0 - k))), -0.5);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6e-18) {
tmp = 1.0 / (Math.sqrt(k) * Math.sqrt((0.5 / (n * Math.PI))));
} else {
tmp = Math.pow((k / Math.pow((n * (2.0 * Math.PI)), (1.0 - k))), -0.5);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6e-18: tmp = 1.0 / (math.sqrt(k) * math.sqrt((0.5 / (n * math.pi)))) else: tmp = math.pow((k / math.pow((n * (2.0 * math.pi)), (1.0 - k))), -0.5) return tmp
function code(k, n) tmp = 0.0 if (k <= 6e-18) tmp = Float64(1.0 / Float64(sqrt(k) * sqrt(Float64(0.5 / Float64(n * pi))))); else tmp = Float64(k / (Float64(n * Float64(2.0 * pi)) ^ Float64(1.0 - k))) ^ -0.5; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6e-18) tmp = 1.0 / (sqrt(k) * sqrt((0.5 / (n * pi)))); else tmp = (k / ((n * (2.0 * pi)) ^ (1.0 - k))) ^ -0.5; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6e-18], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] * N[Sqrt[N[(0.5 / N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[N[(k / N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6 \cdot 10^{-18}:\\
\;\;\;\;\frac{1}{\sqrt{k} \cdot \sqrt{\frac{0.5}{n \cdot \pi}}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{k}{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(1 - k\right)}}\right)}^{-0.5}\\
\end{array}
\end{array}
if k < 5.99999999999999966e-18Initial program 99.2%
div-sub99.2%
metadata-eval99.2%
pow-sub99.2%
pow1/299.2%
associate-*l*99.2%
associate-*l*99.2%
div-inv99.2%
metadata-eval99.2%
Applied egg-rr99.2%
*-commutative99.2%
associate-*r*99.2%
*-commutative99.2%
associate-*r*99.2%
*-commutative99.2%
Simplified99.2%
associate-*l/99.4%
*-un-lft-identity99.4%
clear-num99.3%
add-sqr-sqrt98.9%
sqrt-unprod99.3%
Applied egg-rr76.0%
Taylor expanded in k around 0 76.0%
*-commutative76.0%
associate-*l*76.0%
*-commutative76.0%
Simplified76.0%
div-inv76.0%
sqrt-prod99.4%
*-commutative99.4%
associate-*l*99.4%
Applied egg-rr99.4%
associate-/r*99.4%
metadata-eval99.4%
Simplified99.4%
if 5.99999999999999966e-18 < k Initial program 99.7%
associate-*l/99.7%
*-un-lft-identity99.7%
*-commutative99.7%
associate-*r*99.7%
add-sqr-sqrt99.7%
Applied egg-rr99.7%
clear-num99.7%
associate-*r*99.7%
sqrt-div99.7%
pow1/299.7%
pow-flip99.7%
associate-*r*99.7%
*-commutative99.7%
metadata-eval99.7%
Applied egg-rr99.7%
*-commutative99.7%
associate-*l*99.7%
*-commutative99.7%
Simplified99.7%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (pow (* n (* 2.0 PI)) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return pow(k, -0.5) * pow((n * (2.0 * ((double) M_PI))), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow((n * (2.0 * Math.PI)), ((1.0 - k) / 2.0));
}
def code(k, n): return math.pow(k, -0.5) * math.pow((n * (2.0 * math.pi)), ((1.0 - k) / 2.0))
function code(k, n) return Float64((k ^ -0.5) * (Float64(n * Float64(2.0 * pi)) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * ((n * (2.0 * pi)) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.4%
expm1-log1p-u96.3%
expm1-udef76.4%
pow1/276.4%
pow-flip76.4%
metadata-eval76.4%
Applied egg-rr76.3%
expm1-def96.3%
expm1-log1p99.7%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 4.2e-24) (/ 1.0 (* (sqrt k) (sqrt (/ 0.5 (* n PI))))) (sqrt (/ (pow (* (* 2.0 n) PI) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 4.2e-24) {
tmp = 1.0 / (sqrt(k) * sqrt((0.5 / (n * ((double) M_PI)))));
} else {
tmp = sqrt((pow(((2.0 * n) * ((double) M_PI)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 4.2e-24) {
tmp = 1.0 / (Math.sqrt(k) * Math.sqrt((0.5 / (n * Math.PI))));
} else {
tmp = Math.sqrt((Math.pow(((2.0 * n) * Math.PI), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 4.2e-24: tmp = 1.0 / (math.sqrt(k) * math.sqrt((0.5 / (n * math.pi)))) else: tmp = math.sqrt((math.pow(((2.0 * n) * math.pi), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 4.2e-24) tmp = Float64(1.0 / Float64(sqrt(k) * sqrt(Float64(0.5 / Float64(n * pi))))); else tmp = sqrt(Float64((Float64(Float64(2.0 * n) * pi) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 4.2e-24) tmp = 1.0 / (sqrt(k) * sqrt((0.5 / (n * pi)))); else tmp = sqrt(((((2.0 * n) * pi) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 4.2e-24], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] * N[Sqrt[N[(0.5 / N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.2 \cdot 10^{-24}:\\
\;\;\;\;\frac{1}{\sqrt{k} \cdot \sqrt{\frac{0.5}{n \cdot \pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(2 \cdot n\right) \cdot \pi\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 4.1999999999999999e-24Initial program 99.2%
div-sub99.2%
metadata-eval99.2%
pow-sub99.2%
pow1/299.2%
associate-*l*99.2%
associate-*l*99.2%
div-inv99.2%
metadata-eval99.2%
Applied egg-rr99.2%
*-commutative99.2%
associate-*r*99.2%
*-commutative99.2%
associate-*r*99.2%
*-commutative99.2%
Simplified99.2%
associate-*l/99.4%
*-un-lft-identity99.4%
clear-num99.3%
add-sqr-sqrt98.9%
sqrt-unprod99.3%
Applied egg-rr75.6%
Taylor expanded in k around 0 75.6%
*-commutative75.6%
associate-*l*75.6%
*-commutative75.6%
Simplified75.6%
div-inv75.6%
sqrt-prod99.4%
*-commutative99.4%
associate-*l*99.4%
Applied egg-rr99.4%
associate-/r*99.4%
metadata-eval99.4%
Simplified99.4%
if 4.1999999999999999e-24 < k Initial program 99.7%
*-commutative99.7%
*-commutative99.7%
associate-*r*99.7%
div-inv99.7%
expm1-log1p-u99.5%
expm1-udef96.9%
Applied egg-rr96.9%
expm1-def99.5%
expm1-log1p99.6%
*-commutative99.6%
associate-*r*99.6%
Simplified99.6%
Final simplification99.5%
(FPCore (k n) :precision binary64 (/ (pow (* (* 2.0 n) PI) (/ (- 1.0 k) 2.0)) (sqrt k)))
double code(double k, double n) {
return pow(((2.0 * n) * ((double) M_PI)), ((1.0 - k) / 2.0)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow(((2.0 * n) * Math.PI), ((1.0 - k) / 2.0)) / Math.sqrt(k);
}
def code(k, n): return math.pow(((2.0 * n) * math.pi), ((1.0 - k) / 2.0)) / math.sqrt(k)
function code(k, n) return Float64((Float64(Float64(2.0 * n) * pi) ^ Float64(Float64(1.0 - k) / 2.0)) / sqrt(k)) end
function tmp = code(k, n) tmp = (((2.0 * n) * pi) ^ ((1.0 - k) / 2.0)) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\left(2 \cdot n\right) \cdot \pi\right)}^{\left(\frac{1 - k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.4%
associate-*l/99.5%
*-lft-identity99.5%
*-commutative99.5%
associate-*l*99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (/ 1.0 (* (sqrt k) (sqrt (/ 0.5 (* n PI))))))
double code(double k, double n) {
return 1.0 / (sqrt(k) * sqrt((0.5 / (n * ((double) M_PI)))));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) * Math.sqrt((0.5 / (n * Math.PI))));
}
def code(k, n): return 1.0 / (math.sqrt(k) * math.sqrt((0.5 / (n * math.pi))))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) * sqrt(Float64(0.5 / Float64(n * pi))))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) * sqrt((0.5 / (n * pi)))); end
code[k_, n_] := N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] * N[Sqrt[N[(0.5 / N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k} \cdot \sqrt{\frac{0.5}{n \cdot \pi}}}
\end{array}
Initial program 99.4%
div-sub99.4%
metadata-eval99.4%
pow-sub99.6%
pow1/299.6%
associate-*l*99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
Simplified99.6%
associate-*l/99.7%
*-un-lft-identity99.7%
clear-num99.7%
add-sqr-sqrt99.4%
sqrt-unprod99.7%
Applied egg-rr88.6%
Taylor expanded in k around 0 38.4%
*-commutative38.4%
associate-*l*38.4%
*-commutative38.4%
Simplified38.4%
div-inv38.4%
sqrt-prod49.4%
*-commutative49.4%
associate-*l*49.4%
Applied egg-rr49.4%
associate-/r*49.4%
metadata-eval49.4%
Simplified49.4%
Final simplification49.4%
(FPCore (k n) :precision binary64 (pow (* 0.5 (/ k (* n PI))) -0.5))
double code(double k, double n) {
return pow((0.5 * (k / (n * ((double) M_PI)))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((0.5 * (k / (n * Math.PI))), -0.5);
}
def code(k, n): return math.pow((0.5 * (k / (n * math.pi))), -0.5)
function code(k, n) return Float64(0.5 * Float64(k / Float64(n * pi))) ^ -0.5 end
function tmp = code(k, n) tmp = (0.5 * (k / (n * pi))) ^ -0.5; end
code[k_, n_] := N[Power[N[(0.5 * N[(k / N[(n * Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(0.5 \cdot \frac{k}{n \cdot \pi}\right)}^{-0.5}
\end{array}
Initial program 99.4%
div-sub99.4%
metadata-eval99.4%
pow-sub99.6%
pow1/299.6%
associate-*l*99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
Simplified99.6%
associate-*l/99.7%
*-un-lft-identity99.7%
clear-num99.7%
add-sqr-sqrt99.4%
sqrt-unprod99.7%
Applied egg-rr88.6%
Taylor expanded in k around 0 38.4%
*-commutative38.4%
associate-*l*38.4%
*-commutative38.4%
Simplified38.4%
inv-pow38.4%
sqrt-pow238.5%
*-un-lft-identity38.5%
*-commutative38.5%
associate-*l*38.5%
times-frac38.5%
metadata-eval38.5%
metadata-eval38.5%
Applied egg-rr38.5%
Final simplification38.5%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (* n (/ PI k)))))
double code(double k, double n) {
return sqrt((2.0 * (n * (((double) M_PI) / k))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n * (Math.PI / k))));
}
def code(k, n): return math.sqrt((2.0 * (n * (math.pi / k))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n * (pi / k)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(n \cdot \frac{\pi}{k}\right)}
\end{array}
Initial program 99.4%
div-sub99.4%
metadata-eval99.4%
pow-sub99.6%
pow1/299.6%
associate-*l*99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
Simplified99.6%
associate-*l/99.7%
*-un-lft-identity99.7%
clear-num99.7%
add-sqr-sqrt99.4%
sqrt-unprod99.7%
Applied egg-rr88.6%
Taylor expanded in k around 0 38.4%
*-commutative38.4%
associate-*l*38.4%
*-commutative38.4%
Simplified38.4%
expm1-log1p-u36.6%
expm1-udef39.7%
Applied egg-rr39.0%
expm1-def35.9%
expm1-log1p37.7%
associate-/l*37.7%
associate-/r/37.7%
Simplified37.7%
Final simplification37.7%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ (* n PI) k))))
double code(double k, double n) {
return sqrt((2.0 * ((n * ((double) M_PI)) / k)));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * ((n * Math.PI) / k)));
}
def code(k, n): return math.sqrt((2.0 * ((n * math.pi) / k)))
function code(k, n) return sqrt(Float64(2.0 * Float64(Float64(n * pi) / k))) end
function tmp = code(k, n) tmp = sqrt((2.0 * ((n * pi) / k))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(N[(n * Pi), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{n \cdot \pi}{k}}
\end{array}
Initial program 99.4%
div-sub99.4%
metadata-eval99.4%
pow-sub99.6%
pow1/299.6%
associate-*l*99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
Simplified99.6%
associate-*l/99.7%
*-un-lft-identity99.7%
clear-num99.7%
add-sqr-sqrt99.4%
sqrt-unprod99.7%
Applied egg-rr88.6%
Taylor expanded in k around 0 38.4%
*-commutative38.4%
associate-*l*38.4%
*-commutative38.4%
Simplified38.4%
expm1-log1p-u36.6%
expm1-udef39.7%
Applied egg-rr39.0%
expm1-def35.9%
expm1-log1p37.7%
Simplified37.7%
Final simplification37.7%
herbie shell --seed 2023255
(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))))