
(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)) (+ -0.5 (* k 0.5)))))
double code(double k, double n) {
return sqrt((1.0 / k)) / pow((n * (((double) M_PI) * 2.0)), (-0.5 + (k * 0.5)));
}
public static double code(double k, double n) {
return Math.sqrt((1.0 / k)) / Math.pow((n * (Math.PI * 2.0)), (-0.5 + (k * 0.5)));
}
def code(k, n): return math.sqrt((1.0 / k)) / math.pow((n * (math.pi * 2.0)), (-0.5 + (k * 0.5)))
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) / (Float64(n * Float64(pi * 2.0)) ^ Float64(-0.5 + Float64(k * 0.5)))) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)) / ((n * (pi * 2.0)) ^ (-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 + N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\frac{1}{k}}}{{\left(n \cdot \left(\pi \cdot 2\right)\right)}^{\left(-0.5 + k \cdot 0.5\right)}}
\end{array}
Initial program 99.5%
associate-*r*N/A
div-subN/A
metadata-evalN/A
pow-subN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
inv-powN/A
pow1/2N/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
clear-numN/A
pow-subN/A
inv-powN/A
Applied egg-rr99.6%
Taylor expanded in k around inf
associate-*r/N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
exp-to-powN/A
pow-lowering-pow.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/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
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6499.6%
Simplified99.6%
(FPCore (k n) :precision binary64 (/ (pow k -0.5) (pow (* 2.0 (* n PI)) (- -0.5 (/ k -2.0)))))
double code(double k, double n) {
return pow(k, -0.5) / pow((2.0 * (n * ((double) M_PI))), (-0.5 - (k / -2.0)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) / Math.pow((2.0 * (n * Math.PI)), (-0.5 - (k / -2.0)));
}
def code(k, n): return math.pow(k, -0.5) / math.pow((2.0 * (n * math.pi)), (-0.5 - (k / -2.0)))
function code(k, n) return Float64((k ^ -0.5) / (Float64(2.0 * Float64(n * pi)) ^ Float64(-0.5 - Float64(k / -2.0)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) / ((2.0 * (n * pi)) ^ (-0.5 - (k / -2.0))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] / N[Power[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision], N[(-0.5 - N[(k / -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{k}^{-0.5}}{{\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(-0.5 - \frac{k}{-2}\right)}}
\end{array}
Initial program 99.5%
associate-*r*N/A
div-subN/A
metadata-evalN/A
pow-subN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
inv-powN/A
pow1/2N/A
pow-powN/A
pow-lowering-pow.f64N/A
metadata-evalN/A
clear-numN/A
pow-subN/A
inv-powN/A
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (* (pow k -0.5) (pow (* 2.0 (* n PI)) (+ 0.5 (/ k -2.0)))))
double code(double k, double n) {
return pow(k, -0.5) * pow((2.0 * (n * ((double) M_PI))), (0.5 + (k / -2.0)));
}
public static double code(double k, double n) {
return Math.pow(k, -0.5) * Math.pow((2.0 * (n * Math.PI)), (0.5 + (k / -2.0)));
}
def code(k, n): return math.pow(k, -0.5) * math.pow((2.0 * (n * math.pi)), (0.5 + (k / -2.0)))
function code(k, n) return Float64((k ^ -0.5) * (Float64(2.0 * Float64(n * pi)) ^ Float64(0.5 + Float64(k / -2.0)))) end
function tmp = code(k, n) tmp = (k ^ -0.5) * ((2.0 * (n * pi)) ^ (0.5 + (k / -2.0))); end
code[k_, n_] := N[(N[Power[k, -0.5], $MachinePrecision] * N[Power[N[(2.0 * N[(n * Pi), $MachinePrecision]), $MachinePrecision], N[(0.5 + N[(k / -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{k}^{-0.5} \cdot {\left(2 \cdot \left(n \cdot \pi\right)\right)}^{\left(0.5 + \frac{k}{-2}\right)}
\end{array}
Initial program 99.5%
*-commutativeN/A
associate-*r*N/A
div-subN/A
metadata-evalN/A
*-lowering-*.f64N/A
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* n PI)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (n * ((double) M_PI))), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (n * Math.PI)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((2.0 * (n * math.pi)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(2.0 * Float64(n * pi)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((2.0 * (n * pi)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(n * Pi), $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(n \cdot \pi\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/N/A
*-lft-identityN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
div-subN/A
--lowering--.f64N/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6499.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (/ (sqrt n) (sqrt (/ k (/ PI 0.5)))))
double code(double k, double n) {
return sqrt(n) / sqrt((k / (((double) M_PI) / 0.5)));
}
public static double code(double k, double n) {
return Math.sqrt(n) / Math.sqrt((k / (Math.PI / 0.5)));
}
def code(k, n): return math.sqrt(n) / math.sqrt((k / (math.pi / 0.5)))
function code(k, n) return Float64(sqrt(n) / sqrt(Float64(k / Float64(pi / 0.5)))) end
function tmp = code(k, n) tmp = sqrt(n) / sqrt((k / (pi / 0.5))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] / N[Sqrt[N[(k / N[(Pi / 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n}}{\sqrt{\frac{k}{\frac{\pi}{0.5}}}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6435.5%
Simplified35.5%
*-commutativeN/A
sqrt-unprodN/A
associate-/l*N/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
clear-numN/A
associate-/r/N/A
metadata-evalN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
div-invN/A
metadata-evalN/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
clear-numN/A
associate-/r/N/A
div-invN/A
metadata-evalN/A
frac-timesN/A
associate-/r/N/A
clear-numN/A
associate-/l/N/A
sqrt-divN/A
pow1/2N/A
/-lowering-/.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6447.3%
Applied egg-rr47.3%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (/ PI (/ k 2.0)))))
double code(double k, double n) {
return sqrt(n) * sqrt((((double) M_PI) / (k / 2.0)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((Math.PI / (k / 2.0)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((math.pi / (k / 2.0)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(pi / Float64(k / 2.0)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((pi / (k / 2.0))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(Pi / N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\frac{\pi}{\frac{k}{2}}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6435.5%
Simplified35.5%
*-commutativeN/A
sqrt-unprodN/A
associate-/l*N/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
clear-numN/A
associate-/r/N/A
metadata-evalN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
div-invN/A
*-commutativeN/A
metadata-evalN/A
associate-*r*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
associate-/l*N/A
clear-numN/A
div-invN/A
/-lowering-/.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f6447.2%
Applied egg-rr47.2%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (/ 2.0 (/ k PI)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 / (k / ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 / (k / Math.PI)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 / (k / math.pi)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 / (k / pi))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 / N[(k / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\frac{2}{\frac{k}{\pi}}}
\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.f6435.5%
Simplified35.5%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/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
*-commutativeN/A
associate-*l/N/A
clear-numN/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6447.2%
Applied egg-rr47.2%
(FPCore (k n) :precision binary64 (pow (/ (/ k (* n 2.0)) PI) -0.5))
double code(double k, double n) {
return pow(((k / (n * 2.0)) / ((double) M_PI)), -0.5);
}
public static double code(double k, double n) {
return Math.pow(((k / (n * 2.0)) / Math.PI), -0.5);
}
def code(k, n): return math.pow(((k / (n * 2.0)) / math.pi), -0.5)
function code(k, n) return Float64(Float64(k / Float64(n * 2.0)) / pi) ^ -0.5 end
function tmp = code(k, n) tmp = ((k / (n * 2.0)) / pi) ^ -0.5; end
code[k_, n_] := N[Power[N[(N[(k / N[(n * 2.0), $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{\frac{k}{n \cdot 2}}{\pi}\right)}^{-0.5}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6435.5%
Simplified35.5%
sqrt-unprodN/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
pow1/2N/A
metadata-evalN/A
pow-powN/A
inv-powN/A
clear-numN/A
pow-lowering-pow.f64N/A
associate-/r*N/A
associate-/l/N/A
/-lowering-/.f64N/A
associate-/l/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6436.1%
Applied egg-rr36.1%
Final simplification36.1%
(FPCore (k n) :precision binary64 (pow (/ k (/ n (/ 0.5 PI))) -0.5))
double code(double k, double n) {
return pow((k / (n / (0.5 / ((double) M_PI)))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((k / (n / (0.5 / Math.PI))), -0.5);
}
def code(k, n): return math.pow((k / (n / (0.5 / math.pi))), -0.5)
function code(k, n) return Float64(k / Float64(n / Float64(0.5 / pi))) ^ -0.5 end
function tmp = code(k, n) tmp = (k / (n / (0.5 / pi))) ^ -0.5; end
code[k_, n_] := N[Power[N[(k / N[(n / N[(0.5 / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{k}{\frac{n}{\frac{0.5}{\pi}}}\right)}^{-0.5}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6435.5%
Simplified35.5%
*-commutativeN/A
sqrt-unprodN/A
associate-/l*N/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
clear-numN/A
associate-/r/N/A
metadata-evalN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
clear-numN/A
inv-powN/A
sqrt-pow1N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.f64N/A
clear-numN/A
associate-/r*N/A
clear-numN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
PI-lowering-PI.f6436.0%
Applied egg-rr36.0%
(FPCore (k n) :precision binary64 (sqrt (* (/ 2.0 k) (* n PI))))
double code(double k, double n) {
return sqrt(((2.0 / k) * (n * ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.sqrt(((2.0 / k) * (n * Math.PI)));
}
def code(k, n): return math.sqrt(((2.0 / k) * (n * math.pi)))
function code(k, n) return sqrt(Float64(Float64(2.0 / k) * Float64(n * pi))) end
function tmp = code(k, n) tmp = sqrt(((2.0 / k) * (n * pi))); end
code[k_, n_] := N[Sqrt[N[(N[(2.0 / k), $MachinePrecision] * N[(n * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{2}{k} \cdot \left(n \cdot \pi\right)}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
sqrt-lowering-sqrt.f6435.5%
Simplified35.5%
*-commutativeN/A
sqrt-unprodN/A
associate-/l*N/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
clear-numN/A
associate-/r/N/A
metadata-evalN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
div-invN/A
metadata-evalN/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
(FPCore (k n) :precision binary64 (sqrt (* PI (/ 2.0 (/ k n)))))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 / (k / n))));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 / (k / n))));
}
def code(k, n): return math.sqrt((math.pi * (2.0 / (k / n))))
function code(k, n) return sqrt(Float64(pi * Float64(2.0 / Float64(k / n)))) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 / (k / n)))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(2.0 / N[(k / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \frac{2}{\frac{k}{n}}}
\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.f6435.5%
Simplified35.5%
*-commutativeN/A
sqrt-unprodN/A
associate-/l*N/A
*-commutativeN/A
sqrt-lowering-sqrt.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
clear-numN/A
associate-/r/N/A
metadata-evalN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
div-invN/A
metadata-evalN/A
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6435.6%
Applied egg-rr35.6%
clear-numN/A
associate-/r/N/A
div-invN/A
metadata-evalN/A
frac-timesN/A
associate-/l/N/A
clear-numN/A
div-invN/A
metadata-evalN/A
associate-/l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6435.5%
Applied egg-rr35.5%
herbie shell --seed 2024164
(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))))