
(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 (* (* 2.0 n) PI))) (/ (sqrt t_0) (* (sqrt k) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = (2.0 * n) * ((double) M_PI);
return sqrt(t_0) / (sqrt(k) * pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = (2.0 * n) * Math.PI;
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = (2.0 * n) * math.pi return math.sqrt(t_0) / (math.sqrt(k) * math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = (2.0 * n) * pi; tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $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 := \left(2 \cdot n\right) \cdot \pi\\
\frac{\sqrt{t_0}}{\sqrt{k} \cdot {t_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.5%
*-commutative99.5%
associate-*r*99.5%
div-sub99.5%
metadata-eval99.5%
div-inv99.5%
pow-sub99.7%
pow1/299.7%
associate-/l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*r*99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (if (<= k 1.4e-27) (* (pow k -0.5) (sqrt (* (* 2.0 n) PI))) (pow (/ k (pow (* n (* 2.0 PI)) (- 1.0 k))) -0.5)))
double code(double k, double n) {
double tmp;
if (k <= 1.4e-27) {
tmp = pow(k, -0.5) * sqrt(((2.0 * 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 <= 1.4e-27) {
tmp = Math.pow(k, -0.5) * Math.sqrt(((2.0 * 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 <= 1.4e-27: tmp = math.pow(k, -0.5) * math.sqrt(((2.0 * 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 <= 1.4e-27) tmp = Float64((k ^ -0.5) * sqrt(Float64(Float64(2.0 * 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 <= 1.4e-27) tmp = (k ^ -0.5) * sqrt(((2.0 * 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, 1.4e-27], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * Pi), $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 1.4 \cdot 10^{-27}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{\left(2 \cdot n\right) \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 < 1.4e-27Initial program 99.3%
Taylor expanded in k around 0 99.1%
associate-*l/99.2%
*-un-lft-identity99.2%
sqrt-unprod99.4%
*-commutative99.4%
associate-*l*99.4%
sqrt-undiv74.8%
associate-*l*74.8%
*-commutative74.8%
associate-*r*74.8%
Applied egg-rr74.8%
div-inv74.8%
sqrt-prod99.4%
pow1/299.4%
metadata-eval99.4%
pow-pow69.3%
pow1/374.2%
*-commutative74.2%
inv-pow74.2%
sqrt-pow174.3%
metadata-eval74.3%
pow1/369.3%
pow-pow99.4%
metadata-eval99.4%
pow1/299.4%
*-commutative99.4%
associate-*l*99.4%
Applied egg-rr99.4%
*-commutative99.4%
Simplified99.4%
if 1.4e-27 < k Initial program 99.6%
associate-*l/99.6%
*-lft-identity99.6%
sqr-pow99.6%
pow-sqr99.6%
associate-*l*99.6%
*-commutative99.6%
associate-*l/99.6%
associate-/l*99.6%
metadata-eval99.6%
/-rgt-identity99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
div-inv99.6%
div-inv99.6%
metadata-eval99.6%
pow1/299.6%
pow-flip99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Applied egg-rr99.6%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (pow (* 2.0 (* n PI)) (- 0.5 (* k 0.5))) (pow k -0.5)))
double code(double k, double n) {
return pow((2.0 * (n * ((double) M_PI))), (0.5 - (k * 0.5))) * pow(k, -0.5);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (n * Math.PI)), (0.5 - (k * 0.5))) * Math.pow(k, -0.5);
}
def code(k, n): return math.pow((2.0 * (n * math.pi)), (0.5 - (k * 0.5))) * math.pow(k, -0.5)
function code(k, n) return Float64((Float64(2.0 * Float64(n * pi)) ^ Float64(0.5 - Float64(k * 0.5))) * (k ^ -0.5)) end
function tmp = code(k, n) tmp = ((2.0 * (n * pi)) ^ (0.5 - (k * 0.5))) * (k ^ -0.5); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[k, -0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(0.5 - k \cdot 0.5\right)} \cdot {k}^{-0.5}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
sqr-pow99.3%
pow-sqr99.5%
associate-*l*99.5%
*-commutative99.5%
associate-*l/99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
div-inv99.5%
div-inv99.5%
metadata-eval99.5%
pow1/299.5%
pow-flip99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* (* 2.0 n) PI)))
(if (<= k 2.55e-27)
(* (pow k -0.5) (sqrt t_0))
(sqrt (/ (pow t_0 (- 1.0 k)) k)))))
double code(double k, double n) {
double t_0 = (2.0 * n) * ((double) M_PI);
double tmp;
if (k <= 2.55e-27) {
tmp = pow(k, -0.5) * sqrt(t_0);
} else {
tmp = sqrt((pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = (2.0 * n) * Math.PI;
double tmp;
if (k <= 2.55e-27) {
tmp = Math.pow(k, -0.5) * Math.sqrt(t_0);
} else {
tmp = Math.sqrt((Math.pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): t_0 = (2.0 * n) * math.pi tmp = 0 if k <= 2.55e-27: tmp = math.pow(k, -0.5) * math.sqrt(t_0) else: tmp = math.sqrt((math.pow(t_0, (1.0 - k)) / k)) return tmp
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) tmp = 0.0 if (k <= 2.55e-27) tmp = Float64((k ^ -0.5) * sqrt(t_0)); else tmp = sqrt(Float64((t_0 ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) t_0 = (2.0 * n) * pi; tmp = 0.0; if (k <= 2.55e-27) tmp = (k ^ -0.5) * sqrt(t_0); else tmp = sqrt(((t_0 ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]}, If[LessEqual[k, 2.55e-27], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[t$95$0], $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 := \left(2 \cdot n\right) \cdot \pi\\
\mathbf{if}\;k \leq 2.55 \cdot 10^{-27}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{t_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.55e-27Initial program 99.3%
Taylor expanded in k around 0 99.1%
associate-*l/99.2%
*-un-lft-identity99.2%
sqrt-unprod99.4%
*-commutative99.4%
associate-*l*99.4%
sqrt-undiv74.8%
associate-*l*74.8%
*-commutative74.8%
associate-*r*74.8%
Applied egg-rr74.8%
div-inv74.8%
sqrt-prod99.4%
pow1/299.4%
metadata-eval99.4%
pow-pow69.3%
pow1/374.2%
*-commutative74.2%
inv-pow74.2%
sqrt-pow174.3%
metadata-eval74.3%
pow1/369.3%
pow-pow99.4%
metadata-eval99.4%
pow1/299.4%
*-commutative99.4%
associate-*l*99.4%
Applied egg-rr99.4%
*-commutative99.4%
Simplified99.4%
if 2.55e-27 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.6%
*-commutative99.6%
div-inv99.6%
*-commutative99.6%
div-inv99.6%
frac-times99.6%
Applied egg-rr99.6%
Simplified99.6%
Final simplification99.5%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* n PI)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (n * ((double) M_PI))), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (n * Math.PI)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((2.0 * (n * math.pi)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(2.0 * Float64(n * pi)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((2.0 * (n * pi)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(n * Pi), $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(n \cdot \pi\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
sqr-pow99.3%
pow-sqr99.5%
associate-*l*99.5%
*-commutative99.5%
associate-*l/99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (sqrt (* (* 2.0 n) PI))))
double code(double k, double n) {
return pow(k, -0.5) * sqrt(((2.0 * n) * ((double) M_PI)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.sqrt(((2.0 * n) * Math.PI));
}
def code(k, n): return math.pow(k, -0.5) * math.sqrt(((2.0 * n) * math.pi))
function code(k, n) return Float64((k ^ -0.5) * sqrt(Float64(Float64(2.0 * n) * pi))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * sqrt(((2.0 * n) * pi)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot \sqrt{\left(2 \cdot n\right) \cdot \pi}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 51.2%
associate-*l/51.2%
*-un-lft-identity51.2%
sqrt-unprod51.3%
*-commutative51.3%
associate-*l*51.3%
sqrt-undiv40.0%
associate-*l*40.0%
*-commutative40.0%
associate-*r*40.0%
Applied egg-rr40.0%
div-inv40.0%
sqrt-prod51.3%
pow1/251.3%
metadata-eval51.3%
pow-pow36.3%
pow1/338.6%
*-commutative38.6%
inv-pow38.6%
sqrt-pow138.7%
metadata-eval38.7%
pow1/336.3%
pow-pow51.3%
metadata-eval51.3%
pow1/251.3%
*-commutative51.3%
associate-*l*51.3%
Applied egg-rr51.3%
*-commutative51.3%
Simplified51.3%
Final simplification51.3%
(FPCore (k n) :precision binary64 (/ (sqrt (* n (* 2.0 PI))) (sqrt k)))
double code(double k, double n) {
return sqrt((n * (2.0 * ((double) M_PI)))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 * Math.PI))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((n * (2.0 * math.pi))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(n * Float64(2.0 * pi))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n \cdot \left(2 \cdot \pi\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 51.2%
associate-*l/51.2%
*-un-lft-identity51.2%
sqrt-unprod51.3%
*-commutative51.3%
*-commutative51.3%
associate-*r*51.3%
Applied egg-rr51.3%
Final simplification51.3%
(FPCore (k n) :precision binary64 (pow (/ k (* (* 2.0 n) PI)) -0.5))
double code(double k, double n) {
return pow((k / ((2.0 * n) * ((double) M_PI))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k / ((2.0 * n) * Math.PI)), -0.5);
}
def code(k, n): return math.pow((k / ((2.0 * n) * math.pi)), -0.5)
function code(k, n) return Float64(k / Float64(Float64(2.0 * n) * pi)) ^ -0.5 end
function tmp = code(k, n) tmp = (k / ((2.0 * n) * pi)) ^ -0.5; end
code[k_, n_] := N[Power[N[(k / N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{\left(2 \cdot n\right) \cdot \pi}\right)}^{-0.5}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
sqr-pow99.3%
pow-sqr99.5%
associate-*l*99.5%
*-commutative99.5%
associate-*l/99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
div-inv99.5%
div-inv99.5%
metadata-eval99.5%
pow1/299.5%
pow-flip99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Applied egg-rr89.3%
Taylor expanded in k around 0 41.0%
associate-*r*41.0%
*-commutative41.0%
*-commutative41.0%
Simplified41.0%
Final simplification41.0%
(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%
Taylor expanded in k around 0 51.2%
associate-*l/51.2%
*-un-lft-identity51.2%
sqrt-unprod51.3%
*-commutative51.3%
associate-*l*51.3%
sqrt-undiv40.0%
associate-*l*40.0%
*-commutative40.0%
associate-*r*40.0%
Applied egg-rr40.0%
Taylor expanded in n around 0 40.0%
associate-/l*40.0%
Simplified40.0%
Final simplification40.0%
(FPCore (k n) :precision binary64 (sqrt (* n (/ (* 2.0 PI) k))))
double code(double k, double n) {
return sqrt((n * ((2.0 * ((double) M_PI)) / k)));
}
public static double code(double k, double n) {
return Math.sqrt((n * ((2.0 * Math.PI) / k)));
}
def code(k, n): return math.sqrt((n * ((2.0 * math.pi) / k)))
function code(k, n) return sqrt(Float64(n * Float64(Float64(2.0 * pi) / k))) end
function tmp = code(k, n) tmp = sqrt((n * ((2.0 * pi) / k))); end
code[k_, n_] := N[Sqrt[N[(n * N[(N[(2.0 * Pi), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \frac{2 \cdot \pi}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 51.2%
associate-*l/51.2%
*-un-lft-identity51.2%
sqrt-unprod51.3%
*-commutative51.3%
associate-*l*51.3%
sqrt-undiv40.0%
associate-*l*40.0%
*-commutative40.0%
associate-*r*40.0%
Applied egg-rr40.0%
associate-/l*40.0%
associate-/r/40.1%
Applied egg-rr40.1%
Final simplification40.1%
herbie shell --seed 2023318
(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))))