
(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 (* 2.0 (* PI n)))) (* (sqrt t_0) (* (pow t_0 (* k -0.5)) (pow k -0.5)))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
return sqrt(t_0) * (pow(t_0, (k * -0.5)) * pow(k, -0.5));
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
return Math.sqrt(t_0) * (Math.pow(t_0, (k * -0.5)) * Math.pow(k, -0.5));
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return math.sqrt(t_0) * (math.pow(t_0, (k * -0.5)) * math.pow(k, -0.5))
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(sqrt(t_0) * Float64((t_0 ^ Float64(k * -0.5)) * (k ^ -0.5))) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = sqrt(t_0) * ((t_0 ^ (k * -0.5)) * (k ^ -0.5)); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] * N[(N[Power[t$95$0, N[(k * -0.5), $MachinePrecision]], $MachinePrecision] * N[Power[k, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\sqrt{t_0} \cdot \left({t_0}^{\left(k \cdot -0.5\right)} \cdot {k}^{-0.5}\right)
\end{array}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-lft-identity99.4%
*-commutative99.4%
associate-*l*99.4%
div-sub99.4%
sub-neg99.4%
distribute-frac-neg99.4%
metadata-eval99.4%
neg-mul-199.4%
associate-/l*99.4%
associate-/r/99.4%
metadata-eval99.4%
Simplified99.4%
div-inv99.4%
unpow-prod-up99.6%
pow1/299.6%
associate-*l*99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
*-commutative99.6%
inv-pow99.6%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (let* ((t_0 (* 2.0 (* PI n)))) (/ (* (sqrt t_0) (pow t_0 (* k -0.5))) (sqrt k))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
return (sqrt(t_0) * pow(t_0, (k * -0.5))) / sqrt(k);
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
return (Math.sqrt(t_0) * Math.pow(t_0, (k * -0.5))) / Math.sqrt(k);
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return (math.sqrt(t_0) * math.pow(t_0, (k * -0.5))) / math.sqrt(k)
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(Float64(sqrt(t_0) * (t_0 ^ Float64(k * -0.5))) / sqrt(k)) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = (sqrt(t_0) * (t_0 ^ (k * -0.5))) / sqrt(k); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Power[t$95$0, N[(k * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\frac{\sqrt{t_0} \cdot {t_0}^{\left(k \cdot -0.5\right)}}{\sqrt{k}}
\end{array}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-lft-identity99.4%
*-commutative99.4%
associate-*l*99.4%
div-sub99.4%
sub-neg99.4%
distribute-frac-neg99.4%
metadata-eval99.4%
neg-mul-199.4%
associate-/l*99.4%
associate-/r/99.4%
metadata-eval99.4%
Simplified99.4%
+-commutative99.4%
unpow-prod-up99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
*-commutative99.6%
pow1/299.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (* (sqrt (/ 1.0 k)) (pow (* n (* 2.0 PI)) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return sqrt((1.0 / k)) * pow((n * (2.0 * ((double) M_PI))), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((1.0 / k)) * Math.pow((n * (2.0 * Math.PI)), ((1.0 - k) / 2.0));
}
def code(k, n): return math.sqrt((1.0 / k)) * math.pow((n * (2.0 * math.pi)), ((1.0 - k) / 2.0))
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * (Float64(n * Float64(2.0 * pi)) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)) * ((n * (2.0 * pi)) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $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(2 \cdot \pi\right)\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.4%
add-sqr-sqrt99.2%
sqrt-unprod99.4%
frac-times99.4%
metadata-eval99.4%
add-sqr-sqrt99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (pow (* n (* 2.0 PI)) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return pow(k, -0.5) * pow((n * (2.0 * ((double) M_PI))), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow((n * (2.0 * Math.PI)), ((1.0 - k) / 2.0));
}
def code(k, n): return math.pow(k, -0.5) * math.pow((n * (2.0 * math.pi)), ((1.0 - k) / 2.0))
function code(k, n) return Float64((k ^ -0.5) * (Float64(n * Float64(2.0 * pi)) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * ((n * (2.0 * pi)) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.4%
expm1-log1p-u49.6%
expm1-udef68.0%
pow1/268.0%
pow-flip68.0%
metadata-eval68.0%
Applied egg-rr72.1%
expm1-def49.6%
expm1-log1p53.1%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 3.5e-48) (* (pow k -0.5) (sqrt (* n (* 2.0 PI)))) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 3.5e-48) {
tmp = pow(k, -0.5) * sqrt((n * (2.0 * ((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 <= 3.5e-48) {
tmp = Math.pow(k, -0.5) * Math.sqrt((n * (2.0 * 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 <= 3.5e-48: tmp = math.pow(k, -0.5) * math.sqrt((n * (2.0 * 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 <= 3.5e-48) tmp = Float64((k ^ -0.5) * sqrt(Float64(n * Float64(2.0 * 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 <= 3.5e-48) tmp = (k ^ -0.5) * sqrt((n * (2.0 * pi))); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.5e-48], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(2.0 * 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 3.5 \cdot 10^{-48}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{n \cdot \left(2 \cdot \pi\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 3.49999999999999991e-48Initial program 99.3%
Taylor expanded in k around 0 99.3%
expm1-log1p-u92.2%
expm1-udef92.2%
pow1/292.2%
pow-flip92.2%
metadata-eval92.2%
Applied egg-rr92.2%
expm1-def92.2%
expm1-log1p99.3%
Simplified99.3%
sqrt-unprod99.4%
*-commutative99.4%
*-commutative99.4%
associate-*r*99.4%
Applied egg-rr99.4%
if 3.49999999999999991e-48 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
associate-*l/99.6%
*-un-lft-identity99.6%
frac-times99.6%
Applied egg-rr99.6%
Simplified99.6%
Final simplification99.5%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (+ 0.5 (* k -0.5))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), (0.5 + (k * -0.5))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), (0.5 + (k * -0.5))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), (0.5 + (k * -0.5))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(0.5 + Float64(k * -0.5))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ (0.5 + (k * -0.5))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(k * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(0.5 + k \cdot -0.5\right)}}{\sqrt{k}}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-lft-identity99.4%
*-commutative99.4%
associate-*l*99.4%
div-sub99.4%
sub-neg99.4%
distribute-frac-neg99.4%
metadata-eval99.4%
neg-mul-199.4%
associate-/l*99.4%
associate-/r/99.4%
metadata-eval99.4%
Simplified99.4%
Final simplification99.4%
(FPCore (k n) :precision binary64 (if (<= k 4.2e+148) (* (pow k -0.5) (sqrt (* n (* 2.0 PI)))) (pow (pow (/ n (/ (/ k 2.0) PI)) 3.0) 0.16666666666666666)))
double code(double k, double n) {
double tmp;
if (k <= 4.2e+148) {
tmp = pow(k, -0.5) * sqrt((n * (2.0 * ((double) M_PI))));
} else {
tmp = pow(pow((n / ((k / 2.0) / ((double) M_PI))), 3.0), 0.16666666666666666);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 4.2e+148) {
tmp = Math.pow(k, -0.5) * Math.sqrt((n * (2.0 * Math.PI)));
} else {
tmp = Math.pow(Math.pow((n / ((k / 2.0) / Math.PI)), 3.0), 0.16666666666666666);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 4.2e+148: tmp = math.pow(k, -0.5) * math.sqrt((n * (2.0 * math.pi))) else: tmp = math.pow(math.pow((n / ((k / 2.0) / math.pi)), 3.0), 0.16666666666666666) return tmp
function code(k, n) tmp = 0.0 if (k <= 4.2e+148) tmp = Float64((k ^ -0.5) * sqrt(Float64(n * Float64(2.0 * pi)))); else tmp = (Float64(n / Float64(Float64(k / 2.0) / pi)) ^ 3.0) ^ 0.16666666666666666; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 4.2e+148) tmp = (k ^ -0.5) * sqrt((n * (2.0 * pi))); else tmp = ((n / ((k / 2.0) / pi)) ^ 3.0) ^ 0.16666666666666666; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 4.2e+148], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(n / N[(N[(k / 2.0), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], 3.0], $MachinePrecision], 0.16666666666666666], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.2 \cdot 10^{+148}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{n \cdot \left(2 \cdot \pi\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left({\left(\frac{n}{\frac{\frac{k}{2}}{\pi}}\right)}^{3}\right)}^{0.16666666666666666}\\
\end{array}
\end{array}
if k < 4.19999999999999998e148Initial program 99.3%
Taylor expanded in k around 0 68.8%
expm1-log1p-u64.2%
expm1-udef75.1%
pow1/275.1%
pow-flip75.1%
metadata-eval75.1%
Applied egg-rr75.1%
expm1-def64.2%
expm1-log1p68.9%
Simplified68.9%
sqrt-unprod68.9%
*-commutative68.9%
*-commutative68.9%
associate-*r*68.9%
Applied egg-rr68.9%
if 4.19999999999999998e148 < k Initial program 100.0%
Taylor expanded in k around 0 2.7%
expm1-log1p-u2.7%
expm1-udef38.8%
*-commutative38.8%
sqrt-unprod38.8%
*-commutative38.8%
*-commutative38.8%
div-inv38.8%
sqrt-undiv38.8%
associate-*r*38.8%
Applied egg-rr38.8%
expm1-def2.6%
expm1-log1p2.6%
associate-*l*2.6%
associate-/l*2.6%
associate-/r/2.6%
*-commutative2.6%
Simplified2.6%
Taylor expanded in k around 0 2.6%
pow1/22.6%
*-commutative2.6%
associate-*l/2.6%
associate-*r/2.6%
*-commutative2.6%
associate-*r*2.6%
metadata-eval2.6%
pow-pow4.0%
sqr-pow4.0%
pow-prod-down13.4%
pow-prod-up13.4%
clear-num13.4%
un-div-inv13.4%
div-inv13.4%
metadata-eval13.4%
metadata-eval13.4%
metadata-eval13.4%
Applied egg-rr13.4%
*-commutative13.4%
associate-/l/13.4%
metadata-eval13.4%
associate-/l*13.4%
/-rgt-identity13.4%
associate-/r/13.4%
associate-/l*13.4%
associate-/l/13.4%
associate-/r*13.4%
Simplified13.4%
Final simplification55.7%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (sqrt (* n (* 2.0 PI)))))
double code(double k, double n) {
return pow(k, -0.5) * sqrt((n * (2.0 * ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.sqrt((n * (2.0 * Math.PI)));
}
def code(k, n): return math.pow(k, -0.5) * math.sqrt((n * (2.0 * math.pi)))
function code(k, n) return Float64((k ^ -0.5) * sqrt(Float64(n * Float64(2.0 * pi)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * sqrt((n * (2.0 * pi))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot \sqrt{n \cdot \left(2 \cdot \pi\right)}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 53.1%
expm1-log1p-u49.6%
expm1-udef68.0%
pow1/268.0%
pow-flip68.0%
metadata-eval68.0%
Applied egg-rr68.0%
expm1-def49.6%
expm1-log1p53.1%
Simplified53.1%
sqrt-unprod53.1%
*-commutative53.1%
*-commutative53.1%
associate-*r*53.1%
Applied egg-rr53.1%
Final simplification53.1%
(FPCore (k n) :precision binary64 (* (sqrt (/ 2.0 k)) (sqrt (* PI n))))
double code(double k, double n) {
return sqrt((2.0 / k)) * sqrt((((double) M_PI) * n));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 / k)) * Math.sqrt((Math.PI * n));
}
def code(k, n): return math.sqrt((2.0 / k)) * math.sqrt((math.pi * n))
function code(k, n) return Float64(sqrt(Float64(2.0 / k)) * sqrt(Float64(pi * n))) end
function tmp = code(k, n) tmp = sqrt((2.0 / k)) * sqrt((pi * n)); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{2}{k}} \cdot \sqrt{\pi \cdot n}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 53.1%
expm1-log1p-u49.8%
expm1-udef50.8%
*-commutative50.8%
sqrt-unprod50.8%
*-commutative50.8%
*-commutative50.8%
div-inv50.8%
sqrt-undiv37.4%
associate-*r*37.4%
Applied egg-rr37.4%
expm1-def36.4%
expm1-log1p38.2%
associate-*l*38.2%
associate-/l*38.1%
associate-/r/38.2%
*-commutative38.2%
Simplified38.2%
sqrt-prod53.1%
*-commutative53.1%
Applied egg-rr53.1%
Final simplification53.1%
(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.4%
Taylor expanded in k around 0 53.1%
expm1-log1p-u49.8%
expm1-udef50.8%
*-commutative50.8%
sqrt-unprod50.8%
*-commutative50.8%
*-commutative50.8%
div-inv50.8%
sqrt-undiv37.4%
associate-*r*37.4%
Applied egg-rr37.4%
expm1-def36.4%
expm1-log1p38.2%
associate-*l*38.2%
associate-/l*38.1%
associate-/r/38.2%
*-commutative38.2%
Simplified38.2%
Taylor expanded in k around 0 38.2%
associate-*l/38.2%
Applied egg-rr38.2%
Final simplification38.2%
(FPCore (k n) :precision binary64 (sqrt (* PI (* n (/ 2.0 k)))))
double code(double k, double n) {
return sqrt((((double) M_PI) * (n * (2.0 / k))));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (n * (2.0 / k))));
}
def code(k, n): return math.sqrt((math.pi * (n * (2.0 / k))))
function code(k, n) return sqrt(Float64(pi * Float64(n * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt((pi * (n * (2.0 / k)))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(n * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \left(n \cdot \frac{2}{k}\right)}
\end{array}
Initial program 99.4%
add-cube-cbrt98.7%
pow398.8%
associate-*l/98.8%
*-un-lft-identity98.8%
associate-*l*98.8%
div-sub98.8%
metadata-eval98.8%
div-inv98.8%
metadata-eval98.8%
Applied egg-rr98.8%
Taylor expanded in k around 0 38.1%
*-commutative38.1%
associate-/l*38.1%
Simplified38.1%
sqrt-unprod38.2%
associate-/l*38.2%
associate-*r/38.2%
associate-*l/38.2%
*-commutative38.2%
*-commutative38.2%
associate-*l*38.2%
Applied egg-rr38.2%
Final simplification38.2%
herbie shell --seed 2023339
(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))))