
(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 (* n 2.0)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (n * 2.0);
return sqrt(t_0) / sqrt((k * pow(t_0, k)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (n * 2.0);
return Math.sqrt(t_0) / Math.sqrt((k * Math.pow(t_0, k)));
}
def code(k, n): t_0 = math.pi * (n * 2.0) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(pi * Float64(n * 2.0)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = pi * (n * 2.0); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[Sqrt[N[(k * N[Power[t$95$0, k], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(n \cdot 2\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k \cdot {t\_0}^{k}}}
\end{array}
\end{array}
Initial program 99.5%
*-commutativeN/A
un-div-invN/A
div-subN/A
metadata-evalN/A
pow-subN/A
associate-/l/N/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
pow-unpowN/A
unpow1/2N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6499.7
Applied egg-rr99.7%
(FPCore (k n) :precision binary64 (if (<= (* (/ 1.0 (sqrt k)) (pow (* n (* PI 2.0)) (/ (- 1.0 k) 2.0))) 0.0) (sqrt (pow (* k (* k (* k k))) -0.25)) (* (sqrt (* PI (* n 2.0))) (sqrt (/ 1.0 k)))))
double code(double k, double n) {
double tmp;
if (((1.0 / sqrt(k)) * pow((n * (((double) M_PI) * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = sqrt(pow((k * (k * (k * k))), -0.25));
} else {
tmp = sqrt((((double) M_PI) * (n * 2.0))) * sqrt((1.0 / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow((n * (Math.PI * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.sqrt(Math.pow((k * (k * (k * k))), -0.25));
} else {
tmp = Math.sqrt((Math.PI * (n * 2.0))) * Math.sqrt((1.0 / k));
}
return tmp;
}
def code(k, n): tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow((n * (math.pi * 2.0)), ((1.0 - k) / 2.0))) <= 0.0: tmp = math.sqrt(math.pow((k * (k * (k * k))), -0.25)) else: tmp = math.sqrt((math.pi * (n * 2.0))) * math.sqrt((1.0 / k)) return tmp
function code(k, n) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (Float64(n * Float64(pi * 2.0)) ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = sqrt((Float64(k * Float64(k * Float64(k * k))) ^ -0.25)); else tmp = Float64(sqrt(Float64(pi * Float64(n * 2.0))) * sqrt(Float64(1.0 / k))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (((1.0 / sqrt(k)) * ((n * (pi * 2.0)) ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(((k * (k * (k * k))) ^ -0.25)); else tmp = sqrt((pi * (n * 2.0))) * sqrt((1.0 / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[Sqrt[N[Power[N[(k * N[(k * N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.25], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;\sqrt{{\left(k \cdot \left(k \cdot \left(k \cdot k\right)\right)\right)}^{-0.25}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\pi \cdot \left(n \cdot 2\right)} \cdot \sqrt{\frac{1}{k}}\\
\end{array}
\end{array}
if (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) < 0.0Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f643.8
Simplified3.8%
rem-square-sqrtN/A
sqrt-divN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f643.8
Applied egg-rr3.8%
inv-powN/A
sqrt-unprodN/A
sqrt-pow2N/A
rem-square-sqrtN/A
sqrt-unprodN/A
metadata-evalN/A
sqrt-pow2N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-*l*N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
metadata-eval79.4
Applied egg-rr79.4%
if 0.0 < (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) Initial 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.f6450.0
Simplified50.0%
sqrt-unprodN/A
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
sqrt-undivN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6465.4
Applied egg-rr65.4%
Final simplification68.8%
(FPCore (k n) :precision binary64 (if (<= (* (/ 1.0 (sqrt k)) (pow (* n (* PI 2.0)) (/ (- 1.0 k) 2.0))) 0.0) (sqrt (sqrt (/ 1.0 (* k k)))) (* (sqrt (* PI (* n 2.0))) (sqrt (/ 1.0 k)))))
double code(double k, double n) {
double tmp;
if (((1.0 / sqrt(k)) * pow((n * (((double) M_PI) * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = sqrt(sqrt((1.0 / (k * k))));
} else {
tmp = sqrt((((double) M_PI) * (n * 2.0))) * sqrt((1.0 / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow((n * (Math.PI * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.sqrt(Math.sqrt((1.0 / (k * k))));
} else {
tmp = Math.sqrt((Math.PI * (n * 2.0))) * Math.sqrt((1.0 / k));
}
return tmp;
}
def code(k, n): tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow((n * (math.pi * 2.0)), ((1.0 - k) / 2.0))) <= 0.0: tmp = math.sqrt(math.sqrt((1.0 / (k * k)))) else: tmp = math.sqrt((math.pi * (n * 2.0))) * math.sqrt((1.0 / k)) return tmp
function code(k, n) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (Float64(n * Float64(pi * 2.0)) ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt(Float64(1.0 / Float64(k * k)))); else tmp = Float64(sqrt(Float64(pi * Float64(n * 2.0))) * sqrt(Float64(1.0 / k))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (((1.0 / sqrt(k)) * ((n * (pi * 2.0)) ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt((1.0 / (k * k)))); else tmp = sqrt((pi * (n * 2.0))) * sqrt((1.0 / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[Sqrt[N[Sqrt[N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k \cdot k}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\pi \cdot \left(n \cdot 2\right)} \cdot \sqrt{\frac{1}{k}}\\
\end{array}
\end{array}
if (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) < 0.0Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f643.8
Simplified3.8%
rem-square-sqrtN/A
sqrt-divN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f643.8
Applied egg-rr3.8%
pow2N/A
pow-flipN/A
metadata-evalN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6450.9
Applied egg-rr50.9%
if 0.0 < (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) Initial 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.f6450.0
Simplified50.0%
sqrt-unprodN/A
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
sqrt-undivN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6465.4
Applied egg-rr65.4%
Final simplification62.0%
(FPCore (k n) :precision binary64 (if (<= (* (/ 1.0 (sqrt k)) (pow (* n (* PI 2.0)) (/ (- 1.0 k) 2.0))) 0.0) (sqrt (sqrt (/ 1.0 (* k k)))) (/ (sqrt (* PI n)) (sqrt (* k 0.5)))))
double code(double k, double n) {
double tmp;
if (((1.0 / sqrt(k)) * pow((n * (((double) M_PI) * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = sqrt(sqrt((1.0 / (k * k))));
} else {
tmp = sqrt((((double) M_PI) * n)) / sqrt((k * 0.5));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow((n * (Math.PI * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.sqrt(Math.sqrt((1.0 / (k * k))));
} else {
tmp = Math.sqrt((Math.PI * n)) / Math.sqrt((k * 0.5));
}
return tmp;
}
def code(k, n): tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow((n * (math.pi * 2.0)), ((1.0 - k) / 2.0))) <= 0.0: tmp = math.sqrt(math.sqrt((1.0 / (k * k)))) else: tmp = math.sqrt((math.pi * n)) / math.sqrt((k * 0.5)) return tmp
function code(k, n) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (Float64(n * Float64(pi * 2.0)) ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt(Float64(1.0 / Float64(k * k)))); else tmp = Float64(sqrt(Float64(pi * n)) / sqrt(Float64(k * 0.5))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (((1.0 / sqrt(k)) * ((n * (pi * 2.0)) ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt((1.0 / (k * k)))); else tmp = sqrt((pi * n)) / sqrt((k * 0.5)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[Sqrt[N[Sqrt[N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k \cdot k}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot n}}{\sqrt{k \cdot 0.5}}\\
\end{array}
\end{array}
if (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) < 0.0Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f643.8
Simplified3.8%
rem-square-sqrtN/A
sqrt-divN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f643.8
Applied egg-rr3.8%
pow2N/A
pow-flipN/A
metadata-evalN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6450.9
Applied egg-rr50.9%
if 0.0 < (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) Initial 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.f6450.0
Simplified50.0%
sqrt-unprodN/A
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
sqrt-undivN/A
div-invN/A
sqrt-prodN/A
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
div-invN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-undivN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6465.4
Applied egg-rr65.4%
sqrt-unprodN/A
clear-numN/A
un-div-invN/A
sqrt-divN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f64N/A
div-invN/A
metadata-evalN/A
*-lowering-*.f6465.4
Applied egg-rr65.4%
Final simplification62.0%
(FPCore (k n) :precision binary64 (if (<= (* (/ 1.0 (sqrt k)) (pow (* n (* PI 2.0)) (/ (- 1.0 k) 2.0))) 0.0) (sqrt (sqrt (/ 1.0 (* k k)))) (* (sqrt n) (sqrt (* 2.0 (/ PI k))))))
double code(double k, double n) {
double tmp;
if (((1.0 / sqrt(k)) * pow((n * (((double) M_PI) * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = sqrt(sqrt((1.0 / (k * k))));
} else {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow((n * (Math.PI * 2.0)), ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.sqrt(Math.sqrt((1.0 / (k * k))));
} else {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
}
return tmp;
}
def code(k, n): tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow((n * (math.pi * 2.0)), ((1.0 - k) / 2.0))) <= 0.0: tmp = math.sqrt(math.sqrt((1.0 / (k * k)))) else: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) return tmp
function code(k, n) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (Float64(n * Float64(pi * 2.0)) ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt(Float64(1.0 / Float64(k * k)))); else tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (((1.0 / sqrt(k)) * ((n * (pi * 2.0)) ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt((1.0 / (k * k)))); else tmp = sqrt(n) * sqrt((2.0 * (pi / k))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[Sqrt[N[Sqrt[N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k \cdot k}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\end{array}
\end{array}
if (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) < 0.0Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f643.8
Simplified3.8%
rem-square-sqrtN/A
sqrt-divN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f643.8
Applied egg-rr3.8%
pow2N/A
pow-flipN/A
metadata-evalN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6450.9
Applied egg-rr50.9%
if 0.0 < (*.f64 (/.f64 #s(literal 1 binary64) (sqrt.f64 k)) (pow.f64 (*.f64 (*.f64 #s(literal 2 binary64) (PI.f64)) n) (/.f64 (-.f64 #s(literal 1 binary64) k) #s(literal 2 binary64)))) Initial 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.f6450.0
Simplified50.0%
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.f6465.4
Applied egg-rr65.4%
Final simplification62.0%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* PI (* n 2.0))))
(if (<= k 1.0)
(* (sqrt t_0) (sqrt (/ 1.0 k)))
(/ (pow t_0 (* k -0.5)) (sqrt k)))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (n * 2.0);
double tmp;
if (k <= 1.0) {
tmp = sqrt(t_0) * sqrt((1.0 / k));
} else {
tmp = pow(t_0, (k * -0.5)) / sqrt(k);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.PI * (n * 2.0);
double tmp;
if (k <= 1.0) {
tmp = Math.sqrt(t_0) * Math.sqrt((1.0 / k));
} else {
tmp = Math.pow(t_0, (k * -0.5)) / Math.sqrt(k);
}
return tmp;
}
def code(k, n): t_0 = math.pi * (n * 2.0) tmp = 0 if k <= 1.0: tmp = math.sqrt(t_0) * math.sqrt((1.0 / k)) else: tmp = math.pow(t_0, (k * -0.5)) / math.sqrt(k) return tmp
function code(k, n) t_0 = Float64(pi * Float64(n * 2.0)) tmp = 0.0 if (k <= 1.0) tmp = Float64(sqrt(t_0) * sqrt(Float64(1.0 / k))); else tmp = Float64((t_0 ^ Float64(k * -0.5)) / sqrt(k)); end return tmp end
function tmp_2 = code(k, n) t_0 = pi * (n * 2.0); tmp = 0.0; if (k <= 1.0) tmp = sqrt(t_0) * sqrt((1.0 / k)); else tmp = (t_0 ^ (k * -0.5)) / sqrt(k); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.0], N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Power[t$95$0, N[(k * -0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(n \cdot 2\right)\\
\mathbf{if}\;k \leq 1:\\
\;\;\;\;\sqrt{t\_0} \cdot \sqrt{\frac{1}{k}}\\
\mathbf{else}:\\
\;\;\;\;\frac{{t\_0}^{\left(k \cdot -0.5\right)}}{\sqrt{k}}\\
\end{array}
\end{array}
if k < 1Initial 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.f6473.4
Simplified73.4%
sqrt-unprodN/A
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
sqrt-undivN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6496.3
Applied egg-rr96.3%
if 1 < k Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
associate-*r*N/A
pow-lowering-pow.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64100.0
Applied egg-rr100.0%
Final simplification98.1%
(FPCore (k n) :precision binary64 (* (sqrt (/ 1.0 k)) (pow (* n (* PI 2.0)) (fma -0.5 k 0.5))))
double code(double k, double n) {
return sqrt((1.0 / k)) * pow((n * (((double) M_PI) * 2.0)), fma(-0.5, k, 0.5));
}
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * (Float64(n * Float64(pi * 2.0)) ^ fma(-0.5, k, 0.5))) end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(-0.5 * k + 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{k}} \cdot {\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(-0.5, k, 0.5\right)\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
exp-prodN/A
*-commutativeN/A
pow-lowering-pow.f64N/A
rem-exp-logN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
rem-exp-logN/A
*-lowering-*.f64N/A
rem-exp-logN/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sub-negN/A
mul-1-negN/A
Simplified99.6%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* n 2.0)) (fma k -0.5 0.5)) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (n * 2.0)), fma(k, -0.5, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(pi * Float64(n * 2.0)) ^ fma(k, -0.5, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision], N[(k * -0.5 + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(n \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
*-commutativeN/A
un-div-invN/A
div-subN/A
metadata-evalN/A
pow-subN/A
associate-/l/N/A
/-lowering-/.f64N/A
unpow1/2N/A
sqrt-lowering-sqrt.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
Applied egg-rr99.5%
(FPCore (k n) :precision binary64 (if (<= k 0.5) (sqrt (/ (* PI (* n 2.0)) k)) (sqrt (sqrt (/ 1.0 (* k k))))))
double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = sqrt(((((double) M_PI) * (n * 2.0)) / k));
} else {
tmp = sqrt(sqrt((1.0 / (k * k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 0.5) {
tmp = Math.sqrt(((Math.PI * (n * 2.0)) / k));
} else {
tmp = Math.sqrt(Math.sqrt((1.0 / (k * k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 0.5: tmp = math.sqrt(((math.pi * (n * 2.0)) / k)) else: tmp = math.sqrt(math.sqrt((1.0 / (k * k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 0.5) tmp = sqrt(Float64(Float64(pi * Float64(n * 2.0)) / k)); else tmp = sqrt(sqrt(Float64(1.0 / Float64(k * k)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 0.5) tmp = sqrt(((pi * (n * 2.0)) / k)); else tmp = sqrt(sqrt((1.0 / (k * k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 0.5], N[Sqrt[N[(N[(Pi * N[(n * 2.0), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Sqrt[N[(1.0 / N[(k * k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 0.5:\\
\;\;\;\;\sqrt{\frac{\pi \cdot \left(n \cdot 2\right)}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k \cdot k}}}\\
\end{array}
\end{array}
if k < 0.5Initial 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.f6473.4
Simplified73.4%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6473.0
Applied egg-rr73.0%
if 0.5 < k Initial program 100.0%
Taylor expanded in k around inf
*-lowering-*.f64100.0
Simplified100.0%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f643.2
Simplified3.2%
rem-square-sqrtN/A
sqrt-divN/A
metadata-evalN/A
sqrt-divN/A
metadata-evalN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f643.2
Applied egg-rr3.2%
pow2N/A
pow-flipN/A
metadata-evalN/A
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
sqrt-pow2N/A
metadata-evalN/A
inv-powN/A
frac-timesN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6425.9
Applied egg-rr25.9%
(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 * Float64(n * 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[(n * 2.0), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi \cdot \left(n \cdot 2\right)}{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.f6438.8
Simplified38.8%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-*l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6438.6
Applied egg-rr38.6%
(FPCore (k n) :precision binary64 (sqrt (/ 1.0 k)))
double code(double k, double n) {
return sqrt((1.0 / k));
}
real(8) function code(k, n)
real(8), intent (in) :: k
real(8), intent (in) :: n
code = sqrt((1.0d0 / k))
end function
public static double code(double k, double n) {
return Math.sqrt((1.0 / k));
}
def code(k, n): return math.sqrt((1.0 / k))
function code(k, n) return sqrt(Float64(1.0 / k)) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)); end
code[k_, n_] := N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around inf
*-lowering-*.f6452.5
Simplified52.5%
Taylor expanded in k around 0
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f645.2
Simplified5.2%
herbie shell --seed 2024196
(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))))