
(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 16 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)))) (/ (* (pow k -0.5) (sqrt t_0)) (pow t_0 (* k 0.5)))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
return (pow(k, -0.5) * sqrt(t_0)) / pow(t_0, (k * 0.5));
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
return (Math.pow(k, -0.5) * Math.sqrt(t_0)) / Math.pow(t_0, (k * 0.5));
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return (math.pow(k, -0.5) * math.sqrt(t_0)) / math.pow(t_0, (k * 0.5))
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(Float64((k ^ -0.5) * sqrt(t_0)) / (t_0 ^ Float64(k * 0.5))) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = ((k ^ -0.5) * sqrt(t_0)) / (t_0 ^ (k * 0.5)); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\frac{{k}^{-0.5} \cdot \sqrt{t\_0}}{{t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.4%
associate-*r*99.4%
div-sub99.4%
metadata-eval99.4%
pow-div99.6%
pow1/299.6%
associate-*r/99.6%
pow1/299.6%
pow-flip99.7%
metadata-eval99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* 2.0 n)))) (* (pow k -0.5) (/ (sqrt t_0) (pow t_0 (* k 0.5))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return pow(k, -0.5) * (sqrt(t_0) / pow(t_0, (k * 0.5)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.pow(k, -0.5) * (Math.sqrt(t_0) / Math.pow(t_0, (k * 0.5)));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.pow(k, -0.5) * (math.sqrt(t_0) / math.pow(t_0, (k * 0.5)))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64((k ^ -0.5) * Float64(sqrt(t_0) / (t_0 ^ Float64(k * 0.5)))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = (k ^ -0.5) * (sqrt(t_0) / (t_0 ^ (k * 0.5))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Power[k, -0.5], $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(2 \cdot n\right)\\
{k}^{-0.5} \cdot \frac{\sqrt{t\_0}}{{t\_0}^{\left(k \cdot 0.5\right)}}
\end{array}
\end{array}
Initial program 99.4%
associate-*r*99.4%
div-sub99.4%
metadata-eval99.4%
pow-div99.6%
pow1/299.6%
associate-*r/99.6%
pow1/299.6%
pow-flip99.7%
metadata-eval99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
associate-/l*99.7%
*-rgt-identity99.7%
associate-*l*99.7%
*-lft-identity99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*l*99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*l*99.7%
Simplified99.7%
(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{\frac{\sqrt{t\_0}}{{t\_0}^{\left(k \cdot 0.5\right)}}}{\sqrt{k}}
\end{array}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-un-lft-identity99.4%
associate-*r*99.4%
div-sub99.4%
metadata-eval99.4%
pow-div99.7%
pow1/299.7%
associate-/l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
*-rgt-identity99.7%
*-commutative99.7%
times-frac99.6%
associate-*l/99.7%
*-lft-identity99.7%
*-commutative99.7%
*-commutative99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* 2.0 n)))) (/ (sqrt t_0) (* (pow t_0 (* k 0.5)) (sqrt k)))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return sqrt(t_0) / (pow(t_0, (k * 0.5)) * sqrt(k));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.sqrt(t_0) / (Math.pow(t_0, (k * 0.5)) * Math.sqrt(k));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / (math.pow(t_0, (k * 0.5)) * math.sqrt(k))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / Float64((t_0 ^ Float64(k * 0.5)) * sqrt(k))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / ((t_0 ^ (k * 0.5)) * sqrt(k)); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[(N[Power[t$95$0, N[(k * 0.5), $MachinePrecision]], $MachinePrecision] * N[Sqrt[k], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\frac{\sqrt{t\_0}}{{t\_0}^{\left(k \cdot 0.5\right)} \cdot \sqrt{k}}
\end{array}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-un-lft-identity99.4%
associate-*r*99.4%
div-sub99.4%
metadata-eval99.4%
pow-div99.7%
pow1/299.7%
associate-/l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
associate-/l/99.7%
unpow1/299.7%
metadata-eval99.7%
pow-sqr99.5%
fabs-sqr99.5%
pow-sqr99.7%
metadata-eval99.7%
unpow1/299.7%
fabs-neg99.7%
neg-mul-199.7%
rem-square-sqrt0.0%
unpow1/20.0%
metadata-eval0.0%
pow-sqr0.0%
unswap-sqr0.0%
fabs-sqr0.0%
unswap-sqr0.0%
rem-square-sqrt26.8%
pow-sqr26.8%
metadata-eval26.8%
unpow1/226.8%
neg-mul-126.8%
Simplified99.7%
Final simplification99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* 2.0 (* PI n))))
(if (<= k 2.5e-46)
(* (pow k -0.5) (sqrt t_0))
(sqrt (/ (pow t_0 (- 1.0 k)) k)))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
double tmp;
if (k <= 2.5e-46) {
tmp = pow(k, -0.5) * sqrt(t_0);
} else {
tmp = sqrt((pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
double tmp;
if (k <= 2.5e-46) {
tmp = Math.pow(k, -0.5) * Math.sqrt(t_0);
} else {
tmp = Math.sqrt((Math.pow(t_0, (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): t_0 = 2.0 * (math.pi * n) tmp = 0 if k <= 2.5e-46: tmp = math.pow(k, -0.5) * math.sqrt(t_0) else: tmp = math.sqrt((math.pow(t_0, (1.0 - k)) / k)) return tmp
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) tmp = 0.0 if (k <= 2.5e-46) tmp = Float64((k ^ -0.5) * sqrt(t_0)); else tmp = sqrt(Float64((t_0 ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 * (pi * n); tmp = 0.0; if (k <= 2.5e-46) tmp = (k ^ -0.5) * sqrt(t_0); else tmp = sqrt(((t_0 ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 2.5e-46], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[t$95$0, N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 2 \cdot \left(\pi \cdot n\right)\\
\mathbf{if}\;k \leq 2.5 \cdot 10^{-46}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{t\_0}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 2.49999999999999996e-46Initial program 99.3%
associate-/r/99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
sub-neg99.3%
div-inv99.3%
metadata-eval99.3%
distribute-rgt-neg-in99.3%
metadata-eval99.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 75.2%
associate-*r/75.3%
*-rgt-identity75.3%
*-commutative75.3%
associate-/r*75.3%
Simplified75.3%
associate-/l/75.3%
un-div-inv75.2%
*-commutative75.2%
sqrt-div99.0%
frac-times99.2%
*-un-lft-identity99.2%
sqrt-prod99.3%
associate-*r*99.3%
*-commutative99.3%
clear-num99.4%
sqrt-div71.4%
*-commutative71.4%
associate-*r*71.4%
un-div-inv71.4%
*-commutative71.4%
associate-*r*71.4%
*-commutative71.4%
Applied egg-rr99.5%
if 2.49999999999999996e-46 < k Initial program 99.4%
Applied egg-rr99.4%
*-commutative99.4%
distribute-lft-in99.4%
metadata-eval99.4%
*-commutative99.4%
associate-*r*99.4%
metadata-eval99.4%
neg-mul-199.4%
sub-neg99.4%
Simplified99.4%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 1.05e-43) (* (pow k -0.5) (sqrt (* 2.0 (* PI n)))) (sqrt (* n (+ -1.0 (fma PI (/ 2.0 k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 1.05e-43) {
tmp = pow(k, -0.5) * sqrt((2.0 * (((double) M_PI) * n)));
} else {
tmp = sqrt((n * (-1.0 + fma(((double) M_PI), (2.0 / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 1.05e-43) tmp = Float64((k ^ -0.5) * sqrt(Float64(2.0 * Float64(pi * n)))); else tmp = sqrt(Float64(n * Float64(-1.0 + fma(pi, Float64(2.0 / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 1.05e-43], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(n * N[(-1.0 + N[(Pi * N[(2.0 / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.05 \cdot 10^{-43}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{2 \cdot \left(\pi \cdot n\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(-1 + \mathsf{fma}\left(\pi, \frac{2}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 1.05e-43Initial program 99.3%
associate-/r/99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
sub-neg99.3%
div-inv99.3%
metadata-eval99.3%
distribute-rgt-neg-in99.3%
metadata-eval99.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 75.7%
associate-*r/75.8%
*-rgt-identity75.8%
*-commutative75.8%
associate-/r*75.8%
Simplified75.8%
associate-/l/75.8%
un-div-inv75.7%
*-commutative75.7%
sqrt-div99.1%
frac-times99.2%
*-un-lft-identity99.2%
sqrt-prod99.3%
associate-*r*99.3%
*-commutative99.3%
clear-num99.4%
sqrt-div71.9%
*-commutative71.9%
associate-*r*71.9%
un-div-inv71.9%
*-commutative71.9%
associate-*r*71.9%
*-commutative71.9%
Applied egg-rr99.5%
if 1.05e-43 < k Initial program 99.4%
Taylor expanded in k around 0 13.0%
*-commutative13.0%
associate-/l*13.0%
Simplified13.0%
pow113.0%
sqrt-unprod13.1%
Applied egg-rr13.1%
unpow113.1%
*-commutative13.1%
associate-*l*13.1%
Simplified13.1%
expm1-log1p-u12.9%
expm1-undefine52.2%
*-commutative52.2%
Applied egg-rr52.2%
sub-neg52.2%
metadata-eval52.2%
+-commutative52.2%
log1p-undefine52.2%
rem-exp-log52.4%
+-commutative52.4%
associate-*r/52.4%
*-commutative52.4%
associate-/l*52.4%
fma-define52.4%
Simplified52.4%
(FPCore (k n) :precision binary64 (if (<= k 8e+240) (* (pow k -0.5) (sqrt (* 2.0 (* PI n)))) (cbrt (pow (* 2.0 (* n (/ PI k))) 1.5))))
double code(double k, double n) {
double tmp;
if (k <= 8e+240) {
tmp = pow(k, -0.5) * sqrt((2.0 * (((double) M_PI) * n)));
} else {
tmp = cbrt(pow((2.0 * (n * (((double) M_PI) / k))), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 8e+240) {
tmp = Math.pow(k, -0.5) * Math.sqrt((2.0 * (Math.PI * n)));
} else {
tmp = Math.cbrt(Math.pow((2.0 * (n * (Math.PI / k))), 1.5));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 8e+240) tmp = Float64((k ^ -0.5) * sqrt(Float64(2.0 * Float64(pi * n)))); else tmp = cbrt((Float64(2.0 * Float64(n * Float64(pi / k))) ^ 1.5)); end return tmp end
code[k_, n_] := If[LessEqual[k, 8e+240], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(2.0 * N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 8 \cdot 10^{+240}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{2 \cdot \left(\pi \cdot n\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(2 \cdot \left(n \cdot \frac{\pi}{k}\right)\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 8.00000000000000011e240Initial program 99.3%
associate-/r/99.3%
associate-*r*99.3%
div-sub99.3%
metadata-eval99.3%
sub-neg99.3%
div-inv99.3%
metadata-eval99.3%
distribute-rgt-neg-in99.3%
metadata-eval99.3%
Applied egg-rr99.3%
Taylor expanded in k around 0 45.3%
associate-*r/45.4%
*-rgt-identity45.4%
*-commutative45.4%
associate-/r*45.4%
Simplified45.4%
associate-/l/45.4%
un-div-inv45.3%
*-commutative45.3%
sqrt-div56.8%
frac-times56.9%
*-un-lft-identity56.9%
sqrt-prod57.0%
associate-*r*57.0%
*-commutative57.0%
clear-num57.0%
sqrt-div43.5%
*-commutative43.5%
associate-*r*43.5%
un-div-inv43.5%
*-commutative43.5%
associate-*r*43.5%
*-commutative43.5%
Applied egg-rr57.1%
if 8.00000000000000011e240 < k Initial program 100.0%
Taylor expanded in k around 0 2.9%
*-commutative2.9%
associate-/l*2.9%
Simplified2.9%
pow12.9%
sqrt-unprod2.9%
Applied egg-rr2.9%
unpow12.9%
*-commutative2.9%
associate-*l*2.9%
Simplified2.9%
add-cbrt-cube16.9%
pow1/316.9%
Applied egg-rr16.9%
unpow1/316.9%
*-commutative16.9%
*-commutative16.9%
associate-/l*16.9%
Simplified16.9%
(FPCore (k n) :precision binary64 (if (<= k 5e+241) (* (sqrt (/ 2.0 k)) (sqrt (* PI n))) (cbrt (pow (* 2.0 (* n (/ PI k))) 1.5))))
double code(double k, double n) {
double tmp;
if (k <= 5e+241) {
tmp = sqrt((2.0 / k)) * sqrt((((double) M_PI) * n));
} else {
tmp = cbrt(pow((2.0 * (n * (((double) M_PI) / k))), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 5e+241) {
tmp = Math.sqrt((2.0 / k)) * Math.sqrt((Math.PI * n));
} else {
tmp = Math.cbrt(Math.pow((2.0 * (n * (Math.PI / k))), 1.5));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 5e+241) tmp = Float64(sqrt(Float64(2.0 / k)) * sqrt(Float64(pi * n))); else tmp = cbrt((Float64(2.0 * Float64(n * Float64(pi / k))) ^ 1.5)); end return tmp end
code[k_, n_] := If[LessEqual[k, 5e+241], N[(N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(2.0 * N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 5 \cdot 10^{+241}:\\
\;\;\;\;\sqrt{\frac{2}{k}} \cdot \sqrt{\pi \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(2 \cdot \left(n \cdot \frac{\pi}{k}\right)\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 5.00000000000000025e241Initial program 99.3%
Taylor expanded in k around 0 43.4%
*-commutative43.4%
associate-/l*43.4%
Simplified43.4%
pow143.4%
sqrt-unprod43.5%
Applied egg-rr43.5%
unpow143.5%
*-commutative43.5%
associate-*l*43.5%
Simplified43.5%
Taylor expanded in k around 0 43.5%
associate-*r/43.5%
*-commutative43.5%
associate-/l*43.5%
Simplified43.5%
associate-*r*43.5%
*-commutative43.5%
sqrt-prod57.0%
Applied egg-rr57.0%
*-commutative57.0%
*-commutative57.0%
Simplified57.0%
if 5.00000000000000025e241 < k Initial program 100.0%
Taylor expanded in k around 0 2.9%
*-commutative2.9%
associate-/l*2.9%
Simplified2.9%
pow12.9%
sqrt-unprod2.9%
Applied egg-rr2.9%
unpow12.9%
*-commutative2.9%
associate-*l*2.9%
Simplified2.9%
add-cbrt-cube16.9%
pow1/316.9%
Applied egg-rr16.9%
unpow1/316.9%
*-commutative16.9%
*-commutative16.9%
associate-/l*16.9%
Simplified16.9%
Final simplification51.7%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (pow (* 2.0 (* PI n)) (+ 0.5 (* k -0.5)))))
double code(double k, double n) {
return pow(k, -0.5) * pow((2.0 * (((double) M_PI) * n)), (0.5 + (k * -0.5)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow((2.0 * (Math.PI * n)), (0.5 + (k * -0.5)));
}
def code(k, n): return math.pow(k, -0.5) * math.pow((2.0 * (math.pi * n)), (0.5 + (k * -0.5)))
function code(k, n) return Float64((k ^ -0.5) * (Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 + Float64(k * -0.5)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * ((2.0 * (pi * n)) ^ (0.5 + (k * -0.5))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(k * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 + k \cdot -0.5\right)}
\end{array}
Initial program 99.4%
associate-*l/99.4%
*-lft-identity99.4%
associate-*l*99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
div-inv99.4%
sub-neg99.4%
div-inv99.4%
metadata-eval99.4%
distribute-rgt-neg-in99.4%
metadata-eval99.4%
pow1/299.4%
pow-flip99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Final simplification99.5%
(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.4%
associate-*l/99.4%
*-lft-identity99.4%
associate-*l*99.4%
div-sub99.4%
metadata-eval99.4%
Simplified99.4%
(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 38.0%
*-commutative38.0%
associate-/l*38.0%
Simplified38.0%
pow138.0%
sqrt-unprod38.1%
Applied egg-rr38.1%
unpow138.1%
*-commutative38.1%
associate-*l*38.1%
Simplified38.1%
Taylor expanded in k around 0 38.1%
associate-*r/38.1%
*-commutative38.1%
associate-/l*38.1%
Simplified38.1%
associate-*r*38.1%
*-commutative38.1%
sqrt-prod49.8%
Applied egg-rr49.8%
*-commutative49.8%
*-commutative49.8%
Simplified49.8%
Final simplification49.8%
(FPCore (k n) :precision binary64 (* (sqrt (* 2.0 (/ PI k))) (sqrt n)))
double code(double k, double n) {
return sqrt((2.0 * (((double) M_PI) / k))) * sqrt(n);
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (Math.PI / k))) * Math.sqrt(n);
}
def code(k, n): return math.sqrt((2.0 * (math.pi / k))) * math.sqrt(n)
function code(k, n) return Float64(sqrt(Float64(2.0 * Float64(pi / k))) * sqrt(n)) end
function tmp = code(k, n) tmp = sqrt((2.0 * (pi / k))) * sqrt(n); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi}{k}} \cdot \sqrt{n}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.0%
*-commutative38.0%
associate-/l*38.0%
Simplified38.0%
pow138.0%
sqrt-unprod38.1%
Applied egg-rr38.1%
unpow138.1%
*-commutative38.1%
associate-*l*38.1%
Simplified38.1%
*-commutative38.1%
sqrt-prod49.8%
*-commutative49.8%
Applied egg-rr49.8%
(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.4%
Taylor expanded in k around 0 38.0%
*-commutative38.0%
associate-/l*38.0%
Simplified38.0%
pow138.0%
sqrt-unprod38.1%
Applied egg-rr38.1%
unpow138.1%
*-commutative38.1%
associate-*l*38.1%
Simplified38.1%
sqrt-prod49.8%
*-commutative49.8%
Applied egg-rr49.8%
associate-*r/49.8%
*-commutative49.8%
associate-/l*49.8%
Simplified49.8%
(FPCore (k n) :precision binary64 (pow (* 0.5 (/ k (* PI n))) -0.5))
double code(double k, double n) {
return pow((0.5 * (k / (((double) M_PI) * n))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((0.5 * (k / (Math.PI * n))), -0.5);
}
def code(k, n): return math.pow((0.5 * (k / (math.pi * n))), -0.5)
function code(k, n) return Float64(0.5 * Float64(k / Float64(pi * n))) ^ -0.5 end
function tmp = code(k, n) tmp = (0.5 * (k / (pi * n))) ^ -0.5; end
code[k_, n_] := N[Power[N[(0.5 * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(0.5 \cdot \frac{k}{\pi \cdot n}\right)}^{-0.5}
\end{array}
Initial program 99.4%
associate-/r/99.4%
associate-*r*99.4%
div-sub99.4%
metadata-eval99.4%
sub-neg99.4%
div-inv99.4%
metadata-eval99.4%
distribute-rgt-neg-in99.4%
metadata-eval99.4%
Applied egg-rr99.4%
Taylor expanded in k around 0 39.7%
associate-*r/39.7%
*-rgt-identity39.7%
*-commutative39.7%
associate-/r*39.7%
Simplified39.7%
inv-pow39.7%
add-sqr-sqrt39.6%
sqrt-unprod39.7%
sqrt-pow239.7%
Applied egg-rr39.9%
(FPCore (k n) :precision binary64 (sqrt (* n (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt((n * (2.0 * (((double) M_PI) / k))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 * (Math.PI / k))));
}
def code(k, n): return math.sqrt((n * (2.0 * (math.pi / k))))
function code(k, n) return sqrt(Float64(n * Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 * (pi / k)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(2 \cdot \frac{\pi}{k}\right)}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.0%
*-commutative38.0%
associate-/l*38.0%
Simplified38.0%
pow138.0%
sqrt-unprod38.1%
Applied egg-rr38.1%
unpow138.1%
*-commutative38.1%
associate-*l*38.1%
Simplified38.1%
Final simplification38.1%
(FPCore (k n) :precision binary64 (sqrt (* n (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt((n * (((double) M_PI) * (2.0 / k))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (Math.PI * (2.0 / k))));
}
def code(k, n): return math.sqrt((n * (math.pi * (2.0 / k))))
function code(k, n) return sqrt(Float64(n * Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt((n * (pi * (2.0 / k)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(\pi \cdot \frac{2}{k}\right)}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.0%
*-commutative38.0%
associate-/l*38.0%
Simplified38.0%
pow138.0%
sqrt-unprod38.1%
Applied egg-rr38.1%
unpow138.1%
*-commutative38.1%
associate-*l*38.1%
Simplified38.1%
Taylor expanded in k around 0 38.1%
associate-*r/38.1%
*-commutative38.1%
associate-/l*38.1%
Simplified38.1%
herbie shell --seed 2024135
(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))))