
(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 10 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 (if (<= k 1.1e-56) (* (sqrt (* 2.0 n)) (sqrt (/ PI k))) (sqrt (/ (pow (* n (* 2.0 PI)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.1e-56) {
tmp = sqrt((2.0 * n)) * sqrt((((double) M_PI) / k));
} else {
tmp = sqrt((pow((n * (2.0 * ((double) M_PI))), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.1e-56) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((Math.PI / k));
} else {
tmp = Math.sqrt((Math.pow((n * (2.0 * Math.PI)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.1e-56: tmp = math.sqrt((2.0 * n)) * math.sqrt((math.pi / k)) else: tmp = math.sqrt((math.pow((n * (2.0 * math.pi)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.1e-56) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(pi / k))); else tmp = sqrt(Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.1e-56) tmp = sqrt((2.0 * n)) * sqrt((pi / k)); else tmp = sqrt((((n * (2.0 * pi)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.1e-56], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.1 \cdot 10^{-56}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{\frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.10000000000000002e-56Initial program 99.2%
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.f6474.9%
Simplified74.9%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6475.1%
Applied egg-rr75.1%
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6475.0%
Applied egg-rr75.0%
*-commutativeN/A
associate-*l/N/A
*-commutativeN/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
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6499.5%
Applied egg-rr99.5%
if 1.10000000000000002e-56 < k Initial program 99.8%
associate-*r*N/A
div-subN/A
metadata-evalN/A
*-commutativeN/A
pow-subN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
Applied egg-rr99.9%
pow1/2N/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
associate-/l*N/A
associate-/r/N/A
*-commutativeN/A
unpow-prod-downN/A
pow1/2N/A
pow-powN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
associate-/l*N/A
associate-/r/N/A
Applied egg-rr99.8%
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
un-div-invN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
--lowering--.f6499.9%
Applied egg-rr99.9%
Final simplification99.7%
(FPCore (k n) :precision binary64 (let* ((t_0 (* 2.0 (* PI n)))) (/ (sqrt t_0) (pow (* k (pow t_0 k)) 0.5))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
return sqrt(t_0) / pow((k * pow(t_0, k)), 0.5);
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
return Math.sqrt(t_0) / Math.pow((k * Math.pow(t_0, k)), 0.5);
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return math.sqrt(t_0) / math.pow((k * math.pow(t_0, k)), 0.5)
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(sqrt(t_0) / (Float64(k * (t_0 ^ k)) ^ 0.5)) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = sqrt(t_0) / ((k * (t_0 ^ k)) ^ 0.5); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * 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 := 2 \cdot \left(\pi \cdot n\right)\\
\frac{\sqrt{t\_0}}{{\left(k \cdot {t\_0}^{k}\right)}^{0.5}}
\end{array}
\end{array}
Initial program 99.6%
associate-*r*N/A
div-subN/A
metadata-evalN/A
*-commutativeN/A
pow-subN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
Applied egg-rr99.7%
Final simplification99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 5.5e+183)
(* (pow (/ k PI) -0.5) (pow (* 2.0 n) 0.5))
(pow (/ (* t_0 t_0) 4.0) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 5.5e+183) {
tmp = pow((k / ((double) M_PI)), -0.5) * pow((2.0 * n), 0.5);
} else {
tmp = pow(((t_0 * t_0) / 4.0), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 5.5e+183) {
tmp = Math.pow((k / Math.PI), -0.5) * Math.pow((2.0 * n), 0.5);
} else {
tmp = Math.pow(((t_0 * t_0) / 4.0), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 5.5e+183: tmp = math.pow((k / math.pi), -0.5) * math.pow((2.0 * n), 0.5) else: tmp = math.pow(((t_0 * t_0) / 4.0), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 5.5e+183) tmp = Float64((Float64(k / pi) ^ -0.5) * (Float64(2.0 * n) ^ 0.5)); else tmp = Float64(Float64(t_0 * t_0) / 4.0) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 5.5e+183) tmp = ((k / pi) ^ -0.5) * ((2.0 * n) ^ 0.5); else tmp = ((t_0 * t_0) / 4.0) ^ -0.25; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 5.5e+183], N[(N[Power[N[(k / Pi), $MachinePrecision], -0.5], $MachinePrecision] * N[Power[N[(2.0 * n), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 4.0), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 5.5 \cdot 10^{+183}:\\
\;\;\;\;{\left(\frac{k}{\pi}\right)}^{-0.5} \cdot {\left(2 \cdot n\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{t\_0 \cdot t\_0}{4}\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 5.5e183Initial 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.f6446.2%
Simplified46.2%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6446.3%
Applied egg-rr46.3%
sqrt-divN/A
sqrt-prodN/A
pow1/2N/A
associate-*l/N/A
sqrt-divN/A
pow1/2N/A
*-lowering-*.f64N/A
clear-numN/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
pow-lowering-pow.f64N/A
*-lowering-*.f6457.1%
Applied egg-rr57.1%
if 5.5e183 < 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
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f642.7%
Applied egg-rr2.7%
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f642.7%
Applied egg-rr2.7%
pow1/2N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*l/N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
clear-numN/A
associate-/r*N/A
*-commutativeN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr16.1%
Final simplification47.9%
(FPCore (k n) :precision binary64 (/ (pow (/ (* PI -2.0) (/ -1.0 n)) (- 0.5 (* k 0.5))) (sqrt k)))
double code(double k, double n) {
return pow(((((double) M_PI) * -2.0) / (-1.0 / n)), (0.5 - (k * 0.5))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow(((Math.PI * -2.0) / (-1.0 / n)), (0.5 - (k * 0.5))) / Math.sqrt(k);
}
def code(k, n): return math.pow(((math.pi * -2.0) / (-1.0 / n)), (0.5 - (k * 0.5))) / math.sqrt(k)
function code(k, n) return Float64((Float64(Float64(pi * -2.0) / Float64(-1.0 / n)) ^ Float64(0.5 - Float64(k * 0.5))) / sqrt(k)) end
function tmp = code(k, n) tmp = (((pi * -2.0) / (-1.0 / n)) ^ (0.5 - (k * 0.5))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(N[(Pi * -2.0), $MachinePrecision] / N[(-1.0 / n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\frac{\pi \cdot -2}{\frac{-1}{n}}\right)}^{\left(0.5 - k \cdot 0.5\right)}}{\sqrt{k}}
\end{array}
Initial program 99.6%
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%
Taylor expanded in n around -inf
exp-prodN/A
pow-lowering-pow.f64N/A
mul-1-negN/A
unsub-negN/A
exp-diffN/A
/-lowering-/.f64N/A
rem-exp-logN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
rem-exp-logN/A
/-lowering-/.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f6499.7%
Simplified99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 1.4e+184)
(* (sqrt n) (sqrt (* PI (/ 2.0 k))))
(pow (/ (* t_0 t_0) 4.0) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 1.4e+184) {
tmp = sqrt(n) * sqrt((((double) M_PI) * (2.0 / k)));
} else {
tmp = pow(((t_0 * t_0) / 4.0), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 1.4e+184) {
tmp = Math.sqrt(n) * Math.sqrt((Math.PI * (2.0 / k)));
} else {
tmp = Math.pow(((t_0 * t_0) / 4.0), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 1.4e+184: tmp = math.sqrt(n) * math.sqrt((math.pi * (2.0 / k))) else: tmp = math.pow(((t_0 * t_0) / 4.0), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 1.4e+184) tmp = Float64(sqrt(n) * sqrt(Float64(pi * Float64(2.0 / k)))); else tmp = Float64(Float64(t_0 * t_0) / 4.0) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 1.4e+184) tmp = sqrt(n) * sqrt((pi * (2.0 / k))); else tmp = ((t_0 * t_0) / 4.0) ^ -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.4e+184], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 4.0), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 1.4 \cdot 10^{+184}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\pi \cdot \frac{2}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{t\_0 \cdot t\_0}{4}\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 1.39999999999999995e184Initial 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.f6446.2%
Simplified46.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.f6457.0%
Applied egg-rr57.0%
clear-numN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6457.1%
Applied egg-rr57.1%
if 1.39999999999999995e184 < 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
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f642.7%
Applied egg-rr2.7%
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f642.7%
Applied egg-rr2.7%
pow1/2N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*l/N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
clear-numN/A
associate-/r*N/A
*-commutativeN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr16.1%
Final simplification47.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.6%
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%
(FPCore (k n)
:precision binary64
(let* ((t_0 (/ k (* PI n))))
(if (<= k 1.22e+182)
(pow (/ k (* PI (* 2.0 n))) -0.5)
(pow (/ (* t_0 t_0) 4.0) -0.25))))
double code(double k, double n) {
double t_0 = k / (((double) M_PI) * n);
double tmp;
if (k <= 1.22e+182) {
tmp = pow((k / (((double) M_PI) * (2.0 * n))), -0.5);
} else {
tmp = pow(((t_0 * t_0) / 4.0), -0.25);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = k / (Math.PI * n);
double tmp;
if (k <= 1.22e+182) {
tmp = Math.pow((k / (Math.PI * (2.0 * n))), -0.5);
} else {
tmp = Math.pow(((t_0 * t_0) / 4.0), -0.25);
}
return tmp;
}
def code(k, n): t_0 = k / (math.pi * n) tmp = 0 if k <= 1.22e+182: tmp = math.pow((k / (math.pi * (2.0 * n))), -0.5) else: tmp = math.pow(((t_0 * t_0) / 4.0), -0.25) return tmp
function code(k, n) t_0 = Float64(k / Float64(pi * n)) tmp = 0.0 if (k <= 1.22e+182) tmp = Float64(k / Float64(pi * Float64(2.0 * n))) ^ -0.5; else tmp = Float64(Float64(t_0 * t_0) / 4.0) ^ -0.25; end return tmp end
function tmp_2 = code(k, n) t_0 = k / (pi * n); tmp = 0.0; if (k <= 1.22e+182) tmp = (k / (pi * (2.0 * n))) ^ -0.5; else tmp = ((t_0 * t_0) / 4.0) ^ -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.22e+182], N[Power[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision], N[Power[N[(N[(t$95$0 * t$95$0), $MachinePrecision] / 4.0), $MachinePrecision], -0.25], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{k}{\pi \cdot n}\\
\mathbf{if}\;k \leq 1.22 \cdot 10^{+182}:\\
\;\;\;\;{\left(\frac{k}{\pi \cdot \left(2 \cdot n\right)}\right)}^{-0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{t\_0 \cdot t\_0}{4}\right)}^{-0.25}\\
\end{array}
\end{array}
if k < 1.22e182Initial 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.f6446.4%
Simplified46.4%
*-commutativeN/A
sqrt-divN/A
associate-/l*N/A
clear-numN/A
inv-powN/A
*-commutativeN/A
sqrt-prodN/A
sqrt-undivN/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
metadata-eval46.8%
Applied egg-rr46.8%
if 1.22e182 < 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
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f642.7%
Applied egg-rr2.7%
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f642.7%
Applied egg-rr2.7%
pow1/2N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
associate-*l/N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
clear-numN/A
associate-/r*N/A
*-commutativeN/A
sqr-powN/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
Applied egg-rr15.8%
Final simplification39.8%
(FPCore (k n) :precision binary64 (pow (/ k (* PI (* 2.0 n))) -0.5))
double code(double k, double n) {
return pow((k / (((double) M_PI) * (2.0 * n))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k / (Math.PI * (2.0 * n))), -0.5);
}
def code(k, n): return math.pow((k / (math.pi * (2.0 * n))), -0.5)
function code(k, n) return Float64(k / Float64(pi * Float64(2.0 * n))) ^ -0.5 end
function tmp = code(k, n) tmp = (k / (pi * (2.0 * n))) ^ -0.5; end
code[k_, n_] := N[Power[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{\pi \cdot \left(2 \cdot n\right)}\right)}^{-0.5}
\end{array}
Initial program 99.6%
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.f6436.5%
Simplified36.5%
*-commutativeN/A
sqrt-divN/A
associate-/l*N/A
clear-numN/A
inv-powN/A
*-commutativeN/A
sqrt-prodN/A
sqrt-undivN/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
metadata-eval36.8%
Applied egg-rr36.8%
Final simplification36.8%
(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.6%
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.f6436.5%
Simplified36.5%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6436.6%
Applied egg-rr36.6%
Final simplification36.6%
(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 99.6%
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.f6436.5%
Simplified36.5%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6436.6%
Applied egg-rr36.6%
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6436.6%
Applied egg-rr36.6%
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6436.6%
Applied egg-rr36.6%
Final simplification36.6%
herbie shell --seed 2024162
(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))))