
(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 (* (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
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-*l*N/A
exp-prodN/A
*-commutativeN/A
lower-pow.f64N/A
rem-exp-logN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
rem-exp-logN/A
lower-*.f64N/A
rem-exp-logN/A
*-commutativeN/A
lower-*.f64N/A
lower-PI.f64N/A
sub-negN/A
mul-1-negN/A
Simplified99.6%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* n (* PI 2.0))))
(if (<= (* (/ 1.0 (sqrt k)) (pow t_0 (/ (- 1.0 k) 2.0))) 0.0)
(pow (* k (* k (* k k))) -0.125)
(* (sqrt (/ 1.0 k)) (sqrt t_0)))))
double code(double k, double n) {
double t_0 = n * (((double) M_PI) * 2.0);
double tmp;
if (((1.0 / sqrt(k)) * pow(t_0, ((1.0 - k) / 2.0))) <= 0.0) {
tmp = pow((k * (k * (k * k))), -0.125);
} else {
tmp = sqrt((1.0 / k)) * sqrt(t_0);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = n * (Math.PI * 2.0);
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow(t_0, ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.pow((k * (k * (k * k))), -0.125);
} else {
tmp = Math.sqrt((1.0 / k)) * Math.sqrt(t_0);
}
return tmp;
}
def code(k, n): t_0 = n * (math.pi * 2.0) tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow(t_0, ((1.0 - k) / 2.0))) <= 0.0: tmp = math.pow((k * (k * (k * k))), -0.125) else: tmp = math.sqrt((1.0 / k)) * math.sqrt(t_0) return tmp
function code(k, n) t_0 = Float64(n * Float64(pi * 2.0)) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (t_0 ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = Float64(k * Float64(k * Float64(k * k))) ^ -0.125; else tmp = Float64(sqrt(Float64(1.0 / k)) * sqrt(t_0)); end return tmp end
function tmp_2 = code(k, n) t_0 = n * (pi * 2.0); tmp = 0.0; if (((1.0 / sqrt(k)) * (t_0 ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = (k * (k * (k * k))) ^ -0.125; else tmp = sqrt((1.0 / k)) * sqrt(t_0); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[t$95$0, N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[Power[N[(k * N[(k * N[(k * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.125], $MachinePrecision], N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := n \cdot \left(\pi \cdot 2\right)\\
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {t\_0}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;{\left(k \cdot \left(k \cdot \left(k \cdot k\right)\right)\right)}^{-0.125}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{k}} \cdot \sqrt{t\_0}\\
\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
lower-*.f6498.3
Simplified98.3%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.8
Simplified3.8%
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lower-/.f643.8
Applied egg-rr3.8%
pow1/2N/A
pow-flipN/A
metadata-evalN/A
sqr-powN/A
unpow-prod-downN/A
lift-*.f64N/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-sqrN/A
pow-prod-downN/A
lower-pow.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
cube-multN/A
lower-*.f64N/A
cube-multN/A
lift-*.f64N/A
lower-*.f64N/A
metadata-eval73.3
Applied egg-rr73.3%
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.4%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6450.1
Simplified50.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-divN/A
unpow1/2N/A
lift-pow.f64N/A
lift-sqrt.f64N/A
*-lft-identityN/A
associate-*l/N/A
Applied egg-rr65.8%
Final simplification67.5%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* n (* PI 2.0))))
(if (<= (* (/ 1.0 (sqrt k)) (pow t_0 (/ (- 1.0 k) 2.0))) 0.0)
(sqrt (sqrt (/ 1.0 (* k k))))
(* (sqrt (/ 1.0 k)) (sqrt t_0)))))
double code(double k, double n) {
double t_0 = n * (((double) M_PI) * 2.0);
double tmp;
if (((1.0 / sqrt(k)) * pow(t_0, ((1.0 - k) / 2.0))) <= 0.0) {
tmp = sqrt(sqrt((1.0 / (k * k))));
} else {
tmp = sqrt((1.0 / k)) * sqrt(t_0);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = n * (Math.PI * 2.0);
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow(t_0, ((1.0 - k) / 2.0))) <= 0.0) {
tmp = Math.sqrt(Math.sqrt((1.0 / (k * k))));
} else {
tmp = Math.sqrt((1.0 / k)) * Math.sqrt(t_0);
}
return tmp;
}
def code(k, n): t_0 = n * (math.pi * 2.0) tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow(t_0, ((1.0 - k) / 2.0))) <= 0.0: tmp = math.sqrt(math.sqrt((1.0 / (k * k)))) else: tmp = math.sqrt((1.0 / k)) * math.sqrt(t_0) return tmp
function code(k, n) t_0 = Float64(n * Float64(pi * 2.0)) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (t_0 ^ Float64(Float64(1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt(Float64(1.0 / Float64(k * k)))); else tmp = Float64(sqrt(Float64(1.0 / k)) * sqrt(t_0)); end return tmp end
function tmp_2 = code(k, n) t_0 = n * (pi * 2.0); tmp = 0.0; if (((1.0 / sqrt(k)) * (t_0 ^ ((1.0 - k) / 2.0))) <= 0.0) tmp = sqrt(sqrt((1.0 / (k * k)))); else tmp = sqrt((1.0 / k)) * sqrt(t_0); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[t$95$0, 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[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := n \cdot \left(\pi \cdot 2\right)\\
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {t\_0}^{\left(\frac{1 - k}{2}\right)} \leq 0:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k \cdot k}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{k}} \cdot \sqrt{t\_0}\\
\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
lower-*.f6498.3
Simplified98.3%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.8
Simplified3.8%
lift-/.f643.8
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.8
Applied egg-rr3.8%
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f643.8
rem-square-sqrtN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
frac-timesN/A
metadata-evalN/A
lift-*.f64N/A
lower-/.f6445.1
Applied egg-rr45.1%
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.4%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6450.1
Simplified50.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-divN/A
unpow1/2N/A
lift-pow.f64N/A
lift-sqrt.f64N/A
*-lft-identityN/A
associate-*l/N/A
Applied egg-rr65.8%
Final simplification61.1%
(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 (/ 2.0 k)) (sqrt (* n PI)))))
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((2.0 / k)) * sqrt((n * ((double) M_PI)));
}
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((2.0 / k)) * Math.sqrt((n * Math.PI));
}
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((2.0 / k)) * math.sqrt((n * math.pi)) 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(2.0 / k)) * sqrt(Float64(n * pi))); 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((2.0 / k)) * sqrt((n * pi)); 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[(2.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * Pi), $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{\frac{2}{k}} \cdot \sqrt{n \cdot \pi}\\
\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
lower-*.f6498.3
Simplified98.3%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.8
Simplified3.8%
lift-/.f643.8
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.8
Applied egg-rr3.8%
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f643.8
rem-square-sqrtN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
frac-timesN/A
metadata-evalN/A
lift-*.f64N/A
lower-/.f6445.1
Applied egg-rr45.1%
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.4%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6450.1
Simplified50.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-divN/A
unpow1/2N/A
lift-pow.f64N/A
lift-sqrt.f64N/A
un-div-invN/A
lift-/.f64N/A
Applied egg-rr49.9%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-/.f64N/A
associate-/l*N/A
*-commutativeN/A
lift-*.f64N/A
clear-numN/A
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
associate-/r/N/A
sqrt-prodN/A
lower-*.f64N/A
Applied egg-rr65.8%
Final simplification61.1%
(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
lower-*.f6498.3
Simplified98.3%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.8
Simplified3.8%
lift-/.f643.8
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.8
Applied egg-rr3.8%
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f643.8
rem-square-sqrtN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
frac-timesN/A
metadata-evalN/A
lift-*.f64N/A
lower-/.f6445.1
Applied egg-rr45.1%
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.4%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6450.1
Simplified50.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
associate-*l*N/A
sqrt-prodN/A
unpow1/2N/A
lower-*.f64N/A
unpow1/2N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f6465.8
Applied egg-rr65.8%
Final simplification61.1%
(FPCore (k n)
:precision binary64
(let* ((t_0 (* n (* PI 2.0))))
(if (<= k 1.0)
(* (sqrt (/ 1.0 k)) (sqrt t_0))
(/ (pow t_0 (* k -0.5)) (sqrt k)))))
double code(double k, double n) {
double t_0 = n * (((double) M_PI) * 2.0);
double tmp;
if (k <= 1.0) {
tmp = sqrt((1.0 / k)) * sqrt(t_0);
} else {
tmp = pow(t_0, (k * -0.5)) / sqrt(k);
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = n * (Math.PI * 2.0);
double tmp;
if (k <= 1.0) {
tmp = Math.sqrt((1.0 / k)) * Math.sqrt(t_0);
} else {
tmp = Math.pow(t_0, (k * -0.5)) / Math.sqrt(k);
}
return tmp;
}
def code(k, n): t_0 = n * (math.pi * 2.0) tmp = 0 if k <= 1.0: tmp = math.sqrt((1.0 / k)) * math.sqrt(t_0) else: tmp = math.pow(t_0, (k * -0.5)) / math.sqrt(k) return tmp
function code(k, n) t_0 = Float64(n * Float64(pi * 2.0)) tmp = 0.0 if (k <= 1.0) tmp = Float64(sqrt(Float64(1.0 / k)) * sqrt(t_0)); else tmp = Float64((t_0 ^ Float64(k * -0.5)) / sqrt(k)); end return tmp end
function tmp_2 = code(k, n) t_0 = n * (pi * 2.0); tmp = 0.0; if (k <= 1.0) tmp = sqrt((1.0 / k)) * sqrt(t_0); else tmp = (t_0 ^ (k * -0.5)) / sqrt(k); end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, 1.0], N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $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 := n \cdot \left(\pi \cdot 2\right)\\
\mathbf{if}\;k \leq 1:\\
\;\;\;\;\sqrt{\frac{1}{k}} \cdot \sqrt{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{{t\_0}^{\left(k \cdot -0.5\right)}}{\sqrt{k}}\\
\end{array}
\end{array}
if k < 1Initial program 99.1%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6473.1
Simplified73.1%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
sqrt-divN/A
unpow1/2N/A
lift-pow.f64N/A
lift-sqrt.f64N/A
*-lft-identityN/A
associate-*l/N/A
Applied egg-rr96.2%
if 1 < k Initial program 100.0%
Taylor expanded in k around inf
lower-*.f6499.2
Simplified99.2%
lift-sqrt.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f6499.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f6499.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6499.2
Applied egg-rr99.2%
(FPCore (k n) :precision binary64 (/ (pow (* n (* PI 2.0)) (fma k -0.5 0.5)) (sqrt k)))
double code(double k, double n) {
return pow((n * (((double) M_PI) * 2.0)), fma(k, -0.5, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(n * Float64(pi * 2.0)) ^ fma(k, -0.5, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision], N[(k * -0.5 + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-*l*N/A
exp-prodN/A
*-commutativeN/A
lower-pow.f64N/A
rem-exp-logN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
rem-exp-logN/A
lower-*.f64N/A
rem-exp-logN/A
*-commutativeN/A
lower-*.f64N/A
lower-PI.f64N/A
sub-negN/A
mul-1-negN/A
Simplified99.6%
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f6499.6
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6499.6
Applied egg-rr99.6%
(FPCore (k n) :precision binary64 (if (<= k 0.49) (sqrt (/ (* n (* PI 2.0)) k)) (sqrt (sqrt (/ 1.0 (* k k))))))
double code(double k, double n) {
double tmp;
if (k <= 0.49) {
tmp = sqrt(((n * (((double) M_PI) * 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.49) {
tmp = Math.sqrt(((n * (Math.PI * 2.0)) / k));
} else {
tmp = Math.sqrt(Math.sqrt((1.0 / (k * k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 0.49: tmp = math.sqrt(((n * (math.pi * 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.49) tmp = sqrt(Float64(Float64(n * Float64(pi * 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.49) tmp = sqrt(((n * (pi * 2.0)) / k)); else tmp = sqrt(sqrt((1.0 / (k * k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 0.49], N[Sqrt[N[(N[(n * N[(Pi * 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.49:\\
\;\;\;\;\sqrt{\frac{n \cdot \left(\pi \cdot 2\right)}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k \cdot k}}}\\
\end{array}
\end{array}
if k < 0.48999999999999999Initial program 99.1%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6473.6
Simplified73.6%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6473.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6473.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f6473.7
Applied egg-rr73.7%
if 0.48999999999999999 < k Initial program 100.0%
Taylor expanded in k around inf
lower-*.f6498.4
Simplified98.4%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f643.2
Simplified3.2%
lift-/.f643.2
rem-square-sqrtN/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-/.f64N/A
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
frac-timesN/A
metadata-evalN/A
lower-/.f64N/A
lower-*.f643.2
Applied egg-rr3.2%
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f643.2
rem-square-sqrtN/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-/.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
frac-timesN/A
metadata-evalN/A
lift-*.f64N/A
lower-/.f6422.4
Applied egg-rr22.4%
(FPCore (k n) :precision binary64 (sqrt (/ (* n (* PI 2.0)) k)))
double code(double k, double n) {
return sqrt(((n * (((double) M_PI) * 2.0)) / k));
}
public static double code(double k, double n) {
return Math.sqrt(((n * (Math.PI * 2.0)) / k));
}
def code(k, n): return math.sqrt(((n * (math.pi * 2.0)) / k))
function code(k, n) return sqrt(Float64(Float64(n * Float64(pi * 2.0)) / k)) end
function tmp = code(k, n) tmp = sqrt(((n * (pi * 2.0)) / k)); end
code[k_, n_] := N[Sqrt[N[(N[(n * N[(Pi * 2.0), $MachinePrecision]), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{n \cdot \left(\pi \cdot 2\right)}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6439.5
Simplified39.5%
lift-PI.f64N/A
lift-*.f64N/A
lift-/.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lift-/.f64N/A
associate-*l/N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6439.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6439.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f6439.6
Applied egg-rr39.6%
(FPCore (k n) :precision binary64 (sqrt (* n (/ (* PI 2.0) k))))
double code(double k, double n) {
return sqrt((n * ((((double) M_PI) * 2.0) / k)));
}
public static double code(double k, double n) {
return Math.sqrt((n * ((Math.PI * 2.0) / k)));
}
def code(k, n): return math.sqrt((n * ((math.pi * 2.0) / k)))
function code(k, n) return sqrt(Float64(n * Float64(Float64(pi * 2.0) / k))) end
function tmp = code(k, n) tmp = sqrt((n * ((pi * 2.0) / k))); end
code[k_, n_] := N[Sqrt[N[(n * N[(N[(Pi * 2.0), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \frac{\pi \cdot 2}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-*l*N/A
exp-prodN/A
*-commutativeN/A
lower-pow.f64N/A
rem-exp-logN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
rem-exp-logN/A
lower-*.f64N/A
rem-exp-logN/A
*-commutativeN/A
lower-*.f64N/A
lower-PI.f64N/A
sub-negN/A
mul-1-negN/A
Simplified99.6%
sqrt-divN/A
metadata-evalN/A
lift-sqrt.f64N/A
lift-PI.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f6499.6
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6499.6
Applied egg-rr99.6%
Taylor expanded in k around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-PI.f6451.5
Simplified51.5%
*-rgt-identityN/A
lift-PI.f64N/A
sqrt-prodN/A
*-rgt-identityN/A
sqrt-prodN/A
lift-*.f64N/A
sqrt-unprodN/A
sqrt-undivN/A
lower-sqrt.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6439.6
Applied egg-rr39.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
lower-*.f6451.1
Simplified51.1%
Taylor expanded in k around 0
lower-sqrt.f64N/A
lower-/.f645.3
Simplified5.3%
herbie shell --seed 2024207
(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))))