
(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 14 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)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return sqrt(t_0) / sqrt((k * pow(t_0, k)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.sqrt(t_0) / Math.sqrt((k * Math.pow(t_0, k)));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ 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[Sqrt[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k \cdot {t\_0}^{k}}}
\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%
pow199.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
Applied egg-rr99.7%
unpow199.7%
exp-to-pow96.1%
*-commutative96.1%
metadata-eval96.1%
distribute-lft-neg-in96.1%
*-commutative96.1%
exp-neg96.1%
exp-to-pow99.6%
unpow1/299.6%
associate-/l*99.7%
*-rgt-identity99.7%
*-commutative99.7%
Simplified99.7%
associate-/l/99.7%
div-inv99.6%
pow-unpow99.6%
pow1/299.6%
pow-prod-down99.6%
*-commutative99.6%
*-commutative99.6%
associate-*r*99.6%
Applied egg-rr99.6%
associate-*r/99.7%
*-rgt-identity99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
unpow1/299.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
Simplified99.7%
Final simplification99.7%
(FPCore (k n) :precision binary64 (if (<= k 7.2e-50) (* (sqrt (* PI (* 2.0 n))) (sqrt (/ 1.0 k))) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 7.2e-50) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) * sqrt((1.0 / k));
} 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.2e-50) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) * Math.sqrt((1.0 / k));
} 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.2e-50: tmp = math.sqrt((math.pi * (2.0 * n))) * math.sqrt((1.0 / k)) 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.2e-50) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) * sqrt(Float64(1.0 / k))); 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.2e-50) tmp = sqrt((pi * (2.0 * n))) * sqrt((1.0 / k)); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 7.2e-50], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / k), $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.2 \cdot 10^{-50}:\\
\;\;\;\;\sqrt{\pi \cdot \left(2 \cdot n\right)} \cdot \sqrt{\frac{1}{k}}\\
\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.19999999999999958e-50Initial program 99.3%
Taylor expanded in k around 0 68.6%
associate-/l*68.6%
Simplified68.6%
*-commutative68.6%
pow1/268.6%
pow1/268.6%
pow-prod-down68.8%
Applied egg-rr68.8%
metadata-eval68.8%
associate-*r/68.8%
*-commutative68.8%
times-frac68.8%
associate-*r*68.8%
*-commutative68.8%
*-un-lft-identity68.8%
clear-num68.7%
*-commutative68.7%
Applied egg-rr68.7%
associate-/r/68.7%
unpow-prod-down99.5%
*-commutative99.5%
associate-*l*99.5%
pow1/299.5%
Applied egg-rr99.5%
unpow1/299.5%
*-commutative99.5%
Simplified99.5%
if 7.19999999999999958e-50 < k Initial program 99.6%
Applied egg-rr99.6%
*-commutative99.6%
distribute-lft-in99.6%
metadata-eval99.6%
*-commutative99.6%
associate-*r*99.6%
metadata-eval99.6%
neg-mul-199.6%
sub-neg99.6%
Simplified99.6%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 3.2e+250) (* (sqrt (* PI (* 2.0 n))) (sqrt (/ 1.0 k))) (cbrt (pow (* n (* PI (/ 2.0 k))) 1.5))))
double code(double k, double n) {
double tmp;
if (k <= 3.2e+250) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) * sqrt((1.0 / k));
} else {
tmp = cbrt(pow((n * (((double) M_PI) * (2.0 / k))), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.2e+250) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) * Math.sqrt((1.0 / k));
} else {
tmp = Math.cbrt(Math.pow((n * (Math.PI * (2.0 / k))), 1.5));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 3.2e+250) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) * sqrt(Float64(1.0 / k))); else tmp = cbrt((Float64(n * Float64(pi * Float64(2.0 / k))) ^ 1.5)); end return tmp end
code[k_, n_] := If[LessEqual[k, 3.2e+250], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.2 \cdot 10^{+250}:\\
\;\;\;\;\sqrt{\pi \cdot \left(2 \cdot n\right)} \cdot \sqrt{\frac{1}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(n \cdot \left(\pi \cdot \frac{2}{k}\right)\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 3.1999999999999997e250Initial program 99.4%
Taylor expanded in k around 0 41.3%
associate-/l*41.3%
Simplified41.3%
*-commutative41.3%
pow1/241.3%
pow1/241.3%
pow-prod-down41.4%
Applied egg-rr41.4%
metadata-eval41.4%
associate-*r/41.4%
*-commutative41.4%
times-frac41.4%
associate-*r*41.4%
*-commutative41.4%
*-un-lft-identity41.4%
clear-num41.4%
*-commutative41.4%
Applied egg-rr41.4%
associate-/r/41.3%
unpow-prod-down56.0%
*-commutative56.0%
associate-*l*56.0%
pow1/256.0%
Applied egg-rr56.0%
unpow1/256.0%
*-commutative56.0%
Simplified56.0%
if 3.1999999999999997e250 < k Initial program 100.0%
Taylor expanded in k around 0 3.2%
associate-/l*3.2%
Simplified3.2%
*-commutative3.2%
pow1/23.2%
pow1/23.2%
pow-prod-down3.2%
Applied egg-rr3.2%
Taylor expanded in n around 0 3.2%
associate-*r/3.2%
*-commutative3.2%
associate-/l*3.2%
Simplified3.2%
add-cbrt-cube36.7%
pow-prod-up36.7%
metadata-eval36.7%
pow-prod-up36.7%
associate-*r/36.7%
associate-*r*36.7%
*-commutative36.7%
associate-*l*36.7%
metadata-eval36.7%
Applied egg-rr36.7%
associate-*l*36.7%
associate-/l*36.7%
*-commutative36.7%
associate-*r/36.7%
Simplified36.7%
Final simplification54.5%
(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%
Taylor expanded in k around 0 99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 6.5e+250) (* (pow k -0.5) (sqrt (* PI (* 2.0 n)))) (cbrt (pow (* n (* PI (/ 2.0 k))) 1.5))))
double code(double k, double n) {
double tmp;
if (k <= 6.5e+250) {
tmp = pow(k, -0.5) * sqrt((((double) M_PI) * (2.0 * n)));
} else {
tmp = cbrt(pow((n * (((double) M_PI) * (2.0 / k))), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6.5e+250) {
tmp = Math.pow(k, -0.5) * Math.sqrt((Math.PI * (2.0 * n)));
} else {
tmp = Math.cbrt(Math.pow((n * (Math.PI * (2.0 / k))), 1.5));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 6.5e+250) tmp = Float64((k ^ -0.5) * sqrt(Float64(pi * Float64(2.0 * n)))); else tmp = cbrt((Float64(n * Float64(pi * Float64(2.0 / k))) ^ 1.5)); end return tmp end
code[k_, n_] := If[LessEqual[k, 6.5e+250], N[(N[Power[k, -0.5], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(n * N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.5 \cdot 10^{+250}:\\
\;\;\;\;{k}^{-0.5} \cdot \sqrt{\pi \cdot \left(2 \cdot n\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(n \cdot \left(\pi \cdot \frac{2}{k}\right)\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 6.5000000000000004e250Initial program 99.4%
Taylor expanded in k around 0 41.3%
associate-/l*41.3%
Simplified41.3%
*-commutative41.3%
pow1/241.3%
pow1/241.3%
pow-prod-down41.4%
Applied egg-rr41.4%
metadata-eval41.4%
associate-*r/41.4%
*-commutative41.4%
times-frac41.4%
associate-*r*41.4%
*-commutative41.4%
*-un-lft-identity41.4%
clear-num41.4%
*-commutative41.4%
Applied egg-rr41.4%
unpow1/241.4%
associate-/r/41.3%
sqrt-prod56.0%
inv-pow56.0%
metadata-eval56.0%
pow-prod-up55.9%
sqrt-unprod55.8%
add-sqr-sqrt55.9%
*-commutative55.9%
associate-*l*55.9%
Applied egg-rr55.9%
if 6.5000000000000004e250 < k Initial program 100.0%
Taylor expanded in k around 0 3.2%
associate-/l*3.2%
Simplified3.2%
*-commutative3.2%
pow1/23.2%
pow1/23.2%
pow-prod-down3.2%
Applied egg-rr3.2%
Taylor expanded in n around 0 3.2%
associate-*r/3.2%
*-commutative3.2%
associate-/l*3.2%
Simplified3.2%
add-cbrt-cube36.7%
pow-prod-up36.7%
metadata-eval36.7%
pow-prod-up36.7%
associate-*r/36.7%
associate-*r*36.7%
*-commutative36.7%
associate-*l*36.7%
metadata-eval36.7%
Applied egg-rr36.7%
associate-*l*36.7%
associate-/l*36.7%
*-commutative36.7%
associate-*r/36.7%
Simplified36.7%
Final simplification54.4%
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (/ 2.0 k)))) (if (<= k 2.85e+250) (* (sqrt n) (sqrt t_0)) (cbrt (pow (* n t_0) 1.5)))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 / k);
double tmp;
if (k <= 2.85e+250) {
tmp = sqrt(n) * sqrt(t_0);
} else {
tmp = cbrt(pow((n * t_0), 1.5));
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 / k);
double tmp;
if (k <= 2.85e+250) {
tmp = Math.sqrt(n) * Math.sqrt(t_0);
} else {
tmp = Math.cbrt(Math.pow((n * t_0), 1.5));
}
return tmp;
}
function code(k, n) t_0 = Float64(pi * Float64(2.0 / k)) tmp = 0.0 if (k <= 2.85e+250) tmp = Float64(sqrt(n) * sqrt(t_0)); else tmp = cbrt((Float64(n * t_0) ^ 1.5)); end return tmp end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 2.85e+250], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[Power[N[Power[N[(n * t$95$0), $MachinePrecision], 1.5], $MachinePrecision], 1/3], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \frac{2}{k}\\
\mathbf{if}\;k \leq 2.85 \cdot 10^{+250}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\left(n \cdot t\_0\right)}^{1.5}}\\
\end{array}
\end{array}
if k < 2.84999999999999993e250Initial program 99.4%
Taylor expanded in k around 0 41.3%
associate-/l*41.3%
Simplified41.3%
*-commutative41.3%
pow1/241.3%
pow1/241.3%
pow-prod-down41.4%
Applied egg-rr41.4%
Taylor expanded in n around 0 41.4%
associate-*r/41.4%
*-commutative41.4%
associate-/l*41.3%
Simplified41.3%
associate-*l*41.4%
unpow-prod-down55.9%
pow1/255.9%
Applied egg-rr55.9%
unpow1/255.9%
Simplified55.9%
if 2.84999999999999993e250 < k Initial program 100.0%
Taylor expanded in k around 0 3.2%
associate-/l*3.2%
Simplified3.2%
*-commutative3.2%
pow1/23.2%
pow1/23.2%
pow-prod-down3.2%
Applied egg-rr3.2%
Taylor expanded in n around 0 3.2%
associate-*r/3.2%
*-commutative3.2%
associate-/l*3.2%
Simplified3.2%
add-cbrt-cube36.7%
pow-prod-up36.7%
metadata-eval36.7%
pow-prod-up36.7%
associate-*r/36.7%
associate-*r*36.7%
*-commutative36.7%
associate-*l*36.7%
metadata-eval36.7%
Applied egg-rr36.7%
associate-*l*36.7%
associate-/l*36.7%
*-commutative36.7%
associate-*r/36.7%
Simplified36.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.5%
*-lft-identity99.5%
associate-*l*99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
metadata-eval99.5%
div-sub99.5%
associate-*r*99.5%
div-inv99.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%
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.5%
*-lft-identity99.5%
associate-*l*99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
(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.3%
associate-/l*38.3%
Simplified38.3%
*-commutative38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
Taylor expanded in n around 0 38.4%
associate-*r/38.4%
*-commutative38.4%
associate-/l*38.4%
Simplified38.4%
associate-*l*38.4%
unpow-prod-down51.8%
pow1/251.8%
Applied egg-rr51.8%
unpow1/251.8%
Simplified51.8%
(FPCore (k n) :precision binary64 (pow (/ (* k 0.5) (* PI n)) -0.5))
double code(double k, double n) {
return pow(((k * 0.5) / (((double) M_PI) * n)), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k * 0.5) / (Math.PI * n)), -0.5);
}
def code(k, n): return math.pow(((k * 0.5) / (math.pi * n)), -0.5)
function code(k, n) return Float64(Float64(k * 0.5) / Float64(pi * n)) ^ -0.5 end
function tmp = code(k, n) tmp = ((k * 0.5) / (pi * n)) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k * 0.5), $MachinePrecision] / N[(Pi * n), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k \cdot 0.5}{\pi \cdot n}\right)}^{-0.5}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.3%
associate-/l*38.3%
Simplified38.3%
*-commutative38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
metadata-eval38.4%
associate-*r/38.4%
*-commutative38.4%
times-frac38.4%
associate-*r*38.4%
*-commutative38.4%
*-un-lft-identity38.4%
clear-num38.4%
*-commutative38.4%
Applied egg-rr38.4%
*-un-lft-identity38.4%
inv-pow38.4%
pow-pow39.2%
*-un-lft-identity39.2%
associate-*r*39.2%
*-commutative39.2%
times-frac39.2%
metadata-eval39.2%
metadata-eval39.2%
Applied egg-rr39.2%
*-lft-identity39.2%
associate-*r/39.2%
*-commutative39.2%
Simplified39.2%
Final simplification39.2%
(FPCore (k n) :precision binary64 (pow (* 2.0 (* n (/ PI k))) 0.5))
double code(double k, double n) {
return pow((2.0 * (n * (((double) M_PI) / k))), 0.5);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (n * (Math.PI / k))), 0.5);
}
def code(k, n): return math.pow((2.0 * (n * (math.pi / k))), 0.5)
function code(k, n) return Float64(2.0 * Float64(n * Float64(pi / k))) ^ 0.5 end
function tmp = code(k, n) tmp = (2.0 * (n * (pi / k))) ^ 0.5; end
code[k_, n_] := N[Power[N[(2.0 * N[(n * N[(Pi / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(2 \cdot \left(n \cdot \frac{\pi}{k}\right)\right)}^{0.5}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.3%
associate-/l*38.3%
Simplified38.3%
*-commutative38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
(FPCore (k n) :precision binary64 (sqrt (/ (* PI (* 2.0 n)) k)))
double code(double k, double n) {
return sqrt(((((double) M_PI) * (2.0 * n)) / k));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI * (2.0 * n)) / k));
}
def code(k, n): return math.sqrt(((math.pi * (2.0 * n)) / k))
function code(k, n) return sqrt(Float64(Float64(pi * Float64(2.0 * n)) / k)) end
function tmp = code(k, n) tmp = sqrt(((pi * (2.0 * n)) / k)); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot \left(2 \cdot n\right)}{k}}
\end{array}
Initial program 99.4%
Taylor expanded in k around 0 38.3%
associate-/l*38.3%
Simplified38.3%
*-commutative38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
Taylor expanded in n around 0 38.4%
associate-*r/38.4%
*-commutative38.4%
associate-/l*38.4%
Simplified38.4%
unpow1/238.4%
associate-*r/38.4%
associate-*r*38.4%
*-commutative38.4%
associate-*l*38.4%
Applied egg-rr38.4%
Final simplification38.4%
(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.3%
associate-/l*38.3%
Simplified38.3%
*-commutative38.3%
pow1/238.3%
pow1/238.3%
pow-prod-down38.4%
Applied egg-rr38.4%
Taylor expanded in n around 0 38.4%
associate-*r/38.4%
*-commutative38.4%
associate-/l*38.4%
Simplified38.4%
*-un-lft-identity38.4%
unpow1/238.4%
associate-*r/38.4%
associate-*r*38.4%
*-commutative38.4%
associate-*l*38.4%
Applied egg-rr38.4%
*-lft-identity38.4%
associate-*l*38.4%
associate-/l*38.4%
*-commutative38.4%
associate-*r/38.4%
Simplified38.4%
herbie shell --seed 2024154
(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))))