
(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 13 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 (if (<= k 2.85e-78) (* (/ 1.0 (sqrt (* k (/ 0.5 PI)))) (sqrt n)) (sqrt (/ (pow (* PI (* n 2.0)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 2.85e-78) {
tmp = (1.0 / sqrt((k * (0.5 / ((double) M_PI))))) * sqrt(n);
} else {
tmp = sqrt((pow((((double) M_PI) * (n * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 2.85e-78) {
tmp = (1.0 / Math.sqrt((k * (0.5 / Math.PI)))) * Math.sqrt(n);
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (n * 2.0)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 2.85e-78: tmp = (1.0 / math.sqrt((k * (0.5 / math.pi)))) * math.sqrt(n) else: tmp = math.sqrt((math.pow((math.pi * (n * 2.0)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 2.85e-78) tmp = Float64(Float64(1.0 / sqrt(Float64(k * Float64(0.5 / pi)))) * sqrt(n)); else tmp = sqrt(Float64((Float64(pi * Float64(n * 2.0)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 2.85e-78) tmp = (1.0 / sqrt((k * (0.5 / pi)))) * sqrt(n); else tmp = sqrt((((pi * (n * 2.0)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 2.85e-78], N[(N[(1.0 / N[Sqrt[N[(k * N[(0.5 / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.85 \cdot 10^{-78}:\\
\;\;\;\;\frac{1}{\sqrt{k \cdot \frac{0.5}{\pi}}} \cdot \sqrt{n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.8499999999999999e-78Initial program 98.4%
Taylor expanded in k around 0 63.7%
*-commutative63.7%
associate-/l*63.8%
Simplified63.8%
pow163.8%
sqrt-unprod63.9%
associate-*r*63.9%
*-commutative63.9%
Applied egg-rr63.9%
unpow163.9%
associate-*l*63.9%
metadata-eval63.9%
times-frac63.9%
*-commutative63.9%
times-frac63.8%
/-rgt-identity63.8%
Simplified63.8%
*-commutative63.8%
sqrt-prod98.5%
clear-num98.5%
un-div-inv98.4%
div-inv98.4%
metadata-eval98.4%
Applied egg-rr98.4%
clear-num98.4%
sqrt-div99.3%
metadata-eval99.3%
associate-/l*99.3%
Applied egg-rr99.3%
if 2.8499999999999999e-78 < k Initial program 99.5%
add-sqr-sqrt99.5%
sqrt-unprod99.5%
*-commutative99.5%
associate-*r*99.5%
div-sub99.5%
metadata-eval99.5%
div-inv99.5%
*-commutative99.5%
Applied egg-rr99.5%
Simplified99.6%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* n 2.0)))) (* (/ 1.0 (sqrt k)) (* (sqrt t_0) (pow t_0 (* k -0.5))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (n * 2.0);
return (1.0 / sqrt(k)) * (sqrt(t_0) * pow(t_0, (k * -0.5)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (n * 2.0);
return (1.0 / Math.sqrt(k)) * (Math.sqrt(t_0) * Math.pow(t_0, (k * -0.5)));
}
def code(k, n): t_0 = math.pi * (n * 2.0) return (1.0 / math.sqrt(k)) * (math.sqrt(t_0) * math.pow(t_0, (k * -0.5)))
function code(k, n) t_0 = Float64(pi * Float64(n * 2.0)) return Float64(Float64(1.0 / sqrt(k)) * Float64(sqrt(t_0) * (t_0 ^ Float64(k * -0.5)))) end
function tmp = code(k, n) t_0 = pi * (n * 2.0); tmp = (1.0 / sqrt(k)) * (sqrt(t_0) * (t_0 ^ (k * -0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Power[t$95$0, N[(k * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(n \cdot 2\right)\\
\frac{1}{\sqrt{k}} \cdot \left(\sqrt{t\_0} \cdot {t\_0}^{\left(k \cdot -0.5\right)}\right)
\end{array}
\end{array}
Initial program 99.1%
associate-*r*99.1%
div-sub99.1%
metadata-eval99.1%
sub-neg99.1%
unpow-prod-up99.3%
pow1/299.3%
div-inv99.3%
metadata-eval99.3%
distribute-rgt-neg-in99.3%
metadata-eval99.3%
Applied egg-rr99.3%
*-commutative99.3%
associate-*l*99.3%
*-commutative99.3%
associate-*l*99.3%
Simplified99.3%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* n 2.0)))) (/ (sqrt t_0) (* (sqrt k) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (n * 2.0);
return sqrt(t_0) / (sqrt(k) * pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (n * 2.0);
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = math.pi * (n * 2.0) return math.sqrt(t_0) / (math.sqrt(k) * math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(pi * Float64(n * 2.0)) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = pi * (n * 2.0); tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(n * 2.0), $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 := \pi \cdot \left(n \cdot 2\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k} \cdot {t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.1%
associate-*l/99.1%
*-un-lft-identity99.1%
associate-*r*99.1%
div-sub99.1%
metadata-eval99.1%
pow-div99.3%
pow1/299.3%
associate-/l/99.3%
div-inv99.3%
metadata-eval99.3%
Applied egg-rr99.3%
*-commutative99.3%
associate-*l*99.3%
*-commutative99.3%
*-commutative99.3%
associate-*l*99.3%
*-commutative99.3%
Simplified99.3%
Final simplification99.3%
(FPCore (k n) :precision binary64 (if (<= k 2.75e+72) (* (/ 1.0 (sqrt (* k (/ 0.5 PI)))) (sqrt n)) (sqrt (* 2.0 (+ -1.0 (fma PI (/ n k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 2.75e+72) {
tmp = (1.0 / sqrt((k * (0.5 / ((double) M_PI))))) * sqrt(n);
} else {
tmp = sqrt((2.0 * (-1.0 + fma(((double) M_PI), (n / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 2.75e+72) tmp = Float64(Float64(1.0 / sqrt(Float64(k * Float64(0.5 / pi)))) * sqrt(n)); else tmp = sqrt(Float64(2.0 * Float64(-1.0 + fma(pi, Float64(n / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 2.75e+72], N[(N[(1.0 / N[Sqrt[N[(k * N[(0.5 / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(-1.0 + N[(Pi * N[(n / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2.75 \cdot 10^{+72}:\\
\;\;\;\;\frac{1}{\sqrt{k \cdot \frac{0.5}{\pi}}} \cdot \sqrt{n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(\pi, \frac{n}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 2.75e72Initial program 98.5%
Taylor expanded in k around 0 56.8%
*-commutative56.8%
associate-/l*56.9%
Simplified56.9%
pow156.9%
sqrt-unprod57.0%
associate-*r*57.0%
*-commutative57.0%
Applied egg-rr57.0%
unpow157.0%
associate-*l*57.0%
metadata-eval57.0%
times-frac57.0%
*-commutative57.0%
times-frac56.9%
/-rgt-identity56.9%
Simplified56.9%
*-commutative56.9%
sqrt-prod77.9%
clear-num77.9%
un-div-inv77.8%
div-inv77.8%
metadata-eval77.8%
Applied egg-rr77.8%
clear-num77.8%
sqrt-div78.4%
metadata-eval78.4%
associate-/l*78.4%
Applied egg-rr78.4%
if 2.75e72 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
associate-*r*2.7%
*-commutative2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*l*2.7%
metadata-eval2.7%
times-frac2.7%
*-commutative2.7%
times-frac2.7%
/-rgt-identity2.7%
Simplified2.7%
Taylor expanded in n around 0 2.7%
associate-*r/2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine32.6%
*-commutative32.6%
associate-*l/32.6%
Applied egg-rr32.6%
sub-neg32.6%
metadata-eval32.6%
+-commutative32.6%
log1p-undefine32.6%
rem-exp-log32.6%
+-commutative32.6%
associate-/l*32.6%
fma-define32.6%
Simplified32.6%
(FPCore (k n) :precision binary64 (if (<= k 3.35e+72) (* (sqrt (/ PI k)) (sqrt (* n 2.0))) (sqrt (* 2.0 (+ -1.0 (fma PI (/ n k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 3.35e+72) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
} else {
tmp = sqrt((2.0 * (-1.0 + fma(((double) M_PI), (n / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 3.35e+72) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))); else tmp = sqrt(Float64(2.0 * Float64(-1.0 + fma(pi, Float64(n / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 3.35e+72], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(-1.0 + N[(Pi * N[(n / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.35 \cdot 10^{+72}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(\pi, \frac{n}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 3.3499999999999999e72Initial program 98.5%
Taylor expanded in k around 0 56.8%
*-commutative56.8%
associate-/l*56.9%
Simplified56.9%
pow156.9%
sqrt-unprod57.0%
associate-*r*57.0%
*-commutative57.0%
Applied egg-rr57.0%
unpow157.0%
associate-*l*57.0%
metadata-eval57.0%
times-frac57.0%
*-commutative57.0%
times-frac56.9%
/-rgt-identity56.9%
Simplified56.9%
Taylor expanded in n around 0 57.0%
associate-*r/57.0%
Simplified57.0%
associate-*r*57.0%
*-commutative57.0%
sqrt-prod77.9%
Applied egg-rr77.9%
*-commutative77.9%
Simplified77.9%
if 3.3499999999999999e72 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
*-commutative2.7%
associate-/l*2.7%
Simplified2.7%
pow12.7%
sqrt-unprod2.7%
associate-*r*2.7%
*-commutative2.7%
Applied egg-rr2.7%
unpow12.7%
associate-*l*2.7%
metadata-eval2.7%
times-frac2.7%
*-commutative2.7%
times-frac2.7%
/-rgt-identity2.7%
Simplified2.7%
Taylor expanded in n around 0 2.7%
associate-*r/2.7%
Simplified2.7%
expm1-log1p-u2.7%
expm1-undefine32.6%
*-commutative32.6%
associate-*l/32.6%
Applied egg-rr32.6%
sub-neg32.6%
metadata-eval32.6%
+-commutative32.6%
log1p-undefine32.6%
rem-exp-log32.6%
+-commutative32.6%
associate-/l*32.6%
fma-define32.6%
Simplified32.6%
(FPCore (k n) :precision binary64 (/ 1.0 (/ (sqrt k) (pow (* 2.0 (* PI n)) (- 0.5 (* k 0.5))))))
double code(double k, double n) {
return 1.0 / (sqrt(k) / pow((2.0 * (((double) M_PI) * n)), (0.5 - (k * 0.5))));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) / Math.pow((2.0 * (Math.PI * n)), (0.5 - (k * 0.5))));
}
def code(k, n): return 1.0 / (math.sqrt(k) / math.pow((2.0 * (math.pi * n)), (0.5 - (k * 0.5))))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) / (Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(k * 0.5))))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) / ((2.0 * (pi * n)) ^ (0.5 - (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[(0.5 - N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\sqrt{k}}{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 - k \cdot 0.5\right)}}}
\end{array}
Initial program 99.1%
associate-/r/99.1%
associate-*r*99.1%
div-sub99.1%
metadata-eval99.1%
div-inv99.1%
metadata-eval99.1%
Applied egg-rr99.1%
(FPCore (k n) :precision binary64 (* (sqrt (/ 1.0 k)) (pow (* n (* PI 2.0)) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return sqrt((1.0 / k)) * pow((n * (((double) M_PI) * 2.0)), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((1.0 / k)) * Math.pow((n * (Math.PI * 2.0)), ((1.0 - k) / 2.0));
}
def code(k, n): return math.sqrt((1.0 / k)) * math.pow((n * (math.pi * 2.0)), ((1.0 - k) / 2.0))
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * (Float64(n * Float64(pi * 2.0)) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)) * ((n * (pi * 2.0)) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{k}} \cdot {\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 99.1%
Final simplification99.1%
(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.1%
associate-*l/99.1%
*-lft-identity99.1%
associate-*l*99.1%
div-sub99.1%
metadata-eval99.1%
Simplified99.1%
(FPCore (k n) :precision binary64 (* (sqrt (/ PI k)) (sqrt (* n 2.0))))
double code(double k, double n) {
return sqrt((((double) M_PI) / k)) * sqrt((n * 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / k)) * Math.sqrt((n * 2.0));
}
def code(k, n): return math.sqrt((math.pi / k)) * math.sqrt((n * 2.0))
function code(k, n) return Float64(sqrt(Float64(pi / k)) * sqrt(Float64(n * 2.0))) end
function tmp = code(k, n) tmp = sqrt((pi / k)) * sqrt((n * 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k}} \cdot \sqrt{n \cdot 2}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 36.5%
*-commutative36.5%
associate-/l*36.5%
Simplified36.5%
pow136.5%
sqrt-unprod36.7%
associate-*r*36.7%
*-commutative36.7%
Applied egg-rr36.7%
unpow136.7%
associate-*l*36.7%
metadata-eval36.7%
times-frac36.7%
*-commutative36.7%
times-frac36.6%
/-rgt-identity36.6%
Simplified36.6%
Taylor expanded in n around 0 36.6%
associate-*r/36.7%
Simplified36.7%
associate-*r*36.7%
*-commutative36.7%
sqrt-prod49.7%
Applied egg-rr49.7%
*-commutative49.7%
Simplified49.7%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((((double) M_PI) * (2.0 / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((Math.PI * (2.0 / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((math.pi * (2.0 / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((pi * (2.0 / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\pi \cdot \frac{2}{k}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 36.5%
*-commutative36.5%
associate-/l*36.5%
Simplified36.5%
pow136.5%
sqrt-unprod36.7%
associate-*r*36.7%
*-commutative36.7%
Applied egg-rr36.7%
unpow136.7%
associate-*l*36.7%
metadata-eval36.7%
times-frac36.7%
*-commutative36.7%
times-frac36.6%
/-rgt-identity36.6%
Simplified36.6%
*-commutative36.6%
sqrt-prod49.7%
clear-num49.7%
un-div-inv49.7%
div-inv49.7%
metadata-eval49.7%
Applied egg-rr49.7%
clear-num49.7%
associate-/r/49.7%
*-commutative49.7%
associate-/r*49.7%
metadata-eval49.7%
Applied egg-rr49.7%
Final simplification49.7%
(FPCore (k n) :precision binary64 (* (sqrt (* PI n)) (sqrt (/ 2.0 k))))
double code(double k, double n) {
return sqrt((((double) M_PI) * n)) * sqrt((2.0 / k));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * n)) * Math.sqrt((2.0 / k));
}
def code(k, n): return math.sqrt((math.pi * n)) * math.sqrt((2.0 / k))
function code(k, n) return Float64(sqrt(Float64(pi * n)) * sqrt(Float64(2.0 / k))) end
function tmp = code(k, n) tmp = sqrt((pi * n)) * sqrt((2.0 / k)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot n} \cdot \sqrt{\frac{2}{k}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 36.5%
*-commutative36.5%
associate-/l*36.5%
Simplified36.5%
pow136.5%
sqrt-unprod36.7%
associate-*r*36.7%
*-commutative36.7%
Applied egg-rr36.7%
unpow136.7%
associate-*l*36.7%
metadata-eval36.7%
times-frac36.7%
*-commutative36.7%
times-frac36.6%
/-rgt-identity36.6%
Simplified36.6%
associate-*r*36.6%
*-commutative36.6%
sqrt-prod49.3%
*-commutative49.3%
Applied egg-rr49.3%
Final simplification49.3%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ k (* PI (* n 2.0))))))
double code(double k, double n) {
return 1.0 / sqrt((k / (((double) M_PI) * (n * 2.0))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((k / (Math.PI * (n * 2.0))));
}
def code(k, n): return 1.0 / math.sqrt((k / (math.pi * (n * 2.0))))
function code(k, n) return Float64(1.0 / sqrt(Float64(k / Float64(pi * Float64(n * 2.0))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((k / (pi * (n * 2.0)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(k / N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{k}{\pi \cdot \left(n \cdot 2\right)}}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0 36.5%
*-commutative36.5%
associate-/l*36.5%
Simplified36.5%
pow136.5%
sqrt-unprod36.7%
associate-*r*36.7%
*-commutative36.7%
Applied egg-rr36.7%
unpow136.7%
associate-*l*36.7%
metadata-eval36.7%
times-frac36.7%
*-commutative36.7%
times-frac36.6%
/-rgt-identity36.6%
Simplified36.6%
Taylor expanded in n around 0 36.6%
associate-*r/36.7%
Simplified36.7%
*-commutative36.7%
associate-*r/36.6%
associate-*l/36.6%
associate-*r*36.6%
sqrt-undiv49.7%
clear-num49.7%
sqrt-undiv36.7%
*-commutative36.7%
associate-*r*36.7%
*-commutative36.7%
Applied egg-rr36.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.1%
Taylor expanded in k around 0 36.5%
*-commutative36.5%
associate-/l*36.5%
Simplified36.5%
pow136.5%
sqrt-unprod36.7%
associate-*r*36.7%
*-commutative36.7%
Applied egg-rr36.7%
unpow136.7%
associate-*l*36.7%
metadata-eval36.7%
times-frac36.7%
*-commutative36.7%
times-frac36.6%
/-rgt-identity36.6%
Simplified36.6%
Taylor expanded in n around 0 36.6%
associate-*r/36.7%
Simplified36.7%
herbie shell --seed 2024090
(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))))