
(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 12 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) (pow t_0 (* k 0.5))) (sqrt k))))
double code(double k, double n) {
double t_0 = (2.0 * n) * ((double) M_PI);
return (sqrt(t_0) / pow(t_0, (k * 0.5))) / sqrt(k);
}
public static double code(double k, double n) {
double t_0 = (2.0 * n) * Math.PI;
return (Math.sqrt(t_0) / Math.pow(t_0, (k * 0.5))) / Math.sqrt(k);
}
def code(k, n): t_0 = (2.0 * n) * math.pi return (math.sqrt(t_0) / math.pow(t_0, (k * 0.5))) / math.sqrt(k)
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) return Float64(Float64(sqrt(t_0) / (t_0 ^ Float64(k * 0.5))) / sqrt(k)) end
function tmp = code(k, n) t_0 = (2.0 * n) * pi; tmp = (sqrt(t_0) / (t_0 ^ (k * 0.5))) / sqrt(k); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]}, N[(N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(2 \cdot n\right) \cdot \pi\\
\frac{\frac{\sqrt{t\_0}}{{t\_0}^{\left(k \cdot 0.5\right)}}}{\sqrt{k}}
\end{array}
\end{array}
Initial program 99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
pow-div99.7%
pow1/299.7%
associate-/l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
remove-double-neg99.7%
*-commutative99.7%
distribute-neg-frac99.7%
distribute-frac-neg299.7%
distribute-lft-neg-in99.7%
associate-/r*99.7%
Simplified99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* (* 2.0 n) PI))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
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)));
}
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)));
}
def code(k, n): t_0 = (2.0 * n) * math.pi return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(Float64(2.0 * n) * pi) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = (2.0 * n) * pi; tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * n), $MachinePrecision] * Pi), $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 := \left(2 \cdot n\right) \cdot \pi\\
\frac{\sqrt{t\_0}}{\sqrt{k \cdot {t\_0}^{k}}}
\end{array}
\end{array}
Initial program 99.6%
associate-*l/99.6%
*-lft-identity99.6%
associate-*l*99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
div-inv99.6%
div-inv99.6%
metadata-eval99.6%
inv-pow99.6%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
Applied egg-rr99.7%
Final simplification99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* (* 2.0 n) PI)))
(if (<= k 4.2e-39)
(/ (sqrt t_0) (sqrt k))
(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 <= 4.2e-39) {
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 = (2.0 * n) * Math.PI;
double tmp;
if (k <= 4.2e-39) {
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 = (2.0 * n) * math.pi tmp = 0 if k <= 4.2e-39: 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(Float64(2.0 * n) * pi) tmp = 0.0 if (k <= 4.2e-39) 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 = (2.0 * n) * pi; tmp = 0.0; if (k <= 4.2e-39) 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[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]}, If[LessEqual[k, 4.2e-39], 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 := \left(2 \cdot n\right) \cdot \pi\\
\mathbf{if}\;k \leq 4.2 \cdot 10^{-39}:\\
\;\;\;\;\frac{\sqrt{t\_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t\_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 4.19999999999999987e-39Initial program 99.4%
Taylor expanded in k around 0 72.2%
associate-/l*72.1%
Simplified72.1%
*-commutative72.1%
sqrt-prod98.3%
associate-*r*98.2%
sqrt-prod98.6%
div-inv98.6%
sqrt-prod98.2%
metadata-eval98.2%
add-sqr-sqrt98.2%
frac-times98.2%
sqrt-unprod98.9%
add-sqr-sqrt99.0%
associate-*l*99.0%
sqrt-prod99.4%
div-inv99.5%
*-commutative99.5%
Applied egg-rr99.5%
if 4.19999999999999987e-39 < k Initial program 99.7%
add-sqr-sqrt99.6%
sqrt-unprod99.7%
*-commutative99.7%
associate-*r*99.7%
div-sub99.7%
metadata-eval99.7%
div-inv99.7%
*-commutative99.7%
Applied egg-rr99.7%
Simplified99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 3.8e+39) (/ (sqrt (* (* 2.0 n) PI)) (sqrt k)) (sqrt (+ -1.0 (fma n (* PI (/ 2.0 k)) 1.0)))))
double code(double k, double n) {
double tmp;
if (k <= 3.8e+39) {
tmp = sqrt(((2.0 * n) * ((double) M_PI))) / sqrt(k);
} else {
tmp = sqrt((-1.0 + fma(n, (((double) M_PI) * (2.0 / k)), 1.0)));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 3.8e+39) tmp = Float64(sqrt(Float64(Float64(2.0 * n) * pi)) / sqrt(k)); else tmp = sqrt(Float64(-1.0 + fma(n, Float64(pi * Float64(2.0 / k)), 1.0))); end return tmp end
code[k_, n_] := If[LessEqual[k, 3.8e+39], N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(-1.0 + N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.8 \cdot 10^{+39}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot n\right) \cdot \pi}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-1 + \mathsf{fma}\left(n, \pi \cdot \frac{2}{k}, 1\right)}\\
\end{array}
\end{array}
if k < 3.7999999999999998e39Initial program 99.2%
Taylor expanded in k around 0 68.0%
associate-/l*67.9%
Simplified67.9%
*-commutative67.9%
sqrt-prod89.1%
associate-*r*89.0%
sqrt-prod89.3%
div-inv89.3%
sqrt-prod88.9%
metadata-eval88.9%
add-sqr-sqrt88.9%
frac-times88.9%
sqrt-unprod89.5%
add-sqr-sqrt89.6%
associate-*l*89.6%
sqrt-prod90.0%
div-inv90.0%
*-commutative90.0%
Applied egg-rr90.0%
if 3.7999999999999998e39 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
sqrt-unprod2.6%
*-commutative2.6%
associate-*l*2.6%
*-commutative2.6%
Applied egg-rr2.6%
unpow12.6%
associate-*l/2.6%
associate-/l*2.6%
Simplified2.6%
expm1-log1p-u2.6%
expm1-undefine29.8%
associate-/l*29.8%
Applied egg-rr29.8%
sub-neg29.8%
metadata-eval29.8%
+-commutative29.8%
log1p-undefine29.8%
rem-exp-log29.8%
+-commutative29.8%
associate-*r*29.8%
associate-*r/29.8%
*-commutative29.8%
associate-/l*29.8%
fma-define29.8%
associate-/l*29.8%
Simplified29.8%
Final simplification61.8%
(FPCore (k n) :precision binary64 (if (<= k 1.15e+39) (/ (sqrt (* (* 2.0 n) PI)) (sqrt k)) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 1.15e+39) {
tmp = sqrt(((2.0 * n) * ((double) M_PI))) / sqrt(k);
} else {
tmp = sqrt((2.0 * (-1.0 + fma(n, (((double) M_PI) / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 1.15e+39) tmp = Float64(sqrt(Float64(Float64(2.0 * n) * pi)) / sqrt(k)); else tmp = sqrt(Float64(2.0 * Float64(-1.0 + fma(n, Float64(pi / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 1.15e+39], N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(-1.0 + N[(n * N[(Pi / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.15 \cdot 10^{+39}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot n\right) \cdot \pi}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 1.15000000000000006e39Initial program 99.2%
Taylor expanded in k around 0 68.0%
associate-/l*67.9%
Simplified67.9%
*-commutative67.9%
sqrt-prod89.1%
associate-*r*89.0%
sqrt-prod89.3%
div-inv89.3%
sqrt-prod88.9%
metadata-eval88.9%
add-sqr-sqrt88.9%
frac-times88.9%
sqrt-unprod89.5%
add-sqr-sqrt89.6%
associate-*l*89.6%
sqrt-prod90.0%
div-inv90.0%
*-commutative90.0%
Applied egg-rr90.0%
if 1.15000000000000006e39 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
sqrt-unprod2.6%
*-commutative2.6%
associate-*l*2.6%
*-commutative2.6%
Applied egg-rr2.6%
unpow12.6%
associate-*l/2.6%
associate-/l*2.6%
Simplified2.6%
Taylor expanded in n around 0 2.6%
associate-/l*2.6%
Simplified2.6%
associate-*r/2.6%
expm1-log1p-u2.6%
expm1-undefine29.8%
*-commutative29.8%
associate-/l*29.8%
Applied egg-rr29.8%
sub-neg29.8%
metadata-eval29.8%
+-commutative29.8%
log1p-undefine29.8%
rem-exp-log29.8%
+-commutative29.8%
associate-*r/29.8%
*-commutative29.8%
associate-/l*29.8%
fma-define29.8%
Simplified29.8%
Final simplification61.8%
(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.6%
associate-*l/99.6%
*-lft-identity99.6%
associate-*l*99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (sqrt (* (* 2.0 n) PI)) (sqrt k)))
double code(double k, double n) {
return sqrt(((2.0 * n) * ((double) M_PI))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt(((2.0 * n) * Math.PI)) / Math.sqrt(k);
}
def code(k, n): return math.sqrt(((2.0 * n) * math.pi)) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(Float64(2.0 * n) * pi)) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt(((2.0 * n) * pi)) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\left(2 \cdot n\right) \cdot \pi}}{\sqrt{k}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 37.3%
associate-/l*37.3%
Simplified37.3%
*-commutative37.3%
sqrt-prod48.6%
associate-*r*48.6%
sqrt-prod48.7%
div-inv48.7%
sqrt-prod48.5%
metadata-eval48.5%
add-sqr-sqrt48.5%
frac-times48.5%
sqrt-unprod48.8%
add-sqr-sqrt48.9%
associate-*l*48.9%
sqrt-prod49.1%
div-inv49.1%
*-commutative49.1%
Applied egg-rr49.1%
Final simplification49.1%
(FPCore (k n) :precision binary64 (* (sqrt (* 2.0 n)) (sqrt (/ PI k))))
double code(double k, double n) {
return sqrt((2.0 * n)) * sqrt((((double) M_PI) / k));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * n)) * Math.sqrt((Math.PI / k));
}
def code(k, n): return math.sqrt((2.0 * n)) * math.sqrt((math.pi / k))
function code(k, n) return Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt((2.0 * n)) * sqrt((pi / k)); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 37.3%
associate-/l*37.3%
Simplified37.3%
pow137.3%
sqrt-unprod37.4%
*-commutative37.4%
associate-*l*37.4%
*-commutative37.4%
Applied egg-rr37.4%
unpow137.4%
associate-*l/37.4%
associate-/l*37.4%
Simplified37.4%
Taylor expanded in n around 0 37.4%
associate-/l*37.4%
Simplified37.4%
associate-*r*37.4%
sqrt-prod48.7%
Applied egg-rr48.7%
*-commutative48.7%
Simplified48.7%
Final simplification48.7%
(FPCore (k n) :precision binary64 (pow (/ k (* n (* 2.0 PI))) -0.5))
double code(double k, double n) {
return pow((k / (n * (2.0 * ((double) M_PI)))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k / (n * (2.0 * Math.PI))), -0.5);
}
def code(k, n): return math.pow((k / (n * (2.0 * math.pi))), -0.5)
function code(k, n) return Float64(k / Float64(n * Float64(2.0 * pi))) ^ -0.5 end
function tmp = code(k, n) tmp = (k / (n * (2.0 * pi))) ^ -0.5; end
code[k_, n_] := N[Power[N[(k / N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{n \cdot \left(2 \cdot \pi\right)}\right)}^{-0.5}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 37.3%
associate-/l*37.3%
Simplified37.3%
pow137.3%
sqrt-unprod37.4%
*-commutative37.4%
associate-*l*37.4%
*-commutative37.4%
Applied egg-rr37.4%
unpow137.4%
associate-*l/37.4%
associate-/l*37.4%
Simplified37.4%
associate-*r/37.4%
sqrt-undiv49.1%
clear-num49.1%
inv-pow49.1%
sqrt-undiv38.1%
sqrt-pow238.2%
associate-*r*38.2%
*-commutative38.2%
metadata-eval38.2%
Applied egg-rr38.2%
Final simplification38.2%
(FPCore (k n) :precision binary64 (sqrt (/ PI (/ (* k 0.5) n))))
double code(double k, double n) {
return sqrt((((double) M_PI) / ((k * 0.5) / n)));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / ((k * 0.5) / n)));
}
def code(k, n): return math.sqrt((math.pi / ((k * 0.5) / n)))
function code(k, n) return sqrt(Float64(pi / Float64(Float64(k * 0.5) / n))) end
function tmp = code(k, n) tmp = sqrt((pi / ((k * 0.5) / n))); end
code[k_, n_] := N[Sqrt[N[(Pi / N[(N[(k * 0.5), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{\frac{k \cdot 0.5}{n}}}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 37.3%
associate-/l*37.3%
Simplified37.3%
pow137.3%
sqrt-unprod37.4%
*-commutative37.4%
associate-*l*37.4%
*-commutative37.4%
Applied egg-rr37.4%
unpow137.4%
associate-*l/37.4%
associate-/l*37.4%
Simplified37.4%
clear-num37.4%
un-div-inv37.4%
*-un-lft-identity37.4%
times-frac37.4%
metadata-eval37.4%
Applied egg-rr37.4%
associate-*r/37.4%
Simplified37.4%
Final simplification37.4%
(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.6%
Taylor expanded in k around 0 37.3%
associate-/l*37.3%
Simplified37.3%
pow137.3%
sqrt-unprod37.4%
*-commutative37.4%
associate-*l*37.4%
*-commutative37.4%
Applied egg-rr37.4%
unpow137.4%
associate-*l/37.4%
associate-/l*37.4%
Simplified37.4%
Taylor expanded in n around 0 37.4%
associate-/l*37.4%
Simplified37.4%
clear-num37.4%
un-div-inv37.4%
Applied egg-rr37.4%
(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.6%
Taylor expanded in k around 0 37.3%
associate-/l*37.3%
Simplified37.3%
pow137.3%
sqrt-unprod37.4%
*-commutative37.4%
associate-*l*37.4%
*-commutative37.4%
Applied egg-rr37.4%
unpow137.4%
associate-*l/37.4%
associate-/l*37.4%
Simplified37.4%
Taylor expanded in n around 0 37.4%
associate-/l*37.4%
Simplified37.4%
herbie shell --seed 2024108
(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))))