
(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) (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.7%
*-un-lft-identity99.7%
associate-*r*99.7%
div-sub99.7%
metadata-eval99.7%
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%
Final simplification99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* (* 2.0 n) PI)))
(if (<= k 1.7e-55)
(/ (pow k -0.5) (pow t_0 -0.5))
(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 <= 1.7e-55) {
tmp = pow(k, -0.5) / pow(t_0, -0.5);
} 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 <= 1.7e-55) {
tmp = Math.pow(k, -0.5) / Math.pow(t_0, -0.5);
} 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 <= 1.7e-55: tmp = math.pow(k, -0.5) / math.pow(t_0, -0.5) 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 <= 1.7e-55) tmp = Float64((k ^ -0.5) / (t_0 ^ -0.5)); 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 <= 1.7e-55) tmp = (k ^ -0.5) / (t_0 ^ -0.5); 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, 1.7e-55], N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[t$95$0, -0.5], $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 1.7 \cdot 10^{-55}:\\
\;\;\;\;\frac{{k}^{-0.5}}{{t\_0}^{-0.5}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t\_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.69999999999999986e-55Initial program 99.2%
Taylor expanded in k around 0 67.6%
associate-/l*67.6%
Simplified67.6%
*-commutative67.6%
sqrt-unprod67.0%
Applied egg-rr67.0%
associate-*r*67.0%
associate-*r/67.0%
*-commutative67.0%
sqrt-div99.5%
clear-num99.3%
inv-pow99.3%
div-inv99.2%
unpow-prod-down99.2%
inv-pow99.2%
pow1/299.2%
pow-flip99.3%
metadata-eval99.3%
pow1/299.3%
pow-flip99.2%
metadata-eval99.2%
*-commutative99.2%
associate-*l*99.2%
*-commutative99.2%
Applied egg-rr99.2%
unpow-199.2%
associate-*r/99.5%
*-rgt-identity99.5%
associate-*r*99.5%
*-commutative99.5%
associate-*r*99.5%
Simplified99.5%
if 1.69999999999999986e-55 < k Initial program 99.8%
add-sqr-sqrt99.8%
sqrt-unprod99.1%
*-commutative99.1%
associate-*r*99.1%
div-sub99.1%
metadata-eval99.1%
div-inv99.1%
*-commutative99.1%
Applied egg-rr99.1%
Simplified99.2%
Final simplification99.3%
(FPCore (k n) :precision binary64 (if (<= k 3.7e+24) (/ (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 <= 3.7e+24) {
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 <= 3.7e+24) 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, 3.7e+24], 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 3.7 \cdot 10^{+24}:\\
\;\;\;\;\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 < 3.69999999999999999e24Initial program 99.2%
Taylor expanded in k around 0 88.2%
associate-*l/88.3%
*-un-lft-identity88.3%
sqrt-unprod88.5%
*-commutative88.5%
associate-*l*88.5%
*-commutative88.5%
Applied egg-rr88.5%
if 3.69999999999999999e24 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
associate-*r/2.6%
expm1-log1p-u2.6%
expm1-undefine25.2%
*-commutative25.2%
Applied egg-rr25.2%
sub-neg25.2%
metadata-eval25.2%
+-commutative25.2%
log1p-undefine25.2%
rem-exp-log25.2%
+-commutative25.2%
*-commutative25.2%
associate-/l*25.2%
fma-define25.2%
Simplified25.2%
Final simplification60.3%
(FPCore (k n) :precision binary64 (if (<= k 2.1e+25) (/ (pow k -0.5) (pow (* (* 2.0 n) PI) -0.5)) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 2.1e+25) {
tmp = pow(k, -0.5) / pow(((2.0 * n) * ((double) M_PI)), -0.5);
} 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.1e+25) tmp = Float64((k ^ -0.5) / (Float64(Float64(2.0 * n) * pi) ^ -0.5)); 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.1e+25], N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision], -0.5], $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.1 \cdot 10^{+25}:\\
\;\;\;\;\frac{{k}^{-0.5}}{{\left(\left(2 \cdot n\right) \cdot \pi\right)}^{-0.5}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 2.0999999999999999e25Initial program 99.2%
Taylor expanded in k around 0 63.4%
associate-/l*63.3%
Simplified63.3%
*-commutative63.3%
sqrt-unprod63.0%
Applied egg-rr63.0%
associate-*r*63.0%
associate-*r/62.9%
*-commutative62.9%
sqrt-div88.5%
clear-num88.3%
inv-pow88.3%
div-inv88.2%
unpow-prod-down88.3%
inv-pow88.3%
pow1/288.3%
pow-flip88.3%
metadata-eval88.3%
pow1/288.3%
pow-flip88.3%
metadata-eval88.3%
*-commutative88.3%
associate-*l*88.3%
*-commutative88.3%
Applied egg-rr88.3%
unpow-188.3%
associate-*r/88.5%
*-rgt-identity88.5%
associate-*r*88.5%
*-commutative88.5%
associate-*r*88.5%
Simplified88.5%
if 2.0999999999999999e25 < k Initial program 100.0%
Taylor expanded in k around 0 2.6%
associate-/l*2.6%
Simplified2.6%
*-commutative2.6%
sqrt-unprod2.6%
Applied egg-rr2.6%
associate-*r/2.6%
expm1-log1p-u2.6%
expm1-undefine25.2%
*-commutative25.2%
Applied egg-rr25.2%
sub-neg25.2%
metadata-eval25.2%
+-commutative25.2%
log1p-undefine25.2%
rem-exp-log25.2%
+-commutative25.2%
*-commutative25.2%
associate-/l*25.2%
fma-define25.2%
Simplified25.2%
Final simplification60.3%
(FPCore (k n) :precision binary64 (/ (pow k -0.5) (pow (* (* 2.0 n) PI) (- (* k 0.5) 0.5))))
double code(double k, double n) {
return pow(k, -0.5) / pow(((2.0 * n) * ((double) M_PI)), ((k * 0.5) - 0.5));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow(((2.0 * n) * Math.PI), ((k * 0.5) - 0.5));
}
def code(k, n): return math.pow(k, -0.5) / math.pow(((2.0 * n) * math.pi), ((k * 0.5) - 0.5))
function code(k, n) return Float64((k ^ -0.5) / (Float64(Float64(2.0 * n) * pi) ^ Float64(Float64(k * 0.5) - 0.5))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / (((2.0 * n) * pi) ^ ((k * 0.5) - 0.5)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(N[(2.0 * n), $MachinePrecision] * Pi), $MachinePrecision], N[(N[(k * 0.5), $MachinePrecision] - 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(\left(2 \cdot n\right) \cdot \pi\right)}^{\left(k \cdot 0.5 - 0.5\right)}}
\end{array}
Initial program 99.6%
associate-*l/99.7%
*-lft-identity99.7%
associate-*l*99.7%
div-sub99.7%
metadata-eval99.7%
Simplified99.7%
div-inv99.6%
div-inv99.6%
metadata-eval99.6%
inv-pow99.6%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-commutative99.6%
metadata-eval99.6%
pow-flip99.6%
pow1/299.6%
*-commutative99.6%
associate-*l*99.6%
pow-sub99.6%
pow1/299.6%
clear-num99.6%
un-div-inv99.6%
inv-pow99.6%
sqrt-pow299.7%
metadata-eval99.7%
pow1/299.7%
pow-div99.7%
Applied egg-rr99.7%
Final simplification99.7%
(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.7%
*-lft-identity99.7%
associate-*l*99.7%
div-sub99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification99.7%
(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 36.3%
associate-/l*36.3%
Simplified36.3%
*-commutative36.3%
sqrt-unprod36.1%
Applied egg-rr36.1%
associate-*r*36.1%
sqrt-prod49.8%
Applied egg-rr49.8%
Final simplification49.8%
(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 50.1%
associate-*l/50.2%
*-un-lft-identity50.2%
sqrt-unprod50.3%
*-commutative50.3%
associate-*l*50.3%
*-commutative50.3%
Applied egg-rr50.3%
Final simplification50.3%
(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(Float64(k / 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[(N[(k / n), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(0.5 \cdot \frac{\frac{k}{n}}{\pi}\right)}^{-0.5}
\end{array}
Initial program 99.6%
Taylor expanded in k around 0 36.3%
associate-/l*36.3%
Simplified36.3%
pow136.3%
*-commutative36.3%
sqrt-unprod36.1%
Applied egg-rr36.1%
unpow136.1%
associate-*r/36.0%
*-commutative36.0%
associate-/l*36.0%
Simplified36.0%
*-commutative36.0%
associate-*r/36.0%
associate-*l/36.0%
associate-*r*36.0%
*-commutative36.0%
sqrt-undiv50.3%
clear-num50.2%
sqrt-div36.6%
inv-pow36.6%
sqrt-pow236.6%
associate-/r*36.6%
*-un-lft-identity36.6%
times-frac36.6%
metadata-eval36.6%
associate-/l/36.6%
metadata-eval36.6%
Applied egg-rr36.6%
associate-/r*36.7%
Simplified36.7%
Final simplification36.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(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 36.3%
associate-/l*36.3%
Simplified36.3%
*-commutative36.3%
sqrt-unprod36.1%
Applied egg-rr36.1%
Final simplification36.1%
herbie shell --seed 2024081
(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))))