
(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 13 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 PI) n))) (/ (sqrt t_0) (* (sqrt k) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = (2.0 * ((double) M_PI)) * n;
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 * Math.PI) * n;
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = (2.0 * math.pi) * n 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 * pi) * n) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = (2.0 * pi) * n; tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(N[(2.0 * Pi), $MachinePrecision] * n), $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 \pi\right) \cdot n\\
\frac{\sqrt{t\_0}}{\sqrt{k} \cdot {t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-un-lft-identity99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
pow-div99.8%
pow1/299.8%
associate-/l/99.8%
div-inv99.8%
metadata-eval99.8%
Applied egg-rr99.8%
associate-*r*99.8%
associate-*r*99.8%
Simplified99.8%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* 2.0 n))))
(if (<= k 3e-19)
(/ (sqrt t_0) (sqrt k))
(pow (/ k (pow t_0 (- 1.0 k))) -0.5))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
double tmp;
if (k <= 3e-19) {
tmp = sqrt(t_0) / sqrt(k);
} else {
tmp = pow((k / pow(t_0, (1.0 - k))), -0.5);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
double tmp;
if (k <= 3e-19) {
tmp = Math.sqrt(t_0) / Math.sqrt(k);
} else {
tmp = Math.pow((k / Math.pow(t_0, (1.0 - k))), -0.5);
}
return tmp;
}
def code(k, n): t_0 = math.pi * (2.0 * n) tmp = 0 if k <= 3e-19: tmp = math.sqrt(t_0) / math.sqrt(k) else: tmp = math.pow((k / math.pow(t_0, (1.0 - k))), -0.5) return tmp
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) tmp = 0.0 if (k <= 3e-19) tmp = Float64(sqrt(t_0) / sqrt(k)); else tmp = Float64(k / (t_0 ^ Float64(1.0 - k))) ^ -0.5; end return tmp end
function tmp_2 = code(k, n) t_0 = pi * (2.0 * n); tmp = 0.0; if (k <= 3e-19) tmp = sqrt(t_0) / sqrt(k); else tmp = (k / (t_0 ^ (1.0 - k))) ^ -0.5; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 3e-19], N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Power[N[(k / N[Power[t$95$0, N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\mathbf{if}\;k \leq 3 \cdot 10^{-19}:\\
\;\;\;\;\frac{\sqrt{t\_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{k}{{t\_0}^{\left(1 - k\right)}}\right)}^{-0.5}\\
\end{array}
\end{array}
if k < 2.99999999999999993e-19Initial program 99.2%
Taylor expanded in k around 0 79.1%
associate-/l*79.1%
Simplified79.1%
sqrt-unprod78.5%
associate-*r/78.4%
sqrt-unprod79.1%
sqrt-div99.0%
associate-*l/99.2%
sqrt-unprod99.5%
*-commutative99.5%
associate-*l*99.5%
Applied egg-rr99.5%
if 2.99999999999999993e-19 < k Initial program 99.8%
associate-/r/99.8%
associate-*r*99.8%
div-sub99.8%
metadata-eval99.8%
div-inv99.8%
metadata-eval99.8%
Applied egg-rr99.8%
Applied egg-rr99.8%
*-rgt-identity99.8%
*-commutative99.8%
associate-*l*99.8%
Simplified99.8%
inv-pow99.8%
sqrt-pow299.8%
metadata-eval99.8%
Applied egg-rr99.8%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 3.2e-39) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (sqrt (/ (pow (* (* 2.0 PI) n) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 3.2e-39) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = sqrt((pow(((2.0 * ((double) M_PI)) * n), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.2e-39) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = Math.sqrt((Math.pow(((2.0 * Math.PI) * n), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.2e-39: tmp = math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k) else: tmp = math.sqrt((math.pow(((2.0 * math.pi) * n), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.2e-39) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = sqrt(Float64((Float64(Float64(2.0 * pi) * n) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.2e-39) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); else tmp = sqrt(((((2.0 * pi) * n) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.2e-39], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.2 \cdot 10^{-39}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 3.1999999999999998e-39Initial program 99.2%
Taylor expanded in k around 0 77.9%
associate-/l*78.0%
Simplified78.0%
sqrt-unprod77.3%
associate-*r/77.2%
sqrt-unprod77.9%
sqrt-div99.1%
associate-*l/99.2%
sqrt-unprod99.5%
*-commutative99.5%
associate-*l*99.5%
Applied egg-rr99.5%
if 3.1999999999999998e-39 < k Initial program 99.7%
add-sqr-sqrt99.7%
sqrt-unprod99.7%
*-commutative99.7%
associate-*r*99.7%
div-sub99.7%
metadata-eval99.7%
div-inv99.7%
*-commutative99.7%
Applied egg-rr99.8%
Simplified99.8%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 3.2e+84) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 3.2e+84) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / 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 <= 3.2e+84) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / 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, 3.2e+84], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $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 3.2 \cdot 10^{+84}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\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 < 3.2000000000000001e84Initial program 99.2%
Taylor expanded in k around 0 58.3%
associate-/l*58.3%
Simplified58.3%
sqrt-unprod57.9%
associate-*r/57.8%
sqrt-unprod58.3%
sqrt-div72.2%
associate-*l/72.3%
sqrt-unprod72.5%
*-commutative72.5%
associate-*l*72.5%
Applied egg-rr72.5%
if 3.2000000000000001e84 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
sqrt-unprod2.6%
associate-*r/2.6%
sqrt-unprod2.6%
sqrt-div2.8%
*-un-lft-identity2.8%
associate-*l/2.8%
pow12.8%
associate-*r*2.8%
Applied egg-rr2.6%
unpow12.6%
*-commutative2.6%
associate-*r*2.6%
Simplified2.6%
Taylor expanded in n around 0 2.6%
expm1-log1p-u2.6%
expm1-undefine39.3%
*-commutative39.3%
associate-/l*39.3%
Applied egg-rr39.3%
sub-neg39.3%
metadata-eval39.3%
+-commutative39.3%
log1p-undefine39.3%
rem-exp-log39.3%
+-commutative39.3%
associate-*r/39.3%
associate-*l/39.3%
*-commutative39.3%
fma-define39.3%
Simplified39.3%
Final simplification59.9%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* PI n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (Math.PI * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((2.0 * (math.pi * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((2.0 * (pi * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $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(\pi \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
associate-*l*99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
(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%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
associate-*l/46.0%
sqrt-unprod46.1%
*-commutative46.1%
associate-*l*46.1%
Applied egg-rr46.1%
Final simplification46.1%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((((double) M_PI) * (2.0 / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((Math.PI * (2.0 / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((math.pi * (2.0 / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((pi * (2.0 / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\pi \cdot \frac{2}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
pow1/236.9%
associate-*l*36.9%
unpow-prod-down46.0%
pow1/246.0%
Applied egg-rr46.0%
unpow1/246.0%
associate-*r/46.0%
*-commutative46.0%
associate-/l*46.0%
Simplified46.0%
(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.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
pow1/236.9%
associate-*l*36.9%
unpow-prod-down46.0%
pow1/246.0%
Applied egg-rr46.0%
unpow1/246.0%
Simplified46.0%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ k (* PI (* 2.0 n))))))
double code(double k, double n) {
return 1.0 / sqrt((k / (((double) M_PI) * (2.0 * n))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((k / (Math.PI * (2.0 * n))));
}
def code(k, n): return 1.0 / math.sqrt((k / (math.pi * (2.0 * n))))
function code(k, n) return Float64(1.0 / sqrt(Float64(k / Float64(pi * Float64(2.0 * n))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((k / (pi * (2.0 * n)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{k}{\pi \cdot \left(2 \cdot n\right)}}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
associate-*r/36.9%
*-commutative36.9%
sqrt-undiv46.1%
clear-num46.0%
*-commutative46.0%
associate-*r*46.0%
sqrt-undiv37.6%
*-commutative37.6%
associate-*r*37.6%
Applied egg-rr37.6%
*-commutative37.6%
associate-*l*37.6%
Simplified37.6%
Final simplification37.6%
(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(pi * Float64(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[(Pi * N[(N[(2.0 * n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \frac{2 \cdot n}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
pow1/236.9%
associate-*l*36.9%
unpow-prod-down46.0%
pow1/246.0%
Applied egg-rr46.0%
unpow1/246.0%
Simplified46.0%
sqrt-unprod36.9%
associate-*r*36.9%
*-commutative36.9%
associate-*l/36.9%
associate-/l*37.0%
Applied egg-rr37.0%
Final simplification37.0%
(FPCore (k n) :precision binary64 (sqrt (* n (/ 2.0 (/ k PI)))))
double code(double k, double n) {
return sqrt((n * (2.0 / (k / ((double) M_PI)))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 / (k / Math.PI))));
}
def code(k, n): return math.sqrt((n * (2.0 / (k / math.pi))))
function code(k, n) return sqrt(Float64(n * Float64(2.0 / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 / (k / pi)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(2.0 / N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \frac{2}{\frac{k}{\pi}}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
Taylor expanded in n around 0 36.9%
*-un-lft-identity36.9%
associate-*r/36.9%
sqrt-div46.1%
associate-*r*46.1%
*-commutative46.1%
*-commutative46.1%
sqrt-div36.9%
associate-/l*37.0%
Applied egg-rr37.0%
*-lft-identity37.0%
*-commutative37.0%
associate-/r/36.9%
associate-/l*36.9%
Simplified36.9%
(FPCore (k n) :precision binary64 (sqrt (* n (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt((n * (((double) M_PI) * (2.0 / k))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (Math.PI * (2.0 / k))));
}
def code(k, n): return math.sqrt((n * (math.pi * (2.0 / k))))
function code(k, n) return sqrt(Float64(n * Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt((n * (pi * (2.0 / k)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(\pi \cdot \frac{2}{k}\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
Taylor expanded in n around 0 36.9%
*-un-lft-identity36.9%
associate-*r/36.9%
sqrt-div46.1%
associate-*r*46.1%
*-commutative46.1%
*-commutative46.1%
sqrt-div36.9%
associate-/l*37.0%
Applied egg-rr37.0%
*-lft-identity37.0%
associate-*r/36.9%
associate-*r*36.9%
associate-*l/36.9%
associate-*l/36.9%
*-commutative36.9%
associate-*l*36.9%
*-commutative36.9%
associate-*r/36.9%
*-commutative36.9%
associate-/l*36.9%
Simplified36.9%
(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(Float64(pi * 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[(N[(Pi * n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi \cdot n}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 37.2%
associate-/l*37.2%
Simplified37.2%
sqrt-unprod36.9%
associate-*r/36.9%
sqrt-unprod37.2%
sqrt-div45.9%
*-un-lft-identity45.9%
associate-*l/45.9%
pow145.9%
associate-*r*45.9%
Applied egg-rr36.9%
unpow136.9%
*-commutative36.9%
associate-*r*36.9%
Simplified36.9%
Taylor expanded in n around 0 36.9%
Final simplification36.9%
herbie shell --seed 2024096
(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))))