
(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 12 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 (* (pow k -0.5) (pow (fabs (* PI (* n 2.0))) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return pow(k, -0.5) * pow(fabs((((double) M_PI) * (n * 2.0))), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow(Math.abs((Math.PI * (n * 2.0))), ((1.0 - k) / 2.0));
}
def code(k, n): return math.pow(k, -0.5) * math.pow(math.fabs((math.pi * (n * 2.0))), ((1.0 - k) / 2.0))
function code(k, n) return Float64((k ^ -0.5) * (abs(Float64(pi * Float64(n * 2.0))) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * (abs((pi * (n * 2.0))) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[Abs[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(\left|\pi \cdot \left(n \cdot 2\right)\right|\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 98.0%
associate-*r*98.0%
add-sqr-sqrt81.9%
sqrt-unprod79.2%
*-commutative79.2%
*-commutative79.2%
swap-sqr79.2%
pow279.2%
metadata-eval79.2%
Applied egg-rr79.2%
*-commutative79.2%
metadata-eval79.2%
unpow279.2%
swap-sqr79.2%
rem-sqrt-square99.5%
*-commutative99.5%
associate-*l*99.5%
Simplified99.5%
*-un-lft-identity99.5%
inv-pow99.5%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-lft-identity99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 3.7e-68) (* (sqrt (* n 2.0)) (sqrt (/ PI k))) (sqrt (/ (pow (* PI (* n 2.0)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 3.7e-68) {
tmp = sqrt((n * 2.0)) * sqrt((((double) M_PI) / k));
} 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 <= 3.7e-68) {
tmp = Math.sqrt((n * 2.0)) * Math.sqrt((Math.PI / k));
} 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 <= 3.7e-68: tmp = math.sqrt((n * 2.0)) * math.sqrt((math.pi / k)) 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 <= 3.7e-68) tmp = Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(pi / k))); 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 <= 3.7e-68) tmp = sqrt((n * 2.0)) * sqrt((pi / k)); else tmp = sqrt((((pi * (n * 2.0)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.7e-68], N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $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 3.7 \cdot 10^{-68}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 3.70000000000000002e-68Initial program 99.2%
Taylor expanded in k around 0 65.7%
*-commutative65.7%
associate-/l*65.7%
Simplified65.7%
pow165.7%
sqrt-unprod65.9%
associate-*r/65.9%
*-commutative65.9%
Applied egg-rr65.9%
unpow165.9%
*-commutative65.9%
*-commutative65.9%
*-commutative65.9%
associate-/l*65.9%
Simplified65.9%
associate-*r*65.9%
*-commutative65.9%
sqrt-prod99.4%
Applied egg-rr99.4%
if 3.70000000000000002e-68 < k Initial program 97.3%
add-sqr-sqrt97.3%
sqrt-unprod97.3%
*-commutative97.3%
associate-*r*97.3%
div-sub97.3%
metadata-eval97.3%
div-inv97.4%
*-commutative97.4%
Applied egg-rr97.3%
Simplified97.4%
Final simplification98.1%
(FPCore (k n) :precision binary64 (if (<= k 2e+62) (/ (sqrt (* PI (* n 2.0))) (sqrt k)) (sqrt (* 2.0 (+ -1.0 (fma n (/ PI k) 1.0))))))
double code(double k, double n) {
double tmp;
if (k <= 2e+62) {
tmp = sqrt((((double) M_PI) * (n * 2.0))) / sqrt(k);
} else {
tmp = sqrt((2.0 * (-1.0 + fma(n, (((double) M_PI) / k), 1.0))));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 2e+62) tmp = Float64(sqrt(Float64(pi * Float64(n * 2.0))) / sqrt(k)); else tmp = sqrt(Float64(2.0 * Float64(-1.0 + fma(n, Float64(pi / k), 1.0)))); end return tmp end
code[k_, n_] := If[LessEqual[k, 2e+62], N[(N[Sqrt[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(-1.0 + N[(n * N[(Pi / k), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 2 \cdot 10^{+62}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(n \cdot 2\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(-1 + \mathsf{fma}\left(n, \frac{\pi}{k}, 1\right)\right)}\\
\end{array}
\end{array}
if k < 2.00000000000000007e62Initial program 96.5%
Taylor expanded in k around 0 53.0%
*-commutative53.0%
associate-/l*53.0%
Simplified53.0%
pow153.0%
sqrt-unprod53.2%
associate-*r/53.1%
*-commutative53.1%
Applied egg-rr53.1%
unpow153.1%
*-commutative53.1%
*-commutative53.1%
*-commutative53.1%
associate-/l*53.2%
Simplified53.2%
associate-*r/53.1%
associate-*r/53.1%
add-sqr-sqrt53.0%
add-sqr-sqrt53.0%
frac-times53.1%
*-un-lft-identity53.1%
associate-*l/53.0%
*-un-lft-identity53.0%
associate-*l/53.0%
sqrt-unprod72.3%
add-sqr-sqrt72.6%
associate-*l/72.8%
Applied egg-rr72.8%
if 2.00000000000000007e62 < k Initial program 100.0%
Taylor expanded in k around 0 1.8%
*-commutative1.8%
associate-/l*1.8%
Simplified1.8%
pow11.8%
sqrt-unprod1.8%
associate-*r/1.8%
*-commutative1.8%
Applied egg-rr1.8%
unpow11.8%
*-commutative1.8%
*-commutative1.8%
*-commutative1.8%
associate-/l*1.8%
Simplified1.8%
Taylor expanded in n around 0 1.8%
*-commutative1.8%
associate-/l*1.8%
Simplified1.8%
*-commutative1.8%
div-inv1.8%
associate-*r*1.8%
*-commutative1.8%
expm1-log1p-u1.8%
expm1-undefine36.8%
div-inv36.8%
clear-num36.8%
un-div-inv36.8%
Applied egg-rr36.8%
sub-neg36.8%
metadata-eval36.8%
+-commutative36.8%
log1p-undefine36.8%
rem-exp-log36.8%
+-commutative36.8%
associate-/r/36.8%
associate-*l/36.8%
associate-/l*36.8%
fma-define36.8%
Simplified36.8%
Final simplification57.4%
(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 98.0%
associate-*l/98.1%
*-lft-identity98.1%
associate-*l*98.1%
div-sub98.1%
metadata-eval98.1%
Simplified98.1%
Final simplification98.1%
(FPCore (k n) :precision binary64 (sqrt (/ (fabs (* PI (* n 2.0))) k)))
double code(double k, double n) {
return sqrt((fabs((((double) M_PI) * (n * 2.0))) / k));
}
public static double code(double k, double n) {
return Math.sqrt((Math.abs((Math.PI * (n * 2.0))) / k));
}
def code(k, n): return math.sqrt((math.fabs((math.pi * (n * 2.0))) / k))
function code(k, n) return sqrt(Float64(abs(Float64(pi * Float64(n * 2.0))) / k)) end
function tmp = code(k, n) tmp = sqrt((abs((pi * (n * 2.0))) / k)); end
code[k_, n_] := N[Sqrt[N[(N[Abs[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\left|\pi \cdot \left(n \cdot 2\right)\right|}{k}}
\end{array}
Initial program 98.0%
associate-*r*98.0%
add-sqr-sqrt81.9%
sqrt-unprod79.2%
*-commutative79.2%
*-commutative79.2%
swap-sqr79.2%
pow279.2%
metadata-eval79.2%
Applied egg-rr79.2%
*-commutative79.2%
metadata-eval79.2%
unpow279.2%
swap-sqr79.2%
rem-sqrt-square99.5%
*-commutative99.5%
associate-*l*99.5%
Simplified99.5%
*-un-lft-identity99.5%
inv-pow99.5%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
*-lft-identity99.6%
Simplified99.6%
Taylor expanded in k around 0 31.8%
*-commutative31.8%
*-commutative31.8%
associate-*r*31.8%
*-commutative31.8%
Simplified31.8%
Final simplification31.8%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 * (math.pi / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}
\end{array}
Initial program 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
Taylor expanded in n around 0 31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
pow1/231.3%
*-commutative31.3%
associate-*r/31.3%
associate-*l/31.3%
associate-*r*31.3%
*-commutative31.3%
associate-*r/31.3%
associate-*l*31.3%
unpow-prod-down42.6%
pow1/242.6%
Applied egg-rr42.6%
unpow1/242.6%
Simplified42.6%
Final simplification42.6%
(FPCore (k n) :precision binary64 (* (sqrt (* n 2.0)) (sqrt (/ PI k))))
double code(double k, double n) {
return sqrt((n * 2.0)) * sqrt((((double) M_PI) / k));
}
public static double code(double k, double n) {
return Math.sqrt((n * 2.0)) * Math.sqrt((Math.PI / k));
}
def code(k, n): return math.sqrt((n * 2.0)) * math.sqrt((math.pi / k))
function code(k, n) return Float64(sqrt(Float64(n * 2.0)) * sqrt(Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt((n * 2.0)) * sqrt((pi / k)); end
code[k_, n_] := N[(N[Sqrt[N[(n * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot 2} \cdot \sqrt{\frac{\pi}{k}}
\end{array}
Initial program 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
associate-*r*31.3%
*-commutative31.3%
sqrt-prod42.6%
Applied egg-rr42.6%
Final simplification42.6%
(FPCore (k n) :precision binary64 (/ (sqrt (* PI (* n 2.0))) (sqrt k)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (n * 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (n * 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((math.pi * (n * 2.0))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(n * 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((pi * (n * 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\pi \cdot \left(n \cdot 2\right)}}{\sqrt{k}}
\end{array}
Initial program 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
associate-*r/31.3%
associate-*r/31.3%
add-sqr-sqrt31.2%
add-sqr-sqrt31.2%
frac-times31.2%
*-un-lft-identity31.2%
associate-*l/31.2%
*-un-lft-identity31.2%
associate-*l/31.2%
sqrt-unprod42.3%
add-sqr-sqrt42.5%
associate-*l/42.6%
Applied egg-rr42.6%
Final simplification42.6%
(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 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
Taylor expanded in n around 0 31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
*-commutative31.3%
associate-*r/31.3%
associate-*l/31.3%
associate-*r*31.3%
sqrt-undiv42.6%
clear-num42.5%
sqrt-undiv31.6%
Applied egg-rr31.6%
Final simplification31.6%
(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 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
Final simplification31.3%
(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 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
Taylor expanded in n around 0 31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
Final simplification31.3%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ n (/ k PI)))))
double code(double k, double n) {
return sqrt((2.0 * (n / (k / ((double) M_PI)))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n / (k / Math.PI))));
}
def code(k, n): return math.sqrt((2.0 * (n / (k / math.pi))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n / (k / pi)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n / N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{n}{\frac{k}{\pi}}}
\end{array}
Initial program 98.0%
Taylor expanded in k around 0 31.2%
*-commutative31.2%
associate-/l*31.2%
Simplified31.2%
pow131.2%
sqrt-unprod31.3%
associate-*r/31.3%
*-commutative31.3%
Applied egg-rr31.3%
unpow131.3%
*-commutative31.3%
*-commutative31.3%
*-commutative31.3%
associate-/l*31.3%
Simplified31.3%
clear-num31.3%
un-div-inv31.3%
Applied egg-rr31.3%
Final simplification31.3%
herbie shell --seed 2024058
(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))))