
(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) (* (sqrt k) (pow t_0 (/ k 2.0))))))
double code(double k, double n) {
double t_0 = ((double) M_PI) * (2.0 * n);
return sqrt(t_0) / (sqrt(k) * pow(t_0, (k / 2.0)));
}
public static double code(double k, double n) {
double t_0 = Math.PI * (2.0 * n);
return Math.sqrt(t_0) / (Math.sqrt(k) * Math.pow(t_0, (k / 2.0)));
}
def code(k, n): t_0 = math.pi * (2.0 * n) return math.sqrt(t_0) / (math.sqrt(k) * math.pow(t_0, (k / 2.0)))
function code(k, n) t_0 = Float64(pi * Float64(2.0 * n)) return Float64(sqrt(t_0) / Float64(sqrt(k) * (t_0 ^ Float64(k / 2.0)))) end
function tmp = code(k, n) t_0 = pi * (2.0 * n); tmp = sqrt(t_0) / (sqrt(k) * (t_0 ^ (k / 2.0))); end
code[k_, n_] := Block[{t$95$0 = N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]}, N[(N[Sqrt[t$95$0], $MachinePrecision] / N[(N[Sqrt[k], $MachinePrecision] * N[Power[t$95$0, N[(k / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \pi \cdot \left(2 \cdot n\right)\\
\frac{\sqrt{t\_0}}{\sqrt{k} \cdot {t\_0}^{\left(\frac{k}{2}\right)}}
\end{array}
\end{array}
Initial program 99.3%
*-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
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
(FPCore (k n) :precision binary64 (if (<= k 6.7e+165) (/ (sqrt (* PI (* 2.0 n))) (sqrt k)) (pow (* (/ PI (* k (/ k PI))) (* 4.0 (* n n))) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
} else {
tmp = pow(((((double) M_PI) / (k * (k / ((double) M_PI)))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
} else {
tmp = Math.pow(((Math.PI / (k * (k / Math.PI))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6.7e+165: tmp = math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k) else: tmp = math.pow(((math.pi / (k * (k / math.pi))) * (4.0 * (n * n))), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 6.7e+165) tmp = Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)); else tmp = Float64(Float64(pi / Float64(k * Float64(k / pi))) * Float64(4.0 * Float64(n * n))) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6.7e+165) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); else tmp = ((pi / (k * (k / pi))) * (4.0 * (n * n))) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6.7e+165], N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(Pi / N[(k * N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.7 \cdot 10^{+165}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\pi}{k \cdot \frac{k}{\pi}} \cdot \left(4 \cdot \left(n \cdot n\right)\right)\right)}^{0.25}\\
\end{array}
\end{array}
if k < 6.70000000000000037e165Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6452.7%
Simplified52.7%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
sqrt-undivN/A
pow1/2N/A
metadata-evalN/A
pow-flipN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f64N/A
pow-flipN/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f6467.5%
Applied egg-rr67.5%
if 6.70000000000000037e165 < 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.9%
Simplified2.9%
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.9%
Applied egg-rr2.9%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.9%
Applied egg-rr2.9%
pow1/2N/A
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
associate-*l/N/A
pow-prod-downN/A
sqr-powN/A
sqr-powN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
Applied egg-rr37.1%
(FPCore (k n) :precision binary64 (if (<= k 6.7e+165) (* (sqrt (/ 2.0 (/ k PI))) (sqrt n)) (pow (* (/ PI (* k (/ k PI))) (* 4.0 (* n n))) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = sqrt((2.0 / (k / ((double) M_PI)))) * sqrt(n);
} else {
tmp = pow(((((double) M_PI) / (k * (k / ((double) M_PI)))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = Math.sqrt((2.0 / (k / Math.PI))) * Math.sqrt(n);
} else {
tmp = Math.pow(((Math.PI / (k * (k / Math.PI))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6.7e+165: tmp = math.sqrt((2.0 / (k / math.pi))) * math.sqrt(n) else: tmp = math.pow(((math.pi / (k * (k / math.pi))) * (4.0 * (n * n))), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 6.7e+165) tmp = Float64(sqrt(Float64(2.0 / Float64(k / pi))) * sqrt(n)); else tmp = Float64(Float64(pi / Float64(k * Float64(k / pi))) * Float64(4.0 * Float64(n * n))) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6.7e+165) tmp = sqrt((2.0 / (k / pi))) * sqrt(n); else tmp = ((pi / (k * (k / pi))) * (4.0 * (n * n))) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6.7e+165], N[(N[Sqrt[N[(2.0 / N[(k / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(Pi / N[(k * N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.7 \cdot 10^{+165}:\\
\;\;\;\;\sqrt{\frac{2}{\frac{k}{\pi}}} \cdot \sqrt{n}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\pi}{k \cdot \frac{k}{\pi}} \cdot \left(4 \cdot \left(n \cdot n\right)\right)\right)}^{0.25}\\
\end{array}
\end{array}
if k < 6.70000000000000037e165Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6452.7%
Simplified52.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.f6452.8%
Applied egg-rr52.8%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6452.7%
Applied egg-rr52.7%
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
associate-*l/N/A
*-commutativeN/A
associate-*r*N/A
associate-/r/N/A
*-commutativeN/A
associate-/r/N/A
associate-*r*N/A
sqrt-prodN/A
pow1/2N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f6467.3%
Applied egg-rr67.3%
if 6.70000000000000037e165 < 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.9%
Simplified2.9%
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.9%
Applied egg-rr2.9%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.9%
Applied egg-rr2.9%
pow1/2N/A
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
associate-*l/N/A
pow-prod-downN/A
sqr-powN/A
sqr-powN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
Applied egg-rr37.1%
(FPCore (k n) :precision binary64 (if (<= k 6.7e+165) (* (sqrt n) (sqrt (* 2.0 (/ PI k)))) (pow (* (/ PI (* k (/ k PI))) (* 4.0 (* n n))) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
} else {
tmp = pow(((((double) M_PI) / (k * (k / ((double) M_PI)))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
} else {
tmp = Math.pow(((Math.PI / (k * (k / Math.PI))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6.7e+165: tmp = math.sqrt(n) * math.sqrt((2.0 * (math.pi / k))) else: tmp = math.pow(((math.pi / (k * (k / math.pi))) * (4.0 * (n * n))), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 6.7e+165) tmp = Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))); else tmp = Float64(Float64(pi / Float64(k * Float64(k / pi))) * Float64(4.0 * Float64(n * n))) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6.7e+165) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); else tmp = ((pi / (k * (k / pi))) * (4.0 * (n * n))) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6.7e+165], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(Pi / N[(k * N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.7 \cdot 10^{+165}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\pi}{k \cdot \frac{k}{\pi}} \cdot \left(4 \cdot \left(n \cdot n\right)\right)\right)}^{0.25}\\
\end{array}
\end{array}
if k < 6.70000000000000037e165Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6452.7%
Simplified52.7%
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.f6467.3%
Applied egg-rr67.3%
if 6.70000000000000037e165 < 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.9%
Simplified2.9%
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.9%
Applied egg-rr2.9%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.9%
Applied egg-rr2.9%
pow1/2N/A
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
associate-*l/N/A
pow-prod-downN/A
sqr-powN/A
sqr-powN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
Applied egg-rr37.1%
Final simplification61.2%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (/ (- 1.0 k) 2.0)) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), ((1.0 - k) / 2.0)) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), ((1.0 - k) / 2.0)) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), ((1.0 - k) / 2.0)) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(Float64(1.0 - k) / 2.0)) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ ((1.0 - k) / 2.0)) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(\frac{1 - k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.3%
*-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
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
pow-lowering-pow.f64N/A
Applied egg-rr99.7%
pow1/2N/A
metadata-evalN/A
pow-flipN/A
*-commutativeN/A
associate-/r*N/A
pow1/2N/A
pow-subN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
div-subN/A
/-lowering-/.f64N/A
Applied egg-rr99.4%
(FPCore (k n) :precision binary64 (if (<= k 6.7e+165) (sqrt (* 2.0 (/ (* PI n) k))) (pow (* (/ PI (* k (/ k PI))) (* 4.0 (* n n))) 0.25)))
double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = sqrt((2.0 * ((((double) M_PI) * n) / k)));
} else {
tmp = pow(((((double) M_PI) / (k * (k / ((double) M_PI)))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 6.7e+165) {
tmp = Math.sqrt((2.0 * ((Math.PI * n) / k)));
} else {
tmp = Math.pow(((Math.PI / (k * (k / Math.PI))) * (4.0 * (n * n))), 0.25);
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 6.7e+165: tmp = math.sqrt((2.0 * ((math.pi * n) / k))) else: tmp = math.pow(((math.pi / (k * (k / math.pi))) * (4.0 * (n * n))), 0.25) return tmp
function code(k, n) tmp = 0.0 if (k <= 6.7e+165) tmp = sqrt(Float64(2.0 * Float64(Float64(pi * n) / k))); else tmp = Float64(Float64(pi / Float64(k * Float64(k / pi))) * Float64(4.0 * Float64(n * n))) ^ 0.25; end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 6.7e+165) tmp = sqrt((2.0 * ((pi * n) / k))); else tmp = ((pi / (k * (k / pi))) * (4.0 * (n * n))) ^ 0.25; end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 6.7e+165], N[Sqrt[N[(2.0 * N[(N[(Pi * n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(Pi / N[(k * N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(4.0 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.25], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 6.7 \cdot 10^{+165}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\pi \cdot n}{k}}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{\pi}{k \cdot \frac{k}{\pi}} \cdot \left(4 \cdot \left(n \cdot n\right)\right)\right)}^{0.25}\\
\end{array}
\end{array}
if k < 6.70000000000000037e165Initial program 99.1%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6452.7%
Simplified52.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.f6452.8%
Applied egg-rr52.8%
clear-numN/A
associate-/r/N/A
clear-numN/A
associate-*l/N/A
*-lowering-*.f64N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6452.8%
Applied egg-rr52.8%
if 6.70000000000000037e165 < 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.9%
Simplified2.9%
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.9%
Applied egg-rr2.9%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f642.9%
Applied egg-rr2.9%
pow1/2N/A
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
associate-*l/N/A
pow-prod-downN/A
sqr-powN/A
sqr-powN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
pow-prod-downN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
Applied egg-rr37.1%
Final simplification49.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(Float64(pi * 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[(N[(Pi * n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{\pi \cdot n}{k}}
\end{array}
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.f6442.6%
Simplified42.6%
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.f6442.7%
Applied egg-rr42.7%
clear-numN/A
associate-/r/N/A
clear-numN/A
associate-*l/N/A
*-lowering-*.f64N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6442.7%
Applied egg-rr42.7%
Final simplification42.7%
(FPCore (k n) :precision binary64 (sqrt (* (* 2.0 n) (/ PI k))))
double code(double k, double n) {
return sqrt(((2.0 * n) * (((double) M_PI) / k)));
}
public static double code(double k, double n) {
return Math.sqrt(((2.0 * n) * (Math.PI / k)));
}
def code(k, n): return math.sqrt(((2.0 * n) * (math.pi / k)))
function code(k, n) return sqrt(Float64(Float64(2.0 * n) * Float64(pi / k))) end
function tmp = code(k, n) tmp = sqrt(((2.0 * n) * (pi / k))); end
code[k_, n_] := N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(2 \cdot n\right) \cdot \frac{\pi}{k}}
\end{array}
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.f6442.6%
Simplified42.6%
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.f6442.7%
Applied egg-rr42.7%
clear-numN/A
associate-/r/N/A
clear-numN/A
associate-*l/N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6442.7%
Applied egg-rr42.7%
Final simplification42.7%
(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(pi * Float64(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[(Pi * N[(2.0 * N[(n / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \left(2 \cdot \frac{n}{k}\right)}
\end{array}
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.f6442.6%
Simplified42.6%
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.f6442.7%
Applied egg-rr42.7%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6442.6%
Applied egg-rr42.6%
*-commutativeN/A
clear-numN/A
associate-*r/N/A
div-invN/A
metadata-evalN/A
times-fracN/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f6442.7%
Applied egg-rr42.7%
Final simplification42.7%
(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(pi * Float64(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[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n \cdot \left(\pi \cdot \frac{2}{k}\right)}
\end{array}
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.f6442.6%
Simplified42.6%
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.f6442.7%
Applied egg-rr42.7%
associate-/r/N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6442.6%
Applied egg-rr42.6%
Final simplification42.6%
(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.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.f6442.6%
Simplified42.6%
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.f6442.7%
Applied egg-rr42.7%
associate-/r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6442.6%
Applied egg-rr42.6%
Final simplification42.6%
herbie shell --seed 2024194
(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))))