
(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 11 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)))) (/ (/ (sqrt t_0) (sqrt k)) (pow t_0 (* k 0.5)))))
double code(double k, double n) {
double t_0 = n * (2.0 * ((double) M_PI));
return (sqrt(t_0) / sqrt(k)) / pow(t_0, (k * 0.5));
}
public static double code(double k, double n) {
double t_0 = n * (2.0 * Math.PI);
return (Math.sqrt(t_0) / Math.sqrt(k)) / Math.pow(t_0, (k * 0.5));
}
def code(k, n): t_0 = n * (2.0 * math.pi) return (math.sqrt(t_0) / math.sqrt(k)) / math.pow(t_0, (k * 0.5))
function code(k, n) t_0 = Float64(n * Float64(2.0 * pi)) return Float64(Float64(sqrt(t_0) / sqrt(k)) / (t_0 ^ Float64(k * 0.5))) end
function tmp = code(k, n) t_0 = n * (2.0 * pi); tmp = (sqrt(t_0) / sqrt(k)) / (t_0 ^ (k * 0.5)); end
code[k_, n_] := Block[{t$95$0 = N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] / N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := n \cdot \left(2 \cdot \pi\right)\\
\frac{\frac{\sqrt{t\_0}}{\sqrt{k}}}{{t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.3%
associate-*l/99.3%
*-un-lft-identity99.3%
*-commutative99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
pow-sub99.7%
pow1/299.7%
associate-/l/99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
Applied egg-rr99.6%
associate-/r*99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
*-commutative99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* n (* 2.0 PI)))) (/ (sqrt t_0) (* (sqrt k) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = n * (2.0 * ((double) M_PI));
return sqrt(t_0) / (sqrt(k) * pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = n * (2.0 * Math.PI);
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = n * (2.0 * math.pi) return math.sqrt(t_0) / (math.sqrt(k) * math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(n * Float64(2.0 * pi)) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = n * (2.0 * pi); tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(n * N[(2.0 * Pi), $MachinePrecision]), $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 := n \cdot \left(2 \cdot \pi\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k} \cdot {t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.3%
associate-*l/99.3%
*-un-lft-identity99.3%
*-commutative99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
pow-sub99.7%
pow1/299.7%
associate-/l/99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
Applied egg-rr99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
*-commutative99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 1.8e-17) (/ (sqrt (* n 2.0)) (sqrt (/ k PI))) (/ 1.0 (sqrt (* k (pow (* PI (* n 2.0)) (+ k -1.0)))))))
double code(double k, double n) {
double tmp;
if (k <= 1.8e-17) {
tmp = sqrt((n * 2.0)) / sqrt((k / ((double) M_PI)));
} else {
tmp = 1.0 / sqrt((k * pow((((double) M_PI) * (n * 2.0)), (k + -1.0))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.8e-17) {
tmp = Math.sqrt((n * 2.0)) / Math.sqrt((k / Math.PI));
} else {
tmp = 1.0 / Math.sqrt((k * Math.pow((Math.PI * (n * 2.0)), (k + -1.0))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.8e-17: tmp = math.sqrt((n * 2.0)) / math.sqrt((k / math.pi)) else: tmp = 1.0 / math.sqrt((k * math.pow((math.pi * (n * 2.0)), (k + -1.0)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.8e-17) tmp = Float64(sqrt(Float64(n * 2.0)) / sqrt(Float64(k / pi))); else tmp = Float64(1.0 / sqrt(Float64(k * (Float64(pi * Float64(n * 2.0)) ^ Float64(k + -1.0))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.8e-17) tmp = sqrt((n * 2.0)) / sqrt((k / pi)); else tmp = 1.0 / sqrt((k * ((pi * (n * 2.0)) ^ (k + -1.0)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.8e-17], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k * N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(k + -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.8 \cdot 10^{-17}:\\
\;\;\;\;\frac{\sqrt{n \cdot 2}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{k \cdot {\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(k + -1\right)}}}\\
\end{array}
\end{array}
if k < 1.79999999999999997e-17Initial program 99.2%
add-sqr-sqrt98.9%
pow298.9%
Applied egg-rr98.7%
Taylor expanded in k around 0 80.4%
associate-*r/80.4%
associate-*r*80.4%
*-commutative80.4%
associate-/l*80.3%
*-commutative80.3%
Simplified80.3%
pow-pow80.8%
metadata-eval80.8%
pow1/280.8%
sqrt-div99.3%
Applied egg-rr99.3%
if 1.79999999999999997e-17 < k Initial program 99.3%
*-commutative99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
sub-neg99.3%
unpow-prod-up99.9%
pow1/299.9%
associate-*r*99.9%
*-commutative99.9%
associate-*l*99.9%
associate-*r*99.9%
*-commutative99.9%
associate-*l*99.9%
div-inv99.9%
metadata-eval99.9%
distribute-rgt-neg-in99.9%
metadata-eval99.9%
Applied egg-rr99.9%
associate-*l/99.9%
Applied egg-rr99.4%
Final simplification99.4%
(FPCore (k n) :precision binary64 (if (<= k 1.4e-21) (/ (sqrt (* n 2.0)) (sqrt (/ k PI))) (sqrt (/ (pow (* n (* 2.0 PI)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.4e-21) {
tmp = sqrt((n * 2.0)) / sqrt((k / ((double) M_PI)));
} else {
tmp = sqrt((pow((n * (2.0 * ((double) M_PI))), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.4e-21) {
tmp = Math.sqrt((n * 2.0)) / Math.sqrt((k / Math.PI));
} else {
tmp = Math.sqrt((Math.pow((n * (2.0 * Math.PI)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.4e-21: tmp = math.sqrt((n * 2.0)) / math.sqrt((k / math.pi)) else: tmp = math.sqrt((math.pow((n * (2.0 * math.pi)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.4e-21) tmp = Float64(sqrt(Float64(n * 2.0)) / sqrt(Float64(k / pi))); else tmp = sqrt(Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.4e-21) tmp = sqrt((n * 2.0)) / sqrt((k / pi)); else tmp = sqrt((((n * (2.0 * pi)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.4e-21], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.4 \cdot 10^{-21}:\\
\;\;\;\;\frac{\sqrt{n \cdot 2}}{\sqrt{\frac{k}{\pi}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.40000000000000002e-21Initial program 99.3%
add-sqr-sqrt98.9%
pow298.9%
Applied egg-rr98.7%
Taylor expanded in k around 0 79.9%
associate-*r/79.9%
associate-*r*79.9%
*-commutative79.9%
associate-/l*79.9%
*-commutative79.9%
Simplified79.9%
pow-pow80.3%
metadata-eval80.3%
pow1/280.3%
sqrt-div99.4%
Applied egg-rr99.4%
if 1.40000000000000002e-21 < k Initial program 99.3%
add-sqr-sqrt99.3%
sqrt-unprod99.3%
*-commutative99.3%
*-commutative99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
div-inv99.3%
*-commutative99.3%
Applied egg-rr99.3%
Simplified99.3%
Final simplification99.4%
(FPCore (k n) :precision binary64 (if (<= k 1.95e+54) (/ (sqrt (* n 2.0)) (sqrt (/ k PI))) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 1.95e+54) {
tmp = sqrt((n * 2.0)) / 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 <= 1.95e+54) tmp = Float64(sqrt(Float64(n * 2.0)) / 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, 1.95e+54], N[(N[Sqrt[N[(n * 2.0), $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 1.95 \cdot 10^{+54}:\\
\;\;\;\;\frac{\sqrt{n \cdot 2}}{\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 < 1.9500000000000001e54Initial program 98.8%
add-sqr-sqrt98.5%
pow298.5%
Applied egg-rr98.3%
Taylor expanded in k around 0 68.3%
associate-*r/68.3%
associate-*r*68.3%
*-commutative68.3%
associate-/l*68.3%
*-commutative68.3%
Simplified68.3%
pow-pow68.6%
metadata-eval68.6%
pow1/268.6%
sqrt-div83.4%
Applied egg-rr83.4%
if 1.9500000000000001e54 < k Initial program 100.0%
add-sqr-sqrt100.0%
pow2100.0%
Applied egg-rr100.0%
Taylor expanded in k around 0 2.6%
associate-*r/2.6%
associate-*r*2.6%
*-commutative2.6%
associate-/l*2.6%
*-commutative2.6%
Simplified2.6%
pow-pow2.6%
metadata-eval2.6%
pow1/22.6%
*-un-lft-identity2.6%
times-frac2.6%
metadata-eval2.6%
Applied egg-rr2.6%
expm1-log1p-u2.6%
expm1-undefine36.5%
associate-/r/36.5%
*-commutative36.5%
Applied egg-rr36.5%
sub-neg36.5%
metadata-eval36.5%
+-commutative36.5%
log1p-undefine36.5%
rem-exp-log36.5%
+-commutative36.5%
associate-*r/36.5%
associate-*l/36.5%
*-commutative36.5%
fma-define36.5%
Simplified36.5%
Final simplification64.2%
(FPCore (k n) :precision binary64 (/ 1.0 (/ (sqrt k) (pow (* 2.0 (* n PI)) (- 0.5 (* k 0.5))))))
double code(double k, double n) {
return 1.0 / (sqrt(k) / pow((2.0 * (n * ((double) M_PI))), (0.5 - (k * 0.5))));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) / Math.pow((2.0 * (n * Math.PI)), (0.5 - (k * 0.5))));
}
def code(k, n): return 1.0 / (math.sqrt(k) / math.pow((2.0 * (n * math.pi)), (0.5 - (k * 0.5))))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) / (Float64(2.0 * Float64(n * pi)) ^ Float64(0.5 - Float64(k * 0.5))))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) / ((2.0 * (n * pi)) ^ (0.5 - (k * 0.5)))); end
code[k_, n_] := N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Power[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\sqrt{k}}{{\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(0.5 - k \cdot 0.5\right)}}}
\end{array}
Initial program 99.3%
associate-/r/99.3%
*-commutative99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
associate-*r*99.3%
*-commutative99.3%
associate-*l*99.3%
div-inv99.3%
metadata-eval99.3%
Applied egg-rr99.3%
Final simplification99.3%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* n 2.0)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (n * 2.0)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (n * 2.0)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (n * 2.0)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(n * 2.0)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (n * 2.0)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.3%
associate-*l/99.3%
*-lft-identity99.3%
sqr-pow99.2%
pow-sqr99.3%
*-commutative99.3%
associate-*l*99.3%
associate-*r/99.3%
*-commutative99.3%
associate-/l*99.3%
metadata-eval99.3%
/-rgt-identity99.3%
div-sub99.3%
metadata-eval99.3%
Simplified99.3%
Final simplification99.3%
(FPCore (k n) :precision binary64 (* (sqrt (* n 2.0)) (sqrt (/ PI k))))
double code(double k, double n) {
return sqrt((n * 2.0)) * sqrt((((double) M_PI) / k));
}
public static double code(double k, double n) {
return Math.sqrt((n * 2.0)) * Math.sqrt((Math.PI / k));
}
def code(k, n): return math.sqrt((n * 2.0)) * math.sqrt((math.pi / k))
function code(k, n) return Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt((n * 2.0)) * sqrt((pi / k)); end
code[k_, n_] := N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot 2} \cdot \sqrt{\frac{\pi}{k}}
\end{array}
Initial program 99.3%
add-sqr-sqrt99.1%
pow299.1%
Applied egg-rr99.0%
Taylor expanded in k around 0 41.4%
associate-*r/41.4%
associate-*r*41.4%
*-commutative41.4%
associate-/l*41.4%
*-commutative41.4%
Simplified41.4%
pow-pow41.6%
div-inv41.6%
unpow-prod-down50.3%
metadata-eval50.3%
pow1/250.3%
clear-num50.3%
metadata-eval50.3%
Applied egg-rr50.3%
unpow1/250.3%
Simplified50.3%
Final simplification50.3%
(FPCore (k n) :precision binary64 (/ (sqrt (* n 2.0)) (sqrt (/ k PI))))
double code(double k, double n) {
return sqrt((n * 2.0)) / sqrt((k / ((double) M_PI)));
}
public static double code(double k, double n) {
return Math.sqrt((n * 2.0)) / Math.sqrt((k / Math.PI));
}
def code(k, n): return math.sqrt((n * 2.0)) / math.sqrt((k / math.pi))
function code(k, n) return Float64(sqrt(Float64(n * 2.0)) / sqrt(Float64(k / pi))) end
function tmp = code(k, n) tmp = sqrt((n * 2.0)) / sqrt((k / pi)); end
code[k_, n_] := N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / Pi), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n \cdot 2}}{\sqrt{\frac{k}{\pi}}}
\end{array}
Initial program 99.3%
add-sqr-sqrt99.1%
pow299.1%
Applied egg-rr99.0%
Taylor expanded in k around 0 41.4%
associate-*r/41.4%
associate-*r*41.4%
*-commutative41.4%
associate-/l*41.4%
*-commutative41.4%
Simplified41.4%
pow-pow41.6%
metadata-eval41.6%
pow1/241.6%
sqrt-div50.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(Float64(0.5 * 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[(N[(0.5 * N[(k / n), $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{0.5 \cdot \frac{k}{n}}{\pi}\right)}^{-0.5}
\end{array}
Initial program 99.3%
Taylor expanded in k around 0 50.2%
*-commutative50.2%
sqrt-unprod50.3%
*-commutative50.3%
*-commutative50.3%
associate-*r*50.3%
*-commutative50.3%
div-inv50.3%
clear-num50.3%
sqrt-undiv42.5%
associate-*r*42.5%
Applied egg-rr42.5%
inv-pow42.5%
sqrt-pow242.6%
associate-/r*42.6%
*-un-lft-identity42.6%
*-commutative42.6%
times-frac42.7%
metadata-eval42.7%
metadata-eval42.7%
Applied egg-rr42.7%
Final simplification42.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.3%
add-sqr-sqrt99.1%
pow299.1%
Applied egg-rr99.0%
Taylor expanded in k around 0 41.4%
associate-*r/41.4%
associate-*r*41.4%
*-commutative41.4%
associate-/l*41.4%
*-commutative41.4%
Simplified41.4%
pow-pow41.6%
metadata-eval41.6%
pow1/241.6%
*-un-lft-identity41.6%
times-frac41.6%
metadata-eval41.6%
Applied egg-rr41.6%
associate-/r/41.6%
Applied egg-rr41.6%
Final simplification41.6%
herbie shell --seed 2024034
(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))))