
(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 (* n (* 2.0 PI))))
(if (<= k 5.5e-76)
(/ (sqrt t_0) (sqrt k))
(/ 1.0 (sqrt (/ k (pow t_0 (- 1.0 k))))))))
double code(double k, double n) {
double t_0 = n * (2.0 * ((double) M_PI));
double tmp;
if (k <= 5.5e-76) {
tmp = sqrt(t_0) / sqrt(k);
} else {
tmp = 1.0 / sqrt((k / pow(t_0, (1.0 - k))));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = n * (2.0 * Math.PI);
double tmp;
if (k <= 5.5e-76) {
tmp = Math.sqrt(t_0) / Math.sqrt(k);
} else {
tmp = 1.0 / Math.sqrt((k / Math.pow(t_0, (1.0 - k))));
}
return tmp;
}
def code(k, n): t_0 = n * (2.0 * math.pi) tmp = 0 if k <= 5.5e-76: tmp = math.sqrt(t_0) / math.sqrt(k) else: tmp = 1.0 / math.sqrt((k / math.pow(t_0, (1.0 - k)))) return tmp
function code(k, n) t_0 = Float64(n * Float64(2.0 * pi)) tmp = 0.0 if (k <= 5.5e-76) tmp = Float64(sqrt(t_0) / sqrt(k)); else tmp = Float64(1.0 / sqrt(Float64(k / (t_0 ^ Float64(1.0 - k))))); end return tmp end
function tmp_2 = code(k, n) t_0 = n * (2.0 * pi); tmp = 0.0; if (k <= 5.5e-76) tmp = sqrt(t_0) / sqrt(k); else tmp = 1.0 / sqrt((k / (t_0 ^ (1.0 - k)))); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 5.5e-76], N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k / N[Power[t$95$0, N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := n \cdot \left(2 \cdot \pi\right)\\
\mathbf{if}\;k \leq 5.5 \cdot 10^{-76}:\\
\;\;\;\;\frac{\sqrt{t\_0}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{\frac{k}{{t\_0}^{\left(1 - k\right)}}}}\\
\end{array}
\end{array}
if k < 5.50000000000000014e-76Initial program 99.3%
Taylor expanded in k around 0 99.0%
associate-*l/99.2%
*-un-lft-identity99.2%
sqrt-unprod99.5%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
Applied egg-rr99.5%
if 5.50000000000000014e-76 < k Initial program 98.7%
associate-/r/98.7%
associate-*l*98.7%
div-inv98.7%
metadata-eval98.7%
Applied egg-rr98.7%
add-sqr-sqrt98.6%
sqrt-unprod98.7%
frac-times98.7%
add-sqr-sqrt98.7%
pow-unpow98.7%
*-commutative98.7%
associate-*r*98.7%
pow-unpow98.7%
*-commutative98.7%
associate-*r*98.7%
Applied egg-rr98.7%
Final simplification98.9%
(FPCore (k n) :precision binary64 (if (<= k 2.15e-75) (/ (sqrt (* n (* 2.0 PI))) (sqrt k)) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 2.15e-75) {
tmp = sqrt((n * (2.0 * ((double) M_PI)))) / sqrt(k);
} 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.15e-75) {
tmp = Math.sqrt((n * (2.0 * Math.PI))) / Math.sqrt(k);
} 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.15e-75: tmp = math.sqrt((n * (2.0 * math.pi))) / math.sqrt(k) 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.15e-75) tmp = Float64(sqrt(Float64(n * Float64(2.0 * pi))) / sqrt(k)); 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.15e-75) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.15e-75], N[(N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $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.15 \cdot 10^{-75}:\\
\;\;\;\;\frac{\sqrt{n \cdot \left(2 \cdot \pi\right)}}{\sqrt{k}}\\
\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.15e-75Initial program 99.3%
Taylor expanded in k around 0 99.0%
associate-*l/99.2%
*-un-lft-identity99.2%
sqrt-unprod99.5%
*-commutative99.5%
*-commutative99.5%
associate-*r*99.5%
Applied egg-rr99.5%
if 2.15e-75 < k Initial program 98.7%
add-sqr-sqrt98.6%
sqrt-unprod98.7%
*-commutative98.7%
div-sub98.7%
metadata-eval98.7%
div-inv98.6%
*-commutative98.6%
div-sub98.6%
metadata-eval98.6%
div-inv98.7%
Applied egg-rr98.7%
sqr-pow98.7%
pow-sqr98.7%
associate-*r*98.7%
associate-/l*98.7%
metadata-eval98.7%
associate-*r*98.7%
*-commutative98.7%
associate-*r*98.7%
metadata-eval98.7%
associate-*r*98.7%
metadata-eval98.7%
*-lft-identity98.7%
*-commutative98.7%
associate-*l*98.7%
Simplified98.7%
Final simplification98.9%
(FPCore (k n) :precision binary64 (if (<= k 2e+61) (/ (sqrt (* n (* 2.0 PI))) (sqrt k)) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 2e+61) {
tmp = sqrt((n * (2.0 * ((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 <= 2e+61) tmp = Float64(sqrt(Float64(n * Float64(2.0 * 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, 2e+61], N[(N[Sqrt[N[(n * N[(2.0 * Pi), $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 2 \cdot 10^{+61}:\\
\;\;\;\;\frac{\sqrt{n \cdot \left(2 \cdot \pi\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 < 1.9999999999999999e61Initial program 97.8%
Taylor expanded in k around 0 72.1%
associate-*l/72.1%
*-un-lft-identity72.1%
sqrt-unprod72.3%
*-commutative72.3%
*-commutative72.3%
associate-*r*72.3%
Applied egg-rr72.3%
if 1.9999999999999999e61 < k Initial program 100.0%
Taylor expanded in k around 0 1.7%
pow11.7%
associate-*l/1.7%
*-un-lft-identity1.7%
*-commutative1.7%
sqrt-prod1.7%
associate-*r*1.7%
sqrt-undiv1.7%
associate-*r*1.7%
*-commutative1.7%
associate-*r*1.7%
Applied egg-rr1.7%
unpow11.7%
associate-*l*1.7%
*-commutative1.7%
associate-*r/1.7%
Simplified1.7%
expm1-log1p-u1.7%
expm1-undefine31.3%
associate-/l*31.3%
Applied egg-rr31.3%
sub-neg31.3%
metadata-eval31.3%
+-commutative31.3%
log1p-undefine31.3%
rem-exp-log31.3%
+-commutative31.3%
fma-define31.3%
Simplified31.3%
Final simplification52.8%
(FPCore (k n) :precision binary64 (if (<= k 1.9e+62) (/ 1.0 (/ (sqrt 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 <= 1.9e+62) {
tmp = 1.0 / (sqrt(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 <= 1.9e+62) tmp = Float64(1.0 / Float64(sqrt(k) / sqrt(Float64(2.0 * Float64(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, 1.9e+62], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $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 1.9 \cdot 10^{+62}:\\
\;\;\;\;\frac{1}{\frac{\sqrt{k}}{\sqrt{2 \cdot \left(\pi \cdot n\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 1.89999999999999992e62Initial program 97.8%
Taylor expanded in k around 0 72.1%
pow172.1%
associate-*l/72.1%
*-un-lft-identity72.1%
*-commutative72.1%
sqrt-prod72.3%
associate-*r*72.3%
sqrt-undiv57.2%
associate-*r*57.2%
*-commutative57.2%
associate-*r*57.2%
Applied egg-rr57.2%
unpow157.2%
associate-*l*57.2%
*-commutative57.2%
associate-*r/57.2%
Simplified57.2%
associate-*r/57.2%
*-commutative57.2%
associate-*r*57.2%
sqrt-div72.3%
clear-num72.4%
associate-*r*72.4%
Applied egg-rr72.4%
if 1.89999999999999992e62 < k Initial program 100.0%
Taylor expanded in k around 0 1.7%
pow11.7%
associate-*l/1.7%
*-un-lft-identity1.7%
*-commutative1.7%
sqrt-prod1.7%
associate-*r*1.7%
sqrt-undiv1.7%
associate-*r*1.7%
*-commutative1.7%
associate-*r*1.7%
Applied egg-rr1.7%
unpow11.7%
associate-*l*1.7%
*-commutative1.7%
associate-*r/1.7%
Simplified1.7%
expm1-log1p-u1.7%
expm1-undefine31.3%
associate-/l*31.3%
Applied egg-rr31.3%
sub-neg31.3%
metadata-eval31.3%
+-commutative31.3%
log1p-undefine31.3%
rem-exp-log31.3%
+-commutative31.3%
fma-define31.3%
Simplified31.3%
Final simplification52.8%
(FPCore (k n) :precision binary64 (/ 1.0 (/ (sqrt k) (pow (* 2.0 (* PI n)) (* (- 1.0 k) 0.5)))))
double code(double k, double n) {
return 1.0 / (sqrt(k) / pow((2.0 * (((double) M_PI) * n)), ((1.0 - k) * 0.5)));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) / Math.pow((2.0 * (Math.PI * n)), ((1.0 - k) * 0.5)));
}
def code(k, n): return 1.0 / (math.sqrt(k) / math.pow((2.0 * (math.pi * n)), ((1.0 - k) * 0.5)))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) / (Float64(2.0 * Float64(pi * n)) ^ Float64(Float64(1.0 - k) * 0.5)))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) / ((2.0 * (pi * n)) ^ ((1.0 - k) * 0.5))); end
code[k_, n_] := N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\sqrt{k}}{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(\left(1 - k\right) \cdot 0.5\right)}}}
\end{array}
Initial program 98.9%
associate-/r/98.9%
associate-*l*98.9%
div-inv98.9%
metadata-eval98.9%
Applied egg-rr98.9%
Final simplification98.9%
(FPCore (k n) :precision binary64 (/ (pow (* n (* 2.0 PI)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((n * (2.0 * ((double) M_PI))), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((n * (2.0 * Math.PI)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((n * (2.0 * math.pi)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((n * (2.0 * pi)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 98.9%
associate-*l/98.9%
*-lft-identity98.9%
div-sub98.9%
metadata-eval98.9%
Simplified98.9%
Final simplification98.9%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (fabs (* n (/ PI k))))))
double code(double k, double n) {
return sqrt((2.0 * fabs((n * (((double) M_PI) / k)))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * Math.abs((n * (Math.PI / k)))));
}
def code(k, n): return math.sqrt((2.0 * math.fabs((n * (math.pi / k)))))
function code(k, n) return sqrt(Float64(2.0 * abs(Float64(n * Float64(pi / k))))) end
function tmp = code(k, n) tmp = sqrt((2.0 * abs((n * (pi / k))))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[Abs[N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \left|n \cdot \frac{\pi}{k}\right|}
\end{array}
Initial program 98.9%
Taylor expanded in k around 0 38.5%
pow138.5%
associate-*l/38.6%
*-un-lft-identity38.6%
*-commutative38.6%
sqrt-prod38.7%
associate-*r*38.7%
sqrt-undiv30.7%
associate-*r*30.7%
*-commutative30.7%
associate-*r*30.7%
Applied egg-rr30.7%
unpow130.7%
associate-*l*30.7%
*-commutative30.7%
associate-*r/30.7%
Simplified30.7%
add-sqr-sqrt30.7%
sqrt-unprod22.4%
pow222.4%
associate-/l*22.4%
Applied egg-rr22.4%
unpow222.4%
rem-sqrt-square31.4%
Simplified31.4%
Final simplification31.4%
(FPCore (k n) :precision binary64 (sqrt (/ (fabs (* 2.0 (* PI n))) k)))
double code(double k, double n) {
return sqrt((fabs((2.0 * (((double) M_PI) * n))) / k));
}
public static double code(double k, double n) {
return Math.sqrt((Math.abs((2.0 * (Math.PI * n))) / k));
}
def code(k, n): return math.sqrt((math.fabs((2.0 * (math.pi * n))) / k))
function code(k, n) return sqrt(Float64(abs(Float64(2.0 * Float64(pi * n))) / k)) end
function tmp = code(k, n) tmp = sqrt((abs((2.0 * (pi * n))) / k)); end
code[k_, n_] := N[Sqrt[N[(N[Abs[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\left|2 \cdot \left(\pi \cdot n\right)\right|}{k}}
\end{array}
Initial program 98.9%
add-sqr-sqrt98.7%
sqrt-unprod90.9%
*-commutative90.9%
div-sub90.9%
metadata-eval90.9%
div-inv90.9%
*-commutative90.9%
div-sub90.9%
metadata-eval90.9%
div-inv90.9%
Applied egg-rr91.0%
sqr-pow90.9%
pow-sqr91.0%
associate-*r*91.0%
associate-/l*91.0%
metadata-eval91.0%
associate-*r*91.0%
*-commutative91.0%
associate-*r*91.0%
metadata-eval91.0%
associate-*r*91.0%
metadata-eval91.0%
*-lft-identity91.0%
*-commutative91.0%
associate-*l*91.0%
Simplified91.0%
add-sqr-sqrt69.8%
pow1/269.8%
pow1/269.8%
pow-prod-down80.7%
pow280.7%
associate-*r*80.7%
*-commutative80.7%
associate-*r*80.7%
Applied egg-rr80.7%
unpow1/280.7%
unpow280.7%
rem-sqrt-square91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in k around 0 31.4%
Final simplification31.4%
(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 98.9%
Taylor expanded in k around 0 38.5%
pow138.5%
associate-*l/38.6%
*-un-lft-identity38.6%
*-commutative38.6%
sqrt-prod38.7%
associate-*r*38.7%
sqrt-undiv30.7%
associate-*r*30.7%
*-commutative30.7%
associate-*r*30.7%
Applied egg-rr30.7%
unpow130.7%
associate-*l*30.7%
*-commutative30.7%
associate-*r/30.7%
Simplified30.7%
*-commutative30.7%
associate-/l*30.7%
Applied egg-rr30.7%
associate-*r*30.7%
associate-*r/30.7%
*-commutative30.7%
associate-*r/30.7%
sqrt-prod38.7%
*-commutative38.7%
associate-/l*38.6%
Applied egg-rr38.6%
associate-*r/38.7%
associate-*l/38.7%
*-commutative38.7%
Simplified38.7%
Final simplification38.7%
(FPCore (k n) :precision binary64 (/ (sqrt (* n (* 2.0 PI))) (sqrt k)))
double code(double k, double n) {
return sqrt((n * (2.0 * ((double) M_PI)))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 * Math.PI))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((n * (2.0 * math.pi))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(n * Float64(2.0 * pi))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n \cdot \left(2 \cdot \pi\right)}}{\sqrt{k}}
\end{array}
Initial program 98.9%
Taylor expanded in k around 0 38.5%
associate-*l/38.6%
*-un-lft-identity38.6%
sqrt-unprod38.7%
*-commutative38.7%
*-commutative38.7%
associate-*r*38.7%
Applied egg-rr38.7%
Final simplification38.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 98.9%
Taylor expanded in k around 0 38.5%
pow138.5%
associate-*l/38.6%
*-un-lft-identity38.6%
*-commutative38.6%
sqrt-prod38.7%
associate-*r*38.7%
sqrt-undiv30.7%
associate-*r*30.7%
*-commutative30.7%
associate-*r*30.7%
Applied egg-rr30.7%
unpow130.7%
associate-*l*30.7%
*-commutative30.7%
associate-*r/30.7%
Simplified30.7%
*-commutative30.7%
associate-/l*30.7%
Applied egg-rr30.7%
Final simplification30.7%
(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 98.9%
Taylor expanded in k around 0 38.5%
pow138.5%
associate-*l/38.6%
*-un-lft-identity38.6%
*-commutative38.6%
sqrt-prod38.7%
associate-*r*38.7%
sqrt-undiv30.7%
associate-*r*30.7%
*-commutative30.7%
associate-*r*30.7%
Applied egg-rr30.7%
unpow130.7%
associate-*l*30.7%
*-commutative30.7%
associate-*r/30.7%
Simplified30.7%
*-commutative30.7%
associate-/l*30.7%
Applied egg-rr30.7%
*-commutative30.7%
associate-*l/30.7%
associate-*r/30.7%
clear-num30.7%
un-div-inv30.7%
Applied egg-rr30.7%
Final simplification30.7%
herbie shell --seed 2024062
(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))))