
(FPCore (k n) :precision binary64 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return (1.0 / sqrt(k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return (1.0 / Math.sqrt(k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return (1.0 / math.sqrt(k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(Float64(1.0 / sqrt(k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (1.0 / sqrt(k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (k n) :precision binary64 (* (/ 1.0 (sqrt k)) (pow (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return (1.0 / sqrt(k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return (1.0 / Math.sqrt(k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return (1.0 / math.sqrt(k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(Float64(1.0 / sqrt(k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = (1.0 / sqrt(k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
(FPCore (k n) :precision binary64 (let* ((t_0 (* PI (* 2.0 n)))) (/ (sqrt t_0) (pow (* k (pow t_0 k)) 0.5))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return sqrt(t_0) / pow((k * pow(t_0, k)), 0.5);
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.sqrt(t_0) / Math.pow((k * Math.pow(t_0, k)), 0.5);
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / math.pow((k * math.pow(t_0, k)), 0.5)
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / (Float64(k * (t_0 ^ k)) ^ 0.5)) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / ((k * (t_0 ^ k)) ^ 0.5); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Power[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\frac{\sqrt{t\_0}}{{\left(k \cdot {t\_0}^{k}\right)}^{0.5}}
\end{array}
\end{array}
Initial program 99.5%
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.5%
Simplified99.5%
remove-double-divN/A
/-lowering-/.f64N/A
inv-powN/A
pow1/2N/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-eval99.5%
Applied egg-rr99.5%
pow-flipN/A
metadata-evalN/A
metadata-evalN/A
pow-powN/A
pow-subN/A
associate-/l/N/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
Applied egg-rr99.7%
Final simplification99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 3.2e+200)
(* (pow (* 2.0 n) 0.5) (sqrt (/ PI k)))
(pow (* (* t_0 t_0) 0.25) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 3.2e+200) {
tmp = pow((2.0 * n), 0.5) * sqrt((((double) M_PI) / k));
} else {
tmp = pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 3.2e+200) {
tmp = Math.pow((2.0 * n), 0.5) * Math.sqrt((Math.PI / k));
} else {
tmp = Math.pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 3.2e+200: tmp = math.pow((2.0 * n), 0.5) * math.sqrt((math.pi / k)) else: tmp = math.pow(((t_0 * t_0) * 0.25), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 3.2e+200) tmp = Float64((Float64(2.0 * n) ^ 0.5) * sqrt(Float64(pi / k))); else tmp = Float64(Float64(t_0 * t_0) * 0.25) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 3.2e+200) tmp = ((2.0 * n) ^ 0.5) * sqrt((pi / k)); else tmp = ((t_0 * t_0) * 0.25) ^ -0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 3.2e+200], N[(N[Power[N[(2.0 * n), $MachinePrecision], 0.5], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 0.25), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 3.2 \cdot 10^{+200}:\\
\;\;\;\;{\left(2 \cdot n\right)}^{0.5} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(t\_0 \cdot t\_0\right) \cdot 0.25\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 3.20000000000000031e200Initial program 99.3%
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.f6455.1%
Simplified55.1%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6455.2%
Applied egg-rr55.2%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6455.2%
Applied egg-rr55.2%
associate-*r/N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6469.2%
Applied egg-rr69.2%
if 3.20000000000000031e200 < 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.7%
Simplified2.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.6%
Applied egg-rr2.6%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.7%
Applied egg-rr2.7%
pow1/2N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*r*N/A
*-commutativeN/A
clear-numN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr14.6%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 1.6e+200)
(/ (sqrt (* PI (* 2.0 n))) (sqrt k))
(pow (* (* t_0 t_0) 0.25) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 1.6e+200) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 1.6e+200) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = Math.pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 1.6e+200: tmp = math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k) else: tmp = math.pow(((t_0 * t_0) * 0.25), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 1.6e+200) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = Float64(Float64(t_0 * t_0) * 0.25) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 1.6e+200) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); else tmp = ((t_0 * t_0) * 0.25) ^ -0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.6e+200], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 0.25), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 1.6 \cdot 10^{+200}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(t\_0 \cdot t\_0\right) \cdot 0.25\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 1.60000000000000016e200Initial program 99.3%
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.f6455.1%
Simplified55.1%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
sqrt-divN/A
unpow1/2N/A
pow1/2N/A
metadata-evalN/A
pow-powN/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
pow-powN/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f6469.2%
Applied egg-rr69.2%
if 1.60000000000000016e200 < 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.7%
Simplified2.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.6%
Applied egg-rr2.6%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.7%
Applied egg-rr2.7%
pow1/2N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*r*N/A
*-commutativeN/A
clear-numN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr14.6%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 1.25e+199)
(* (sqrt n) (sqrt (* 2.0 (/ PI k))))
(pow (* (* t_0 t_0) 0.25) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 1.25e+199) {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
} else {
tmp = pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 1.25e+199) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
} else {
tmp = Math.pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 1.25e+199: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) else: tmp = math.pow(((t_0 * t_0) * 0.25), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 1.25e+199) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); else tmp = Float64(Float64(t_0 * t_0) * 0.25) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 1.25e+199) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); else tmp = ((t_0 * t_0) * 0.25) ^ -0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.25e+199], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 0.25), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 1.25 \cdot 10^{+199}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(t\_0 \cdot t\_0\right) \cdot 0.25\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 1.25e199Initial program 99.3%
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.f6455.1%
Simplified55.1%
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.f6469.2%
Applied egg-rr69.2%
if 1.25e199 < 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.7%
Simplified2.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.6%
Applied egg-rr2.6%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.7%
Applied egg-rr2.7%
pow1/2N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*r*N/A
*-commutativeN/A
clear-numN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr14.6%
Final simplification58.9%
(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.5%
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.5%
Simplified99.5%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 1.7e+200)
(pow (/ k (* n (* PI 2.0))) -0.5)
(pow (* (* t_0 t_0) 0.25) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 1.7e+200) {
tmp = pow((k / (n * (((double) M_PI) * 2.0))), -0.5);
} else {
tmp = pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 1.7e+200) {
tmp = Math.pow((k / (n * (Math.PI * 2.0))), -0.5);
} else {
tmp = Math.pow(((t_0 * t_0) * 0.25), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 1.7e+200: tmp = math.pow((k / (n * (math.pi * 2.0))), -0.5) else: tmp = math.pow(((t_0 * t_0) * 0.25), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 1.7e+200) tmp = Float64(k / Float64(n * Float64(pi * 2.0))) ^ -0.5; else tmp = Float64(Float64(t_0 * t_0) * 0.25) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 1.7e+200) tmp = (k / (n * (pi * 2.0))) ^ -0.5; else tmp = ((t_0 * t_0) * 0.25) ^ -0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.7e+200], N[Power[N[(k / N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 0.25), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 1.7 \cdot 10^{+200}:\\
\;\;\;\;{\left(\frac{k}{n \cdot \left(\pi \cdot 2\right)}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(t\_0 \cdot t\_0\right) \cdot 0.25\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 1.69999999999999985e200Initial program 99.3%
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.f6455.1%
Simplified55.1%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6455.2%
Applied egg-rr55.2%
clear-numN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6456.0%
Applied egg-rr56.0%
if 1.69999999999999985e200 < 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.7%
Simplified2.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f642.6%
Applied egg-rr2.6%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.7%
Applied egg-rr2.7%
pow1/2N/A
*-commutativeN/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*r*N/A
*-commutativeN/A
clear-numN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr14.6%
(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(k / Float64(n * Float64(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[(k / N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{n \cdot \left(\pi \cdot 2\right)}\right)}^{-0.5}
\end{array}
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.f6445.3%
Simplified45.3%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
clear-numN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6446.0%
Applied egg-rr46.0%
(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.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.f6445.3%
Simplified45.3%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
clear-numN/A
associate-*l/N/A
*-un-lft-identityN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6445.4%
Applied egg-rr45.4%
Final simplification45.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 * 2.0) * Float64(n / k))) end
function tmp = code(k, n) tmp = sqrt(((pi * 2.0) * (n / k))); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * 2.0), $MachinePrecision] * N[(n / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\pi \cdot 2\right) \cdot \frac{n}{k}}
\end{array}
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.f6445.3%
Simplified45.3%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
div-invN/A
clear-numN/A
associate-*r/N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
Final simplification45.4%
(FPCore (k n) :precision binary64 (sqrt (* (* PI n) (/ 2.0 k))))
double code(double k, double n) {
return sqrt(((((double) M_PI) * n) * (2.0 / k)));
}
public static double code(double k, double n) {
return Math.sqrt(((Math.PI * n) * (2.0 / k)));
}
def code(k, n): return math.sqrt(((math.pi * n) * (2.0 / k)))
function code(k, n) return sqrt(Float64(Float64(pi * n) * Float64(2.0 / k))) end
function tmp = code(k, n) tmp = sqrt(((pi * n) * (2.0 / k))); end
code[k_, n_] := N[Sqrt[N[(N[(Pi * n), $MachinePrecision] * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\pi \cdot n\right) \cdot \frac{2}{k}}
\end{array}
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.f6445.3%
Simplified45.3%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
Final simplification45.4%
(FPCore (k n) :precision binary64 (sqrt (* PI (* n (/ 2.0 k)))))
double code(double k, double n) {
return sqrt((((double) M_PI) * (n * (2.0 / k))));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (n * (2.0 / k))));
}
def code(k, n): return math.sqrt((math.pi * (n * (2.0 / k))))
function code(k, n) return sqrt(Float64(pi * Float64(n * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt((pi * (n * (2.0 / k)))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(n * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \left(n \cdot \frac{2}{k}\right)}
\end{array}
Initial program 99.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.f6445.3%
Simplified45.3%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6445.4%
Applied egg-rr45.4%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6445.3%
Applied egg-rr45.3%
Final simplification45.3%
herbie shell --seed 2024161
(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))))