
(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 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.4%
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%
associate-*r*99.7%
associate-*r*99.7%
Simplified99.7%
(FPCore (k n) :precision binary64 (if (<= k 2.2e-52) (/ (sqrt (* 2.0 n)) (sqrt (/ k PI))) (sqrt (/ (pow (* (* 2.0 PI) n) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 2.2e-52) {
tmp = sqrt((2.0 * n)) / sqrt((k / ((double) M_PI)));
} 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 <= 2.2e-52) {
tmp = Math.sqrt((2.0 * n)) / Math.sqrt((k / Math.PI));
} 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 <= 2.2e-52: tmp = math.sqrt((2.0 * n)) / math.sqrt((k / math.pi)) 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 <= 2.2e-52) tmp = Float64(sqrt(Float64(2.0 * n)) / sqrt(Float64(k / pi))); 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 <= 2.2e-52) tmp = sqrt((2.0 * n)) / sqrt((k / pi)); else tmp = sqrt(((((2.0 * pi) * n) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.2e-52], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $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 2.2 \cdot 10^{-52}:\\
\;\;\;\;\frac{\sqrt{2 \cdot n}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.20000000000000009e-52Initial program 99.2%
Taylor expanded in k around 0 66.4%
associate-/l*66.3%
Simplified66.3%
pow166.3%
*-commutative66.3%
sqrt-unprod66.6%
Applied egg-rr66.6%
unpow166.6%
Simplified66.6%
clear-num66.6%
un-div-inv66.7%
Applied egg-rr66.7%
associate-*r/66.7%
*-commutative66.7%
sqrt-div99.5%
Applied egg-rr99.5%
if 2.20000000000000009e-52 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.6%
*-commutative99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.6%
*-commutative99.6%
Applied egg-rr99.7%
Simplified99.7%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 2.6e+42) (* (sqrt (* 2.0 n)) (sqrt (/ PI k))) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 2.6e+42) {
tmp = sqrt((2.0 * n)) * sqrt((((double) M_PI) / 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 <= 2.6e+42) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / 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, 2.6e+42], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $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 2.6 \cdot 10^{+42}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 2.5999999999999999e42Initial program 99.0%
Taylor expanded in k around 0 62.0%
associate-/l*62.0%
Simplified62.0%
pow162.0%
*-commutative62.0%
sqrt-unprod62.3%
Applied egg-rr62.3%
unpow162.3%
Simplified62.3%
associate-*r*62.3%
*-commutative62.3%
sqrt-prod86.4%
Applied egg-rr86.4%
if 2.5999999999999999e42 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
pow12.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
unpow12.6%
Simplified2.6%
clear-num2.6%
un-div-inv2.6%
Applied egg-rr2.6%
expm1-log1p-u2.6%
expm1-undefine28.1%
associate-/r/28.1%
*-commutative28.1%
Applied egg-rr28.1%
sub-neg28.1%
metadata-eval28.1%
+-commutative28.1%
log1p-undefine28.1%
rem-exp-log28.1%
+-commutative28.1%
*-commutative28.1%
associate-*l/28.1%
associate-*r/28.1%
fma-define28.1%
Simplified28.1%
Final simplification61.6%
(FPCore (k n) :precision binary64 (if (<= k 2.9e+169) (* (sqrt (* 2.0 n)) (sqrt (/ PI k))) (pow (* (/ (* PI n) (* k (/ k (* PI n)))) 4.0) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 2.9e+169) {
tmp = sqrt((2.0 * n)) * sqrt((((double) M_PI) / k));
} else {
tmp = pow((((((double) M_PI) * n) / (k * (k / (((double) M_PI) * n)))) * 4.0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 2.9e+169) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((Math.PI / k));
} else {
tmp = Math.pow((((Math.PI * n) / (k * (k / (Math.PI * n)))) * 4.0), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 2.9e+169: tmp = math.sqrt((2.0 * n)) * math.sqrt((math.pi / k)) else: tmp = math.pow((((math.pi * n) / (k * (k / (math.pi * n)))) * 4.0), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 2.9e+169) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / k))); else tmp = Float64(Float64(Float64(pi * n) / Float64(k * Float64(k / Float64(pi * n)))) * 4.0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 2.9e+169) tmp = sqrt((2.0 * n)) * sqrt((pi / k)); else tmp = (((pi * n) / (k * (k / (pi * n)))) * 4.0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.9e+169], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(N[(Pi * n), $MachinePrecision] / N[(k * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.9 \cdot 10^{+169}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\pi \cdot n}{k \cdot \frac{k}{\pi \cdot n}} \cdot 4\right)}^{0.25}\\
\end{array}
\end{array}
if k < 2.9000000000000001e169Initial program 99.3%
Taylor expanded in k around 0 47.9%
associate-/l*47.9%
Simplified47.9%
pow147.9%
*-commutative47.9%
sqrt-unprod48.1%
Applied egg-rr48.1%
unpow148.1%
Simplified48.1%
associate-*r*48.1%
*-commutative48.1%
sqrt-prod66.5%
Applied egg-rr66.5%
if 2.9000000000000001e169 < k Initial program 100.0%
Taylor expanded in k around 0 2.5%
associate-/l*2.5%
Simplified2.5%
pow12.5%
*-commutative2.5%
sqrt-unprod2.5%
Applied egg-rr2.5%
unpow12.5%
Simplified2.5%
pow1/22.5%
associate-*r/2.5%
associate-/l*2.5%
metadata-eval2.5%
pow-prod-up2.5%
pow-prod-down10.0%
associate-/l*10.0%
associate-*r/10.0%
*-commutative10.0%
associate-/l*10.0%
associate-*r/10.0%
*-commutative10.0%
swap-sqr11.5%
pow211.5%
metadata-eval11.5%
Applied egg-rr11.5%
unpow211.5%
clear-num11.5%
div-inv11.5%
clear-num11.5%
associate-*r/11.5%
frac-times25.3%
*-un-lft-identity25.3%
*-commutative25.3%
associate-/l/25.3%
*-commutative25.3%
Applied egg-rr25.3%
Final simplification56.3%
(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.4%
associate-*l/99.6%
*-lft-identity99.6%
associate-*l*99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
(FPCore (k n) :precision binary64 (if (<= k 9.2e+168) (pow (/ (/ k PI) (* 2.0 n)) -0.5) (pow (* (/ (* PI n) (* k (/ k (* PI n)))) 4.0) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 9.2e+168) {
tmp = pow(((k / ((double) M_PI)) / (2.0 * n)), -0.5);
} else {
tmp = pow((((((double) M_PI) * n) / (k * (k / (((double) M_PI) * n)))) * 4.0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 9.2e+168) {
tmp = Math.pow(((k / Math.PI) / (2.0 * n)), -0.5);
} else {
tmp = Math.pow((((Math.PI * n) / (k * (k / (Math.PI * n)))) * 4.0), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 9.2e+168: tmp = math.pow(((k / math.pi) / (2.0 * n)), -0.5) else: tmp = math.pow((((math.pi * n) / (k * (k / (math.pi * n)))) * 4.0), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 9.2e+168) tmp = Float64(Float64(k / pi) / Float64(2.0 * n)) ^ -0.5; else tmp = Float64(Float64(Float64(pi * n) / Float64(k * Float64(k / Float64(pi * n)))) * 4.0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 9.2e+168) tmp = ((k / pi) / (2.0 * n)) ^ -0.5; else tmp = (((pi * n) / (k * (k / (pi * n)))) * 4.0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 9.2e+168], N[Power[N[(N[(k / Pi), $MachinePrecision] / N[(2.0 * n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Power[N[(N[(N[(Pi * n), $MachinePrecision] / N[(k * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 9.2 \cdot 10^{+168}:\\
\;\;\;\;{\left(\frac{\frac{k}{\pi}}{2 \cdot n}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\pi \cdot n}{k \cdot \frac{k}{\pi \cdot n}} \cdot 4\right)}^{0.25}\\
\end{array}
\end{array}
if k < 9.1999999999999997e168Initial program 99.3%
Taylor expanded in k around 0 48.1%
associate-/l*48.1%
Simplified48.1%
pow148.1%
*-commutative48.1%
sqrt-unprod48.3%
Applied egg-rr48.3%
unpow148.3%
Simplified48.3%
clear-num48.3%
un-div-inv48.3%
Applied egg-rr48.3%
associate-*r/48.3%
*-commutative48.3%
div-inv48.3%
clear-num48.3%
associate-*r/48.3%
clear-num48.3%
metadata-eval48.3%
add-sqr-sqrt48.1%
frac-times48.2%
sqrt-unprod49.9%
add-sqr-sqrt50.1%
inv-pow50.1%
sqrt-pow250.2%
*-commutative50.2%
associate-/r*50.2%
metadata-eval50.2%
Applied egg-rr50.2%
if 9.1999999999999997e168 < k Initial program 100.0%
Taylor expanded in k around 0 2.5%
associate-/l*2.5%
Simplified2.5%
pow12.5%
*-commutative2.5%
sqrt-unprod2.5%
Applied egg-rr2.5%
unpow12.5%
Simplified2.5%
pow1/22.5%
associate-*r/2.5%
associate-/l*2.5%
metadata-eval2.5%
pow-prod-up2.5%
pow-prod-down9.9%
associate-/l*9.9%
associate-*r/9.9%
*-commutative9.9%
associate-/l*9.9%
associate-*r/9.9%
*-commutative9.9%
swap-sqr11.4%
pow211.4%
metadata-eval11.4%
Applied egg-rr11.4%
unpow211.4%
clear-num11.4%
div-inv11.4%
clear-num11.4%
associate-*r/11.4%
frac-times24.9%
*-un-lft-identity24.9%
*-commutative24.9%
associate-/l/24.9%
*-commutative24.9%
Applied egg-rr24.9%
Final simplification43.9%
(FPCore (k n) :precision binary64 (pow (/ (/ k PI) (* 2.0 n)) -0.5))
double code(double k, double n) {
return pow(((k / ((double) M_PI)) / (2.0 * n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k / Math.PI) / (2.0 * n)), -0.5);
}
def code(k, n): return math.pow(((k / math.pi) / (2.0 * n)), -0.5)
function code(k, n) return Float64(Float64(k / pi) / Float64(2.0 * n)) ^ -0.5 end
function tmp = code(k, n) tmp = ((k / pi) / (2.0 * n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k / Pi), $MachinePrecision] / N[(2.0 * n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\frac{k}{\pi}}{2 \cdot n}\right)}^{-0.5}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 36.7%
associate-/l*36.7%
Simplified36.7%
pow136.7%
*-commutative36.7%
sqrt-unprod36.9%
Applied egg-rr36.9%
unpow136.9%
Simplified36.9%
clear-num36.8%
un-div-inv36.9%
Applied egg-rr36.9%
associate-*r/36.9%
*-commutative36.9%
div-inv36.8%
clear-num36.9%
associate-*r/36.8%
clear-num36.8%
metadata-eval36.8%
add-sqr-sqrt36.7%
frac-times36.8%
sqrt-unprod38.1%
add-sqr-sqrt38.2%
inv-pow38.2%
sqrt-pow238.3%
*-commutative38.3%
associate-/r*38.3%
metadata-eval38.3%
Applied egg-rr38.3%
Final simplification38.3%
(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.4%
Taylor expanded in k around 0 36.7%
associate-/l*36.7%
Simplified36.7%
pow136.7%
*-commutative36.7%
sqrt-unprod36.9%
Applied egg-rr36.9%
unpow136.9%
Simplified36.9%
clear-num36.8%
un-div-inv36.9%
Applied egg-rr36.9%
(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%
Taylor expanded in k around 0 36.7%
associate-/l*36.7%
Simplified36.7%
pow136.7%
*-commutative36.7%
sqrt-unprod36.9%
Applied egg-rr36.9%
unpow136.9%
Simplified36.9%
herbie shell --seed 2024085
(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))))