
(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 (let* ((t_0 (* 2.0 (* PI n)))) (/ (sqrt (/ t_0 (pow t_0 k))) (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))) / 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))) / Math.sqrt(k);
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return math.sqrt((t_0 / math.pow(t_0, k))) / math.sqrt(k)
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(sqrt(Float64(t_0 / (t_0 ^ k))) / sqrt(k)) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = sqrt((t_0 / (t_0 ^ k))) / sqrt(k); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[N[(t$95$0 / N[Power[t$95$0, k], $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{\frac{t\_0}{{t\_0}^{k}}}}{\sqrt{k}}
\end{array}
\end{array}
Initial program 99.1%
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
div-subN/A
--lowering--.f64N/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6499.1%
Simplified99.1%
pow-subN/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
pow-subN/A
metadata-evalN/A
div-subN/A
rem-exp-logN/A
pow-flipN/A
rem-exp-logN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
Applied egg-rr99.1%
pow-flipN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
sub-negN/A
pow-subN/A
pow1/2N/A
sqrt-pow1N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.3%
(FPCore (k n) :precision binary64 (if (<= k 3.6e-11) (* (pow (/ PI k) 0.5) (sqrt (/ n 0.5))) (sqrt (/ (pow (* 2.0 (* PI n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 3.6e-11) {
tmp = pow((((double) M_PI) / k), 0.5) * sqrt((n / 0.5));
} 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 <= 3.6e-11) {
tmp = Math.pow((Math.PI / k), 0.5) * Math.sqrt((n / 0.5));
} 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 <= 3.6e-11: tmp = math.pow((math.pi / k), 0.5) * math.sqrt((n / 0.5)) 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 <= 3.6e-11) tmp = Float64((Float64(pi / k) ^ 0.5) * sqrt(Float64(n / 0.5))); 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 <= 3.6e-11) tmp = ((pi / k) ^ 0.5) * sqrt((n / 0.5)); else tmp = sqrt((((2.0 * (pi * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.6e-11], N[(N[Power[N[(Pi / k), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(n / 0.5), $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 3.6 \cdot 10^{-11}:\\
\;\;\;\;{\left(\frac{\pi}{k}\right)}^{0.5} \cdot \sqrt{\frac{n}{0.5}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 3.59999999999999985e-11Initial program 98.4%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6471.2%
Simplified71.2%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6498.4%
Applied egg-rr98.4%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6498.4%
Applied egg-rr98.4%
sqrt-unprodN/A
clear-numN/A
div-invN/A
div-invN/A
metadata-evalN/A
times-fracN/A
sqrt-prodN/A
pow1/2N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6498.5%
Applied egg-rr98.5%
if 3.59999999999999985e-11 < k Initial program 99.7%
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
div-subN/A
--lowering--.f64N/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6499.7%
Simplified99.7%
pow-subN/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
pow-subN/A
metadata-evalN/A
div-subN/A
rem-exp-logN/A
pow-flipN/A
rem-exp-logN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
Applied egg-rr99.7%
pow-flipN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
sub-negN/A
pow-subN/A
pow1/2N/A
sqrt-pow1N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr100.0%
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r/N/A
pow-flipN/A
pow-plusN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
+-lowering-+.f64N/A
neg-sub0N/A
--lowering--.f6499.7%
Applied egg-rr99.7%
Final simplification99.1%
(FPCore (k n) :precision binary64 (if (<= k 3.8e-134) (* (pow (/ PI k) 0.5) (sqrt (/ n 0.5))) (/ (sqrt (* 2.0 (* PI n))) (pow (* k k) 0.25))))
double code(double k, double n) {
double tmp;
if (k <= 3.8e-134) {
tmp = pow((((double) M_PI) / k), 0.5) * sqrt((n / 0.5));
} else {
tmp = sqrt((2.0 * (((double) M_PI) * n))) / pow((k * k), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 3.8e-134) {
tmp = Math.pow((Math.PI / k), 0.5) * Math.sqrt((n / 0.5));
} else {
tmp = Math.sqrt((2.0 * (Math.PI * n))) / Math.pow((k * k), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 3.8e-134: tmp = math.pow((math.pi / k), 0.5) * math.sqrt((n / 0.5)) else: tmp = math.sqrt((2.0 * (math.pi * n))) / math.pow((k * k), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 3.8e-134) tmp = Float64((Float64(pi / k) ^ 0.5) * sqrt(Float64(n / 0.5))); else tmp = Float64(sqrt(Float64(2.0 * Float64(pi * n))) / (Float64(k * k) ^ 0.25)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 3.8e-134) tmp = ((pi / k) ^ 0.5) * sqrt((n / 0.5)); else tmp = sqrt((2.0 * (pi * n))) / ((k * k) ^ 0.25); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 3.8e-134], N[(N[Power[N[(Pi / k), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(n / 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Power[N[(k * k), $MachinePrecision], 0.25], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 3.8 \cdot 10^{-134}:\\
\;\;\;\;{\left(\frac{\pi}{k}\right)}^{0.5} \cdot \sqrt{\frac{n}{0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\pi \cdot n\right)}}{{\left(k \cdot k\right)}^{0.25}}\\
\end{array}
\end{array}
if k < 3.80000000000000003e-134Initial program 98.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6462.1%
Simplified62.1%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6499.3%
Applied egg-rr99.3%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6499.3%
Applied egg-rr99.3%
sqrt-unprodN/A
clear-numN/A
div-invN/A
div-invN/A
metadata-evalN/A
times-fracN/A
sqrt-prodN/A
pow1/2N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6499.5%
Applied egg-rr99.5%
if 3.80000000000000003e-134 < k Initial program 99.5%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6427.3%
Simplified27.3%
*-commutativeN/A
sqrt-divN/A
*-commutativeN/A
associate-*r/N/A
sqrt-prodN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6430.6%
Applied egg-rr30.6%
pow1/2N/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
metadata-eval50.1%
Applied egg-rr50.1%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ 2.0 (/ k (* PI n)))))
(if (<= k 1.55e+260)
(* (pow (/ PI k) 0.5) (sqrt (/ n 0.5)))
(pow (* t_0 t_0) 0.25))))
double code(double k, double n) {
double t_0 = 2.0 / (k / (((double) M_PI) * n));
double tmp;
if (k <= 1.55e+260) {
tmp = pow((((double) M_PI) / k), 0.5) * sqrt((n / 0.5));
} else {
tmp = pow((t_0 * t_0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 / (k / (Math.PI * n));
double tmp;
if (k <= 1.55e+260) {
tmp = Math.pow((Math.PI / k), 0.5) * Math.sqrt((n / 0.5));
} else {
tmp = Math.pow((t_0 * t_0), 0.25);
}
return tmp;
}
def code(k, n): t_0 = 2.0 / (k / (math.pi * n)) tmp = 0 if k <= 1.55e+260: tmp = math.pow((math.pi / k), 0.5) * math.sqrt((n / 0.5)) else: tmp = math.pow((t_0 * t_0), 0.25) return tmp
function code(k, n) t_0 = Float64(2.0 / Float64(k / Float64(pi * n))) tmp = 0.0 if (k <= 1.55e+260) tmp = Float64((Float64(pi / k) ^ 0.5) * sqrt(Float64(n / 0.5))); else tmp = Float64(t_0 * t_0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 / (k / (pi * n)); tmp = 0.0; if (k <= 1.55e+260) tmp = ((pi / k) ^ 0.5) * sqrt((n / 0.5)); else tmp = (t_0 * t_0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 / N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.55e+260], N[(N[Power[N[(Pi / k), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(n / 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(t$95$0 * t$95$0), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{2}{\frac{k}{\pi \cdot n}}\\
\mathbf{if}\;k \leq 1.55 \cdot 10^{+260}:\\
\;\;\;\;{\left(\frac{\pi}{k}\right)}^{0.5} \cdot \sqrt{\frac{n}{0.5}}\\
\mathbf{else}:\\
\;\;\;\;{\left(t\_0 \cdot t\_0\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.5499999999999999e260Initial program 99.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6441.2%
Simplified41.2%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
sqrt-unprodN/A
clear-numN/A
div-invN/A
div-invN/A
metadata-evalN/A
times-fracN/A
sqrt-prodN/A
pow1/2N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
if 1.5499999999999999e260 < k Initial program 100.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f642.8%
Simplified2.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.8%
Applied egg-rr2.8%
pow1/2N/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-eval33.3%
Applied egg-rr33.3%
(FPCore (k n) :precision binary64 (/ (pow k -0.5) (pow (* 2.0 (* PI n)) (+ -0.5 (/ k 2.0)))))
double code(double k, double n) {
return pow(k, -0.5) / pow((2.0 * (((double) M_PI) * n)), (-0.5 + (k / 2.0)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow((2.0 * (Math.PI * n)), (-0.5 + (k / 2.0)));
}
def code(k, n): return math.pow(k, -0.5) / math.pow((2.0 * (math.pi * n)), (-0.5 + (k / 2.0)))
function code(k, n) return Float64((k ^ -0.5) / (Float64(2.0 * Float64(pi * n)) ^ Float64(-0.5 + Float64(k / 2.0)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / ((2.0 * (pi * n)) ^ (-0.5 + (k / 2.0))); 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 / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(-0.5 + \frac{k}{2}\right)}}
\end{array}
Initial program 99.1%
associate-*r*N/A
div-subN/A
metadata-evalN/A
pow-subN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
inv-powN/A
pow1/2N/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
clear-numN/A
pow-subN/A
metadata-evalN/A
div-subN/A
Applied egg-rr99.1%
Final simplification99.1%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ 2.0 (/ k (* PI n)))))
(if (<= k 1.04e+260)
(/ (sqrt n) (sqrt (/ k (/ PI 0.5))))
(pow (* t_0 t_0) 0.25))))
double code(double k, double n) {
double t_0 = 2.0 / (k / (((double) M_PI) * n));
double tmp;
if (k <= 1.04e+260) {
tmp = sqrt(n) / sqrt((k / (((double) M_PI) / 0.5)));
} else {
tmp = pow((t_0 * t_0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 / (k / (Math.PI * n));
double tmp;
if (k <= 1.04e+260) {
tmp = Math.sqrt(n) / Math.sqrt((k / (Math.PI / 0.5)));
} else {
tmp = Math.pow((t_0 * t_0), 0.25);
}
return tmp;
}
def code(k, n): t_0 = 2.0 / (k / (math.pi * n)) tmp = 0 if k <= 1.04e+260: tmp = math.sqrt(n) / math.sqrt((k / (math.pi / 0.5))) else: tmp = math.pow((t_0 * t_0), 0.25) return tmp
function code(k, n) t_0 = Float64(2.0 / Float64(k / Float64(pi * n))) tmp = 0.0 if (k <= 1.04e+260) tmp = Float64(sqrt(n) / sqrt(Float64(k / Float64(pi / 0.5)))); else tmp = Float64(t_0 * t_0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 / (k / (pi * n)); tmp = 0.0; if (k <= 1.04e+260) tmp = sqrt(n) / sqrt((k / (pi / 0.5))); else tmp = (t_0 * t_0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 / N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.04e+260], N[(N[Sqrt[n], $MachinePrecision] / N[Sqrt[N[(k / N[(Pi / 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(t$95$0 * t$95$0), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{2}{\frac{k}{\pi \cdot n}}\\
\mathbf{if}\;k \leq 1.04 \cdot 10^{+260}:\\
\;\;\;\;\frac{\sqrt{n}}{\sqrt{\frac{k}{\frac{\pi}{0.5}}}}\\
\mathbf{else}:\\
\;\;\;\;{\left(t\_0 \cdot t\_0\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.04000000000000001e260Initial program 99.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6441.2%
Simplified41.2%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
sqrt-unprodN/A
clear-numN/A
div-invN/A
*-commutativeN/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64N/A
PI-lowering-PI.f6456.1%
Applied egg-rr56.1%
if 1.04000000000000001e260 < k Initial program 100.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f642.8%
Simplified2.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.8%
Applied egg-rr2.8%
pow1/2N/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-eval33.3%
Applied egg-rr33.3%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ 2.0 (/ k (* PI n)))))
(if (<= k 1.12e+260)
(* (sqrt (* PI n)) (sqrt (/ 2.0 k)))
(pow (* t_0 t_0) 0.25))))
double code(double k, double n) {
double t_0 = 2.0 / (k / (((double) M_PI) * n));
double tmp;
if (k <= 1.12e+260) {
tmp = sqrt((((double) M_PI) * n)) * sqrt((2.0 / k));
} else {
tmp = pow((t_0 * t_0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 / (k / (Math.PI * n));
double tmp;
if (k <= 1.12e+260) {
tmp = Math.sqrt((Math.PI * n)) * Math.sqrt((2.0 / k));
} else {
tmp = Math.pow((t_0 * t_0), 0.25);
}
return tmp;
}
def code(k, n): t_0 = 2.0 / (k / (math.pi * n)) tmp = 0 if k <= 1.12e+260: tmp = math.sqrt((math.pi * n)) * math.sqrt((2.0 / k)) else: tmp = math.pow((t_0 * t_0), 0.25) return tmp
function code(k, n) t_0 = Float64(2.0 / Float64(k / Float64(pi * n))) tmp = 0.0 if (k <= 1.12e+260) tmp = Float64(sqrt(Float64(pi * n)) * sqrt(Float64(2.0 / k))); else tmp = Float64(t_0 * t_0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 / (k / (pi * n)); tmp = 0.0; if (k <= 1.12e+260) tmp = sqrt((pi * n)) * sqrt((2.0 / k)); else tmp = (t_0 * t_0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 / N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.12e+260], N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(t$95$0 * t$95$0), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{2}{\frac{k}{\pi \cdot n}}\\
\mathbf{if}\;k \leq 1.12 \cdot 10^{+260}:\\
\;\;\;\;\sqrt{\pi \cdot n} \cdot \sqrt{\frac{2}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(t\_0 \cdot t\_0\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.12e260Initial program 99.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6441.2%
Simplified41.2%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6456.1%
Applied egg-rr56.1%
if 1.12e260 < k Initial program 100.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f642.8%
Simplified2.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.8%
Applied egg-rr2.8%
pow1/2N/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-eval33.3%
Applied egg-rr33.3%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ 2.0 (/ k (* PI n)))))
(if (<= k 1.04e+260)
(* (sqrt n) (sqrt (* 2.0 (/ PI k))))
(pow (* t_0 t_0) 0.25))))
double code(double k, double n) {
double t_0 = 2.0 / (k / (((double) M_PI) * n));
double tmp;
if (k <= 1.04e+260) {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
} else {
tmp = pow((t_0 * t_0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 / (k / (Math.PI * n));
double tmp;
if (k <= 1.04e+260) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
} else {
tmp = Math.pow((t_0 * t_0), 0.25);
}
return tmp;
}
def code(k, n): t_0 = 2.0 / (k / (math.pi * n)) tmp = 0 if k <= 1.04e+260: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) else: tmp = math.pow((t_0 * t_0), 0.25) return tmp
function code(k, n) t_0 = Float64(2.0 / Float64(k / Float64(pi * n))) tmp = 0.0 if (k <= 1.04e+260) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); else tmp = Float64(t_0 * t_0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 / (k / (pi * n)); tmp = 0.0; if (k <= 1.04e+260) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); else tmp = (t_0 * t_0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 / N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.04e+260], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(t$95$0 * t$95$0), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{2}{\frac{k}{\pi \cdot n}}\\
\mathbf{if}\;k \leq 1.04 \cdot 10^{+260}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(t\_0 \cdot t\_0\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.04000000000000001e260Initial program 99.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6441.2%
Simplified41.2%
sqrt-unprodN/A
associate-/l*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6455.8%
Applied egg-rr55.8%
if 1.04000000000000001e260 < k Initial program 100.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f642.8%
Simplified2.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.8%
Applied egg-rr2.8%
pow1/2N/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-eval33.3%
Applied egg-rr33.3%
Final simplification53.8%
(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/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
div-subN/A
--lowering--.f64N/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6499.1%
Simplified99.1%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ 2.0 (/ k (* PI n)))))
(if (<= k 1.15e+259)
(pow (/ (/ (/ k n) PI) 2.0) -0.5)
(pow (* t_0 t_0) 0.25))))
double code(double k, double n) {
double t_0 = 2.0 / (k / (((double) M_PI) * n));
double tmp;
if (k <= 1.15e+259) {
tmp = pow((((k / n) / ((double) M_PI)) / 2.0), -0.5);
} else {
tmp = pow((t_0 * t_0), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = 2.0 / (k / (Math.PI * n));
double tmp;
if (k <= 1.15e+259) {
tmp = Math.pow((((k / n) / Math.PI) / 2.0), -0.5);
} else {
tmp = Math.pow((t_0 * t_0), 0.25);
}
return tmp;
}
def code(k, n): t_0 = 2.0 / (k / (math.pi * n)) tmp = 0 if k <= 1.15e+259: tmp = math.pow((((k / n) / math.pi) / 2.0), -0.5) else: tmp = math.pow((t_0 * t_0), 0.25) return tmp
function code(k, n) t_0 = Float64(2.0 / Float64(k / Float64(pi * n))) tmp = 0.0 if (k <= 1.15e+259) tmp = Float64(Float64(Float64(k / n) / pi) / 2.0) ^ -0.5; else tmp = Float64(t_0 * t_0) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = 2.0 / (k / (pi * n)); tmp = 0.0; if (k <= 1.15e+259) tmp = (((k / n) / pi) / 2.0) ^ -0.5; else tmp = (t_0 * t_0) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(2.0 / N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.15e+259], N[Power[N[(N[(N[(k / n), $MachinePrecision] / Pi), $MachinePrecision] / 2.0), $MachinePrecision], -0.5], $MachinePrecision], N[Power[N[(t$95$0 * t$95$0), $MachinePrecision], 0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{2}{\frac{k}{\pi \cdot n}}\\
\mathbf{if}\;k \leq 1.15 \cdot 10^{+259}:\\
\;\;\;\;{\left(\frac{\frac{\frac{k}{n}}{\pi}}{2}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(t\_0 \cdot t\_0\right)}^{0.25}\\
\end{array}
\end{array}
if k < 1.1500000000000001e259Initial program 99.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6441.4%
Simplified41.4%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6456.3%
Applied egg-rr56.3%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6456.3%
Applied egg-rr56.3%
*-commutativeN/A
sqrt-unprodN/A
associate-/r/N/A
clear-numN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6442.2%
Applied egg-rr42.2%
if 1.1500000000000001e259 < k Initial program 100.0%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f642.8%
Simplified2.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.7%
Applied egg-rr2.7%
pow1/2N/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-eval31.9%
Applied egg-rr31.9%
(FPCore (k n) :precision binary64 (pow (/ (/ (/ k n) PI) 2.0) -0.5))
double code(double k, double n) {
return pow((((k / n) / ((double) M_PI)) / 2.0), -0.5);
}
public static double code(double k, double n) {
return Math.pow((((k / n) / Math.PI) / 2.0), -0.5);
}
def code(k, n): return math.pow((((k / n) / math.pi) / 2.0), -0.5)
function code(k, n) return Float64(Float64(Float64(k / n) / pi) / 2.0) ^ -0.5 end
function tmp = code(k, n) tmp = (((k / n) / pi) / 2.0) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(N[(k / n), $MachinePrecision] / Pi), $MachinePrecision] / 2.0), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\frac{\frac{k}{n}}{\pi}}{2}\right)}^{-0.5}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6437.9%
Simplified37.9%
sqrt-unprodN/A
div-invN/A
*-commutativeN/A
associate-*l*N/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6451.5%
Applied egg-rr51.5%
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f6451.5%
Applied egg-rr51.5%
*-commutativeN/A
sqrt-unprodN/A
associate-/r/N/A
clear-numN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6438.6%
Applied egg-rr38.6%
(FPCore (k n) :precision binary64 (pow (/ (/ k (* PI n)) 2.0) -0.5))
double code(double k, double n) {
return pow(((k / (((double) M_PI) * n)) / 2.0), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k / (Math.PI * n)) / 2.0), -0.5);
}
def code(k, n): return math.pow(((k / (math.pi * n)) / 2.0), -0.5)
function code(k, n) return Float64(Float64(k / Float64(pi * n)) / 2.0) ^ -0.5 end
function tmp = code(k, n) tmp = ((k / (pi * n)) / 2.0) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\frac{k}{\pi \cdot n}}{2}\right)}^{-0.5}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6437.9%
Simplified37.9%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6438.1%
Applied egg-rr38.1%
clear-numN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
metadata-eval38.6%
Applied egg-rr38.6%
(FPCore (k n) :precision binary64 (sqrt (* n (/ PI (/ k 2.0)))))
double code(double k, double n) {
return sqrt((n * (((double) M_PI) / (k / 2.0))));
}
public static double code(double k, double n) {
return Math.sqrt((n * (Math.PI / (k / 2.0))));
}
def code(k, n): return math.sqrt((n * (math.pi / (k / 2.0))))
function code(k, n) return sqrt(Float64(n * Float64(pi / Float64(k / 2.0)))) end
function tmp = code(k, n) tmp = sqrt((n * (pi / (k / 2.0)))); end
code[k_, n_] := N[Sqrt[N[(n * N[(Pi / N[(k / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \frac{\pi}{\frac{k}{2}}}
\end{array}
Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6437.9%
Simplified37.9%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6438.1%
Applied egg-rr38.1%
associate-/r/N/A
metadata-evalN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l/N/A
metadata-evalN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6438.1%
Applied egg-rr38.1%
herbie shell --seed 2024163
(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))))