
(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 (* (sqrt (/ 1.0 k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return sqrt((1.0 / k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((1.0 / k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return math.sqrt((1.0 / k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / 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}
\\
\sqrt{\frac{1}{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 99.6%
(FPCore (k n) :precision binary64 (if (<= k 2.8e-51) (/ 1.0 (* (sqrt k) (pow (* (* 2.0 PI) n) -0.5))) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 2.8e-51) {
tmp = 1.0 / (sqrt(k) * pow(((2.0 * ((double) M_PI)) * n), -0.5));
} else {
tmp = sqrt((pow((((double) M_PI) * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 2.8e-51) {
tmp = 1.0 / (Math.sqrt(k) * Math.pow(((2.0 * Math.PI) * n), -0.5));
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 2.8e-51: tmp = 1.0 / (math.sqrt(k) * math.pow(((2.0 * math.pi) * n), -0.5)) else: tmp = math.sqrt((math.pow((math.pi * (2.0 * n)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 2.8e-51) tmp = Float64(1.0 / Float64(sqrt(k) * (Float64(Float64(2.0 * pi) * n) ^ -0.5))); else tmp = sqrt(Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 2.8e-51) tmp = 1.0 / (sqrt(k) * (((2.0 * pi) * n) ^ -0.5)); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.8e-51], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.8 \cdot 10^{-51}:\\
\;\;\;\;\frac{1}{\sqrt{k} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{-0.5}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.8e-51Initial program 99.2%
Taylor expanded in k around 0 99.2%
associate-*l/99.3%
*-un-lft-identity99.3%
clear-num99.2%
*-commutative99.2%
sqrt-prod99.3%
*-commutative99.3%
Applied egg-rr99.3%
div-inv99.3%
pow1/299.3%
pow-flip99.4%
metadata-eval99.4%
Applied egg-rr99.4%
*-commutative99.4%
associate-*r*99.4%
rem-exp-log99.0%
rem-exp-log92.4%
exp-sum91.6%
+-commutative91.6%
exp-sum92.4%
rem-exp-log99.0%
rem-exp-log99.4%
Simplified99.4%
if 2.8e-51 < k Initial program 99.8%
Taylor expanded in k around 0 99.8%
Applied egg-rr99.2%
*-commutative99.2%
associate-*l*99.2%
distribute-rgt-in99.2%
metadata-eval99.2%
associate-*l*99.2%
metadata-eval99.2%
*-commutative99.2%
neg-mul-199.2%
sub-neg99.2%
Simplified99.2%
Final simplification99.3%
(FPCore (k n) :precision binary64 (if (<= k 4.7e-57) (/ 1.0 (* (sqrt k) (sqrt (/ (/ 0.5 n) PI)))) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 4.7e-57) {
tmp = 1.0 / (sqrt(k) * sqrt(((0.5 / n) / ((double) M_PI))));
} else {
tmp = sqrt((pow((((double) M_PI) * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 4.7e-57) {
tmp = 1.0 / (Math.sqrt(k) * Math.sqrt(((0.5 / n) / Math.PI)));
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 4.7e-57: tmp = 1.0 / (math.sqrt(k) * math.sqrt(((0.5 / n) / math.pi))) else: tmp = math.sqrt((math.pow((math.pi * (2.0 * n)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 4.7e-57) tmp = Float64(1.0 / Float64(sqrt(k) * sqrt(Float64(Float64(0.5 / n) / pi)))); else tmp = sqrt(Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 4.7e-57) tmp = 1.0 / (sqrt(k) * sqrt(((0.5 / n) / pi))); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 4.7e-57], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] * N[Sqrt[N[(N[(0.5 / n), $MachinePrecision] / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.7 \cdot 10^{-57}:\\
\;\;\;\;\frac{1}{\sqrt{k} \cdot \sqrt{\frac{\frac{0.5}{n}}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 4.6999999999999998e-57Initial program 99.1%
Taylor expanded in k around 0 99.2%
associate-*l/99.2%
*-un-lft-identity99.2%
clear-num99.2%
*-commutative99.2%
sqrt-prod99.3%
*-commutative99.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 77.4%
associate-*r/77.5%
*-rgt-identity77.5%
Simplified77.5%
sqrt-undiv77.5%
clear-num75.8%
associate-*l/75.6%
*-commutative75.6%
associate-/l/75.6%
*-commutative75.6%
metadata-eval75.6%
associate-*l/75.8%
times-frac75.8%
*-un-lft-identity75.8%
*-commutative75.8%
clear-num77.5%
associate-/l*77.4%
sqrt-prod99.4%
associate-/r*99.4%
Applied egg-rr99.4%
if 4.6999999999999998e-57 < k Initial program 99.8%
Taylor expanded in k around 0 99.8%
Applied egg-rr99.2%
*-commutative99.2%
associate-*l*99.2%
distribute-rgt-in99.2%
metadata-eval99.2%
associate-*l*99.2%
metadata-eval99.2%
*-commutative99.2%
neg-mul-199.2%
sub-neg99.2%
Simplified99.2%
Final simplification99.2%
(FPCore (k n) :precision binary64 (if (<= k 4.8e+80) (/ 1.0 (* (sqrt k) (sqrt (/ (/ 0.5 n) PI)))) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 4.8e+80) {
tmp = 1.0 / (sqrt(k) * sqrt(((0.5 / n) / ((double) M_PI))));
} 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 <= 4.8e+80) tmp = Float64(1.0 / Float64(sqrt(k) * sqrt(Float64(Float64(0.5 / n) / pi)))); 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, 4.8e+80], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] * N[Sqrt[N[(N[(0.5 / n), $MachinePrecision] / Pi), $MachinePrecision]], $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 4.8 \cdot 10^{+80}:\\
\;\;\;\;\frac{1}{\sqrt{k} \cdot \sqrt{\frac{\frac{0.5}{n}}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 4.79999999999999958e80Initial program 99.2%
Taylor expanded in k around 0 79.2%
associate-*l/79.3%
*-un-lft-identity79.3%
clear-num79.2%
*-commutative79.2%
sqrt-prod79.3%
*-commutative79.3%
Applied egg-rr79.3%
Taylor expanded in k around 0 64.6%
associate-*r/64.7%
*-rgt-identity64.7%
Simplified64.7%
sqrt-undiv64.7%
clear-num63.5%
associate-*l/63.4%
*-commutative63.4%
associate-/l/63.4%
*-commutative63.4%
metadata-eval63.4%
associate-*l/63.5%
times-frac63.5%
*-un-lft-identity63.5%
*-commutative63.5%
clear-num64.7%
associate-/l*64.6%
sqrt-prod79.3%
associate-/r*79.3%
Applied egg-rr79.3%
if 4.79999999999999958e80 < k Initial program 100.0%
Taylor expanded in k around 0 2.4%
associate-/l*2.4%
Simplified2.4%
*-commutative2.4%
sqrt-unprod2.4%
associate-*r/2.4%
*-commutative2.4%
Applied egg-rr2.4%
expm1-log1p-u2.4%
expm1-undefine22.7%
associate-/l*22.7%
Applied egg-rr22.7%
sub-neg22.7%
metadata-eval22.7%
+-commutative22.7%
log1p-undefine22.7%
rem-exp-log22.7%
+-commutative22.7%
associate-*r/22.7%
associate-*l/22.7%
*-commutative22.7%
fma-define22.7%
Simplified22.7%
(FPCore (k n) :precision binary64 (if (<= k 5e+80) (* (sqrt (/ 1.0 k)) (sqrt (* (* 2.0 PI) n))) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 5e+80) {
tmp = sqrt((1.0 / k)) * sqrt(((2.0 * ((double) M_PI)) * n));
} 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 <= 5e+80) tmp = Float64(sqrt(Float64(1.0 / k)) * sqrt(Float64(Float64(2.0 * pi) * n))); 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, 5e+80], N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * Pi), $MachinePrecision] * n), $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 5 \cdot 10^{+80}:\\
\;\;\;\;\sqrt{\frac{1}{k}} \cdot \sqrt{\left(2 \cdot \pi\right) \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 4.99999999999999961e80Initial program 99.2%
Taylor expanded in k around 0 63.4%
associate-/l*63.3%
Simplified63.3%
*-commutative63.3%
sqrt-unprod63.5%
associate-*r/63.6%
*-commutative63.6%
Applied egg-rr63.6%
pow1/263.6%
associate-*r/63.6%
div-inv63.5%
unpow-prod-down79.3%
pow1/279.3%
Applied egg-rr79.3%
unpow1/279.3%
*-commutative79.3%
associate-*r*79.3%
rem-exp-log79.1%
rem-exp-log73.9%
exp-sum73.3%
+-commutative73.3%
exp-sum73.9%
rem-exp-log79.1%
rem-exp-log79.3%
Simplified79.3%
if 4.99999999999999961e80 < k Initial program 100.0%
Taylor expanded in k around 0 2.4%
associate-/l*2.4%
Simplified2.4%
*-commutative2.4%
sqrt-unprod2.4%
associate-*r/2.4%
*-commutative2.4%
Applied egg-rr2.4%
expm1-log1p-u2.4%
expm1-undefine22.7%
associate-/l*22.7%
Applied egg-rr22.7%
sub-neg22.7%
metadata-eval22.7%
+-commutative22.7%
log1p-undefine22.7%
rem-exp-log22.7%
+-commutative22.7%
associate-*r/22.7%
associate-*l/22.7%
*-commutative22.7%
fma-define22.7%
Simplified22.7%
Final simplification56.3%
(FPCore (k n) :precision binary64 (if (<= k 5e+80) (/ (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 <= 5e+80) {
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 <= 5e+80) 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, 5e+80], 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 5 \cdot 10^{+80}:\\
\;\;\;\;\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 < 4.99999999999999961e80Initial program 99.2%
Taylor expanded in k around 0 79.2%
associate-*l/79.3%
*-un-lft-identity79.3%
clear-num79.2%
*-commutative79.2%
sqrt-prod79.3%
*-commutative79.3%
Applied egg-rr79.3%
associate-/r/79.2%
associate-*l/79.3%
*-lft-identity79.3%
*-commutative79.3%
associate-*l*79.3%
Simplified79.3%
if 4.99999999999999961e80 < k Initial program 100.0%
Taylor expanded in k around 0 2.4%
associate-/l*2.4%
Simplified2.4%
*-commutative2.4%
sqrt-unprod2.4%
associate-*r/2.4%
*-commutative2.4%
Applied egg-rr2.4%
expm1-log1p-u2.4%
expm1-undefine22.7%
associate-/l*22.7%
Applied egg-rr22.7%
sub-neg22.7%
metadata-eval22.7%
+-commutative22.7%
log1p-undefine22.7%
rem-exp-log22.7%
+-commutative22.7%
associate-*r/22.7%
associate-*l/22.7%
*-commutative22.7%
fma-define22.7%
Simplified22.7%
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.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 48.1%
associate-*l/48.1%
*-un-lft-identity48.1%
clear-num48.1%
*-commutative48.1%
sqrt-prod48.1%
*-commutative48.1%
Applied egg-rr48.1%
associate-/r/48.1%
associate-*l/48.1%
*-lft-identity48.1%
*-commutative48.1%
associate-*l*48.1%
Simplified48.1%
Final simplification48.1%
(FPCore (k n) :precision binary64 (pow (/ (* k 0.5) (* PI n)) -0.5))
double code(double k, double n) {
return pow(((k * 0.5) / (((double) M_PI) * n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k * 0.5) / (Math.PI * n)), -0.5);
}
def code(k, n): return math.pow(((k * 0.5) / (math.pi * n)), -0.5)
function code(k, n) return Float64(Float64(k * 0.5) / Float64(pi * n)) ^ -0.5 end
function tmp = code(k, n) tmp = ((k * 0.5) / (pi * n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k * 0.5), $MachinePrecision] / N[(Pi * n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k \cdot 0.5}{\pi \cdot n}\right)}^{-0.5}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 38.6%
associate-/l*38.6%
Simplified38.6%
*-commutative38.6%
sqrt-unprod38.7%
associate-*r/38.7%
*-commutative38.7%
Applied egg-rr38.7%
associate-*r/38.7%
sqrt-div48.1%
clear-num48.1%
inv-pow48.1%
sqrt-undiv39.4%
sqrt-pow239.4%
*-un-lft-identity39.4%
times-frac39.4%
metadata-eval39.4%
*-commutative39.4%
associate-/r*39.4%
metadata-eval39.4%
Applied egg-rr39.4%
associate-/l/39.4%
associate-*r/39.4%
*-commutative39.4%
*-commutative39.4%
Simplified39.4%
Final simplification39.4%
(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.5%
Taylor expanded in k around 0 38.6%
associate-/l*38.6%
Simplified38.6%
*-commutative38.6%
sqrt-unprod38.7%
associate-*r/38.7%
*-commutative38.7%
Applied egg-rr38.7%
associate-*r/38.7%
sqrt-div48.1%
clear-num48.1%
inv-pow48.1%
sqrt-undiv39.4%
sqrt-pow239.4%
*-un-lft-identity39.4%
times-frac39.4%
metadata-eval39.4%
*-commutative39.4%
associate-/r*39.4%
metadata-eval39.4%
Applied egg-rr39.4%
(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 38.6%
associate-/l*38.6%
Simplified38.6%
*-commutative38.6%
sqrt-unprod38.7%
associate-*r/38.7%
*-commutative38.7%
Applied egg-rr38.7%
(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(pi * Float64(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[(Pi * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left(\pi \cdot \frac{n}{k}\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 38.6%
associate-/l*38.6%
Simplified38.6%
*-commutative38.6%
sqrt-unprod38.7%
associate-*r/38.7%
*-commutative38.7%
Applied egg-rr38.7%
*-commutative38.7%
associate-*l/38.7%
Applied egg-rr38.7%
Final simplification38.7%
herbie shell --seed 2024116
(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))))