
(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 (/ (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 (if (<= k 7.6e-56) (/ (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 <= 7.6e-56) {
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 <= 7.6e-56) {
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 <= 7.6e-56: 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 <= 7.6e-56) tmp = Float64(sqrt(Float64(2.0 * n)) / sqrt(Float64(k / pi))); else tmp = sqrt(Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 7.6e-56) 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, 7.6e-56], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 7.6 \cdot 10^{-56}:\\
\;\;\;\;\frac{\sqrt{2 \cdot n}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 7.6000000000000004e-56Initial program 99.3%
Taylor expanded in k around 0 72.9%
associate-/l*72.9%
Simplified72.9%
*-commutative72.9%
sqrt-unprod73.1%
Applied egg-rr73.1%
*-un-lft-identity73.1%
clear-num73.0%
un-div-inv73.0%
Applied egg-rr73.0%
*-lft-identity73.0%
associate-/r/73.0%
Simplified73.0%
sqrt-prod72.8%
div-inv72.8%
associate-*r*72.8%
*-commutative72.8%
sqrt-prod99.2%
un-div-inv99.3%
clear-num99.3%
sqrt-prod72.8%
div-inv72.9%
sqrt-prod73.0%
associate-*r/73.0%
*-commutative73.0%
sqrt-div99.5%
Applied egg-rr99.5%
if 7.6000000000000004e-56 < k Initial program 99.7%
Applied egg-rr98.5%
*-commutative98.5%
distribute-lft-in98.5%
metadata-eval98.5%
*-commutative98.5%
associate-*r*98.5%
metadata-eval98.5%
neg-mul-198.5%
sub-neg98.5%
Simplified98.5%
Final simplification98.9%
(FPCore (k n) :precision binary64 (if (<= k 3.8e+68) (/ (sqrt (* 2.0 n)) (sqrt (/ k PI))) (sqrt (+ -1.0 (fma n (* PI (/ 2.0 k)) 1.0)))))
double code(double k, double n) {
double tmp;
if (k <= 3.8e+68) {
tmp = sqrt((2.0 * n)) / sqrt((k / ((double) M_PI)));
} else {
tmp = sqrt((-1.0 + fma(n, (((double) M_PI) * (2.0 / k)), 1.0)));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 3.8e+68) tmp = Float64(sqrt(Float64(2.0 * n)) / sqrt(Float64(k / pi))); else tmp = sqrt(Float64(-1.0 + fma(n, Float64(pi * Float64(2.0 / k)), 1.0))); end return tmp end
code[k_, n_] := If[LessEqual[k, 3.8e+68], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(-1.0 + N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.8 \cdot 10^{+68}:\\
\;\;\;\;\frac{\sqrt{2 \cdot n}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-1 + \mathsf{fma}\left(n, \pi \cdot \frac{2}{k}, 1\right)}\\
\end{array}
\end{array}
if k < 3.8000000000000001e68Initial program 99.3%
Taylor expanded in k around 0 60.5%
associate-/l*60.5%
Simplified60.5%
*-commutative60.5%
sqrt-unprod60.7%
Applied egg-rr60.7%
*-un-lft-identity60.7%
clear-num60.6%
un-div-inv60.6%
Applied egg-rr60.6%
*-lft-identity60.6%
associate-/r/60.6%
Simplified60.6%
sqrt-prod60.5%
div-inv60.4%
associate-*r*60.5%
*-commutative60.5%
sqrt-prod79.3%
un-div-inv79.3%
clear-num79.3%
sqrt-prod60.5%
div-inv60.5%
sqrt-prod60.6%
associate-*r/60.6%
*-commutative60.6%
sqrt-div79.5%
Applied egg-rr79.5%
if 3.8000000000000001e68 < k Initial program 100.0%
Taylor expanded in k around 0 2.8%
associate-/l*2.8%
Simplified2.8%
*-commutative2.8%
sqrt-unprod2.8%
Applied egg-rr2.8%
*-un-lft-identity2.8%
clear-num2.8%
un-div-inv2.8%
Applied egg-rr2.8%
*-lft-identity2.8%
associate-/r/2.8%
Simplified2.8%
associate-/r/2.8%
expm1-log1p-u2.8%
expm1-undefine34.0%
associate-*r/34.0%
*-commutative34.0%
div-inv34.0%
clear-num34.0%
Applied egg-rr34.0%
sub-neg34.0%
metadata-eval34.0%
+-commutative34.0%
log1p-undefine34.0%
rem-exp-log34.0%
+-commutative34.0%
associate-*l*34.0%
fma-define34.0%
associate-*r/34.0%
*-commutative34.0%
associate-/l*34.0%
Simplified34.0%
Final simplification62.6%
(FPCore (k n) :precision binary64 (if (<= k 3e+68) (/ (sqrt (* 2.0 n)) (sqrt (/ k PI))) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 3e+68) {
tmp = sqrt((2.0 * n)) / sqrt((k / ((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 <= 3e+68) tmp = Float64(sqrt(Float64(2.0 * n)) / sqrt(Float64(k / 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, 3e+68], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $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 3 \cdot 10^{+68}:\\
\;\;\;\;\frac{\sqrt{2 \cdot n}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 3.0000000000000002e68Initial program 99.3%
Taylor expanded in k around 0 60.5%
associate-/l*60.5%
Simplified60.5%
*-commutative60.5%
sqrt-unprod60.7%
Applied egg-rr60.7%
*-un-lft-identity60.7%
clear-num60.6%
un-div-inv60.6%
Applied egg-rr60.6%
*-lft-identity60.6%
associate-/r/60.6%
Simplified60.6%
sqrt-prod60.5%
div-inv60.4%
associate-*r*60.5%
*-commutative60.5%
sqrt-prod79.3%
un-div-inv79.3%
clear-num79.3%
sqrt-prod60.5%
div-inv60.5%
sqrt-prod60.6%
associate-*r/60.6%
*-commutative60.6%
sqrt-div79.5%
Applied egg-rr79.5%
if 3.0000000000000002e68 < k Initial program 100.0%
Taylor expanded in k around 0 2.8%
associate-/l*2.8%
Simplified2.8%
*-commutative2.8%
sqrt-unprod2.8%
Applied egg-rr2.8%
expm1-log1p-u2.8%
expm1-undefine34.0%
Applied egg-rr34.0%
sub-neg34.0%
metadata-eval34.0%
+-commutative34.0%
log1p-undefine34.0%
rem-exp-log34.0%
+-commutative34.0%
fma-define34.0%
Simplified34.0%
Final simplification62.6%
(FPCore (k n) :precision binary64 (if (<= k 4.8e+243) (/ (sqrt (* 2.0 n)) (sqrt (/ k PI))) (cbrt (pow (* 2.0 (/ n (/ k PI))) 1.5))))
double code(double k, double n) {
double tmp;
if (k <= 4.8e+243) {
tmp = sqrt((2.0 * n)) / sqrt((k / ((double) M_PI)));
} else {
tmp = cbrt(pow((2.0 * (n / (k / ((double) M_PI)))), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 4.8e+243) {
tmp = Math.sqrt((2.0 * n)) / Math.sqrt((k / Math.PI));
} else {
tmp = Math.cbrt(Math.pow((2.0 * (n / (k / Math.PI))), 1.5));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 4.8e+243) tmp = Float64(sqrt(Float64(2.0 * n)) / sqrt(Float64(k / pi))); else tmp = cbrt((Float64(2.0 * Float64(n / Float64(k / pi))) ^ 1.5)); end return tmp end
code[k_, n_] := If[LessEqual[k, 4.8e+243], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(2.0 * N[(n / N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.8 \cdot 10^{+243}:\\
\;\;\;\;\frac{\sqrt{2 \cdot n}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(2 \cdot \frac{n}{\frac{k}{\pi}}\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 4.8000000000000001e243Initial program 99.5%
Taylor expanded in k around 0 42.5%
associate-/l*42.5%
Simplified42.5%
*-commutative42.5%
sqrt-unprod42.6%
Applied egg-rr42.6%
*-un-lft-identity42.6%
clear-num42.5%
un-div-inv42.5%
Applied egg-rr42.5%
*-lft-identity42.5%
associate-/r/42.6%
Simplified42.6%
sqrt-prod42.4%
div-inv42.4%
associate-*r*42.4%
*-commutative42.4%
sqrt-prod55.4%
un-div-inv55.4%
clear-num55.4%
sqrt-prod42.4%
div-inv42.5%
sqrt-prod42.5%
associate-*r/42.5%
*-commutative42.5%
sqrt-div55.6%
Applied egg-rr55.6%
if 4.8000000000000001e243 < k Initial program 100.0%
Taylor expanded in k around 0 3.1%
associate-/l*3.1%
Simplified3.1%
*-commutative3.1%
sqrt-unprod3.1%
Applied egg-rr3.1%
add-cbrt-cube29.2%
add-sqr-sqrt29.2%
pow129.2%
pow1/229.2%
pow-prod-up29.2%
clear-num29.2%
un-div-inv29.2%
metadata-eval29.2%
Applied egg-rr29.2%
Final simplification53.3%
(FPCore (k n) :precision binary64 (/ (sqrt (* 2.0 n)) (sqrt (/ k PI))))
double code(double k, double n) {
return sqrt((2.0 * n)) / sqrt((k / ((double) M_PI)));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * n)) / Math.sqrt((k / Math.PI));
}
def code(k, n): return math.sqrt((2.0 * n)) / math.sqrt((k / math.pi))
function code(k, n) return Float64(sqrt(Float64(2.0 * n)) / sqrt(Float64(k / pi))) end
function tmp = code(k, n) tmp = sqrt((2.0 * n)) / sqrt((k / pi)); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2 \cdot n}}{\sqrt{\frac{k}{\pi}}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 39.1%
associate-/l*39.1%
Simplified39.1%
*-commutative39.1%
sqrt-unprod39.2%
Applied egg-rr39.2%
*-un-lft-identity39.2%
clear-num39.1%
un-div-inv39.1%
Applied egg-rr39.1%
*-lft-identity39.1%
associate-/r/39.2%
Simplified39.2%
sqrt-prod39.1%
div-inv39.0%
associate-*r*39.1%
*-commutative39.1%
sqrt-prod50.9%
un-div-inv50.9%
clear-num50.9%
sqrt-prod39.1%
div-inv39.1%
sqrt-prod39.1%
associate-*r/39.1%
*-commutative39.1%
sqrt-div51.0%
Applied egg-rr51.0%
Final simplification51.0%
(FPCore (k n) :precision binary64 (/ (sqrt (* 2.0 (* PI n))) (sqrt k)))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) * n))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI * n))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((2.0 * (math.pi * n))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(2.0 * Float64(pi * n))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi * n))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{2 \cdot \left(\pi \cdot n\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 50.9%
associate-*l/50.9%
*-un-lft-identity50.9%
sqrt-unprod51.0%
*-commutative51.0%
*-commutative51.0%
Applied egg-rr51.0%
(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.5%
Taylor expanded in k around 0 39.1%
associate-/l*39.1%
Simplified39.1%
*-commutative39.1%
sqrt-unprod39.2%
Applied egg-rr39.2%
pow1/239.2%
associate-*r*39.2%
unpow-prod-down51.0%
pow1/251.0%
Applied egg-rr51.0%
unpow1/251.0%
*-commutative51.0%
Simplified51.0%
Final simplification51.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 39.1%
associate-/l*39.1%
Simplified39.1%
*-commutative39.1%
sqrt-unprod39.2%
Applied egg-rr39.2%
associate-*r/39.2%
associate-*r/39.2%
*-commutative39.2%
sqrt-undiv51.0%
pow1/251.0%
metadata-eval51.0%
pow-flip51.0%
clear-num50.9%
pow-flip50.9%
metadata-eval50.9%
pow1/250.9%
sqrt-undiv39.8%
*-commutative39.8%
associate-*l*39.8%
Applied egg-rr39.8%
Final simplification39.8%
(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.5%
Taylor expanded in k around 0 39.1%
associate-/l*39.1%
Simplified39.1%
*-commutative39.1%
sqrt-unprod39.2%
Applied egg-rr39.2%
herbie shell --seed 2024188
(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))))