
(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 8 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 (* 2.0 (* PI n)))) (/ (sqrt t_0) (sqrt (* k (pow t_0 k))))))
double code(double k, double n) {
double t_0 = 2.0 * (((double) M_PI) * n);
return sqrt(t_0) / sqrt((k * pow(t_0, k)));
}
public static double code(double k, double n) {
double t_0 = 2.0 * (Math.PI * n);
return Math.sqrt(t_0) / Math.sqrt((k * Math.pow(t_0, k)));
}
def code(k, n): t_0 = 2.0 * (math.pi * n) return math.sqrt(t_0) / math.sqrt((k * math.pow(t_0, k)))
function code(k, n) t_0 = Float64(2.0 * Float64(pi * n)) return Float64(sqrt(t_0) / sqrt(Float64(k * (t_0 ^ k)))) end
function tmp = code(k, n) t_0 = 2.0 * (pi * n); tmp = sqrt(t_0) / sqrt((k * (t_0 ^ k))); end
code[k_, n_] := Block[{t$95$0 = N[(2.0 * N[(Pi * n), $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 := 2 \cdot \left(\pi \cdot n\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
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.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
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6499.7
Applied egg-rr99.7%
(FPCore (k n)
:precision binary64
(let* ((t_0 (sqrt (* PI (* 2.0 n)))))
(if (<=
(* (/ 1.0 (sqrt k)) (pow (* n (* 2.0 PI)) (/ (- 1.0 k) 2.0)))
5e-132)
(* (sqrt (sqrt (* (/ 1.0 k) (/ 1.0 k)))) t_0)
(* (sqrt (/ 1.0 k)) t_0))))
double code(double k, double n) {
double t_0 = sqrt((((double) M_PI) * (2.0 * n)));
double tmp;
if (((1.0 / sqrt(k)) * pow((n * (2.0 * ((double) M_PI))), ((1.0 - k) / 2.0))) <= 5e-132) {
tmp = sqrt(sqrt(((1.0 / k) * (1.0 / k)))) * t_0;
} else {
tmp = sqrt((1.0 / k)) * t_0;
}
return tmp;
}
public static double code(double k, double n) {
double t_0 = Math.sqrt((Math.PI * (2.0 * n)));
double tmp;
if (((1.0 / Math.sqrt(k)) * Math.pow((n * (2.0 * Math.PI)), ((1.0 - k) / 2.0))) <= 5e-132) {
tmp = Math.sqrt(Math.sqrt(((1.0 / k) * (1.0 / k)))) * t_0;
} else {
tmp = Math.sqrt((1.0 / k)) * t_0;
}
return tmp;
}
def code(k, n): t_0 = math.sqrt((math.pi * (2.0 * n))) tmp = 0 if ((1.0 / math.sqrt(k)) * math.pow((n * (2.0 * math.pi)), ((1.0 - k) / 2.0))) <= 5e-132: tmp = math.sqrt(math.sqrt(((1.0 / k) * (1.0 / k)))) * t_0 else: tmp = math.sqrt((1.0 / k)) * t_0 return tmp
function code(k, n) t_0 = sqrt(Float64(pi * Float64(2.0 * n))) tmp = 0.0 if (Float64(Float64(1.0 / sqrt(k)) * (Float64(n * Float64(2.0 * pi)) ^ Float64(Float64(1.0 - k) / 2.0))) <= 5e-132) tmp = Float64(sqrt(sqrt(Float64(Float64(1.0 / k) * Float64(1.0 / k)))) * t_0); else tmp = Float64(sqrt(Float64(1.0 / k)) * t_0); end return tmp end
function tmp_2 = code(k, n) t_0 = sqrt((pi * (2.0 * n))); tmp = 0.0; if (((1.0 / sqrt(k)) * ((n * (2.0 * pi)) ^ ((1.0 - k) / 2.0))) <= 5e-132) tmp = sqrt(sqrt(((1.0 / k) * (1.0 / k)))) * t_0; else tmp = sqrt((1.0 / k)) * t_0; end tmp_2 = tmp; end
code[k_, n_] := Block[{t$95$0 = N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[(1.0 / N[Sqrt[k], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - k), $MachinePrecision] / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 5e-132], N[(N[Sqrt[N[Sqrt[N[(N[(1.0 / k), $MachinePrecision] * N[(1.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sqrt{\pi \cdot \left(2 \cdot n\right)}\\
\mathbf{if}\;\frac{1}{\sqrt{k}} \cdot {\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(\frac{1 - k}{2}\right)} \leq 5 \cdot 10^{-132}:\\
\;\;\;\;\sqrt{\sqrt{\frac{1}{k} \cdot \frac{1}{k}}} \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{1}{k}} \cdot 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)))) < 4.9999999999999999e-132Initial program 99.9%
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.f644.0
Simplified4.0%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f644.0
Applied egg-rr4.0%
div-invN/A
sqrt-prodN/A
pow1/2N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f644.0
Applied egg-rr4.0%
rem-square-sqrtN/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6451.0
Applied egg-rr51.0%
if 4.9999999999999999e-132 < (*.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.f6448.6
Simplified48.6%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6448.7
Applied egg-rr48.7%
div-invN/A
sqrt-prodN/A
pow1/2N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6468.3
Applied egg-rr68.3%
Final simplification62.9%
(FPCore (k n) :precision binary64 (* (sqrt (/ 1.0 k)) (pow (* n (* 2.0 PI)) (fma -0.5 k 0.5))))
double code(double k, double n) {
return sqrt((1.0 / k)) * pow((n * (2.0 * ((double) M_PI))), fma(-0.5, k, 0.5));
}
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * (Float64(n * Float64(2.0 * pi)) ^ fma(-0.5, k, 0.5))) end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(-0.5 * k + 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{k}} \cdot {\left(n \cdot \left(2 \cdot \pi\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%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* PI n)) (fma k -0.5 0.5)) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), fma(k, -0.5, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ fma(k, -0.5, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(k * -0.5 + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
div-subN/A
metadata-evalN/A
sub-negN/A
+-commutativeN/A
div-invN/A
metadata-evalN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
metadata-eval99.5
Applied egg-rr99.5%
metadata-evalN/A
sqrt-divN/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6499.6
Applied egg-rr99.6%
*-commutativeN/A
sqrt-divN/A
metadata-evalN/A
un-div-invN/A
/-lowering-/.f64N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
accelerator-lowering-fma.f64N/A
sqrt-lowering-sqrt.f6499.5
Applied egg-rr99.5%
(FPCore (k n) :precision binary64 (* (sqrt (/ 1.0 k)) (sqrt (* PI (* 2.0 n)))))
double code(double k, double n) {
return sqrt((1.0 / k)) * sqrt((((double) M_PI) * (2.0 * n)));
}
public static double code(double k, double n) {
return Math.sqrt((1.0 / k)) * Math.sqrt((Math.PI * (2.0 * n)));
}
def code(k, n): return math.sqrt((1.0 / k)) * math.sqrt((math.pi * (2.0 * n)))
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * sqrt(Float64(pi * Float64(2.0 * n)))) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)) * sqrt((pi * (2.0 * n))); end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{1}{k}} \cdot \sqrt{\pi \cdot \left(2 \cdot n\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.f6434.7
Simplified34.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6434.8
Applied egg-rr34.8%
div-invN/A
sqrt-prodN/A
pow1/2N/A
*-commutativeN/A
*-lowering-*.f64N/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
PI-lowering-PI.f64N/A
*-lowering-*.f6448.2
Applied egg-rr48.2%
(FPCore (k n) :precision binary64 (* (sqrt (/ 2.0 k)) (sqrt (* PI n))))
double code(double k, double n) {
return sqrt((2.0 / k)) * sqrt((((double) M_PI) * n));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 / k)) * Math.sqrt((Math.PI * n));
}
def code(k, n): return math.sqrt((2.0 / k)) * math.sqrt((math.pi * n))
function code(k, n) return Float64(sqrt(Float64(2.0 / k)) * sqrt(Float64(pi * n))) end
function tmp = code(k, n) tmp = sqrt((2.0 / k)) * sqrt((pi * n)); end
code[k_, n_] := N[(N[Sqrt[N[(2.0 / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{2}{k}} \cdot \sqrt{\pi \cdot 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.f6434.7
Simplified34.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6434.8
Applied egg-rr34.8%
div-invN/A
*-commutativeN/A
associate-*r*N/A
sqrt-unprodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6448.2
Applied egg-rr48.2%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* 2.0 (/ PI k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((2.0 * (((double) M_PI) / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((2.0 * (Math.PI / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((2.0 * (math.pi / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(2.0 * Float64(pi / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((2.0 * (pi / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(Pi / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{2 \cdot \frac{\pi}{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.f6434.7
Simplified34.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.f6448.2
Applied egg-rr48.2%
Final simplification48.2%
(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 * 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[(N[(Pi * n), $MachinePrecision] * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\pi \cdot n\right) \cdot \frac{2}{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.f6434.7
Simplified34.7%
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
associate-*l/N/A
*-commutativeN/A
*-commutativeN/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
PI-lowering-PI.f6434.8
Applied egg-rr34.8%
associate-*l/N/A
metadata-evalN/A
associate-*l/N/A
*-lowering-*.f64N/A
associate-*l/N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
PI-lowering-PI.f6434.8
Applied egg-rr34.8%
Final simplification34.8%
herbie shell --seed 2024198
(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))))