
(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 (* (* 2.0 PI) n) (/ (- 1.0 k) 2.0))))
double code(double k, double n) {
return sqrt((1.0 / k)) * pow(((2.0 * ((double) M_PI)) * n), ((1.0 - k) / 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((1.0 / k)) * Math.pow(((2.0 * Math.PI) * n), ((1.0 - k) / 2.0));
}
def code(k, n): return math.sqrt((1.0 / k)) * math.pow(((2.0 * math.pi) * n), ((1.0 - k) / 2.0))
function code(k, n) return Float64(sqrt(Float64(1.0 / k)) * (Float64(Float64(2.0 * pi) * n) ^ Float64(Float64(1.0 - k) / 2.0))) end
function tmp = code(k, n) tmp = sqrt((1.0 / k)) * (((2.0 * pi) * n) ^ ((1.0 - k) / 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(1.0 / 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}
\\
\sqrt{\frac{1}{k}} \cdot {\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(\frac{1 - k}{2}\right)}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.4%
sqrt-unprod99.5%
frac-times99.5%
metadata-eval99.5%
add-sqr-sqrt99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (if (<= k 4.6e-67) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (/ 1.0 (sqrt (/ k (pow (* (* 2.0 PI) n) (- 1.0 k)))))))
double code(double k, double n) {
double tmp;
if (k <= 4.6e-67) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = 1.0 / sqrt((k / pow(((2.0 * ((double) M_PI)) * n), (1.0 - k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 4.6e-67) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = 1.0 / Math.sqrt((k / Math.pow(((2.0 * Math.PI) * n), (1.0 - k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 4.6e-67: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = 1.0 / math.sqrt((k / math.pow(((2.0 * math.pi) * n), (1.0 - k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 4.6e-67) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = Float64(1.0 / sqrt(Float64(k / (Float64(Float64(2.0 * pi) * n) ^ Float64(1.0 - k))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 4.6e-67) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = 1.0 / sqrt((k / (((2.0 * pi) * n) ^ (1.0 - k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 4.6e-67], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k / N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 4.6 \cdot 10^{-67}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{\frac{k}{{\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(1 - k\right)}}}}\\
\end{array}
\end{array}
if k < 4.6000000000000001e-67Initial program 99.3%
Applied egg-rr74.9%
Simplified75.0%
Taylor expanded in k around 0 75.0%
associate-*r*75.0%
*-commutative75.0%
associate-*l*75.0%
Simplified75.0%
associate-*r*75.0%
associate-*r/75.0%
sqrt-prod99.5%
*-commutative99.5%
*-commutative99.5%
Applied egg-rr99.5%
if 4.6000000000000001e-67 < k Initial program 99.6%
associate-*l/99.6%
*-lft-identity99.6%
sqr-pow98.9%
pow-sqr99.6%
*-commutative99.6%
associate-*l*99.6%
associate-*r/99.6%
*-commutative99.6%
associate-/l*99.6%
metadata-eval99.6%
/-rgt-identity99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
div-inv99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
sub-neg99.6%
div-inv99.6%
metadata-eval99.6%
distribute-rgt-neg-in99.6%
metadata-eval99.6%
inv-pow99.6%
sqrt-pow299.6%
metadata-eval99.6%
Applied egg-rr99.6%
sqr-pow98.9%
pow-prod-down91.3%
sqrt-pow191.3%
pow-prod-down99.0%
pow299.0%
pow-unpow99.0%
*-commutative99.0%
associate-*r*99.0%
+-commutative99.0%
fma-udef99.0%
*-commutative99.0%
associate-*r*99.0%
Applied egg-rr99.0%
*-commutative99.0%
*-commutative99.0%
associate-*l*99.0%
fma-udef99.0%
distribute-lft-in99.0%
*-commutative99.0%
associate-*r*99.0%
metadata-eval99.0%
neg-mul-199.0%
metadata-eval99.0%
+-commutative99.0%
sub-neg99.0%
Simplified99.0%
Final simplification99.2%
(FPCore (k n) :precision binary64 (if (<= k 1.35e-96) (* (sqrt (/ PI k)) (sqrt (* 2.0 n))) (sqrt (/ (pow (* (* 2.0 PI) n) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.35e-96) {
tmp = sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
} else {
tmp = sqrt((pow(((2.0 * ((double) M_PI)) * n), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.35e-96) {
tmp = Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
} else {
tmp = Math.sqrt((Math.pow(((2.0 * Math.PI) * n), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.35e-96: tmp = math.sqrt((math.pi / k)) * math.sqrt((2.0 * n)) else: tmp = math.sqrt((math.pow(((2.0 * math.pi) * n), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.35e-96) tmp = Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))); else tmp = sqrt(Float64((Float64(Float64(2.0 * pi) * n) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.35e-96) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); else tmp = sqrt(((((2.0 * pi) * n) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.35e-96], N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(2.0 * Pi), $MachinePrecision] * n), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.35 \cdot 10^{-96}:\\
\;\;\;\;\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(2 \cdot \pi\right) \cdot n\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.35e-96Initial program 99.3%
Applied egg-rr72.5%
Simplified72.5%
Taylor expanded in k around 0 72.5%
associate-*r*72.5%
*-commutative72.5%
associate-*l*72.5%
Simplified72.5%
associate-*r*72.5%
associate-*r/72.5%
sqrt-prod99.5%
*-commutative99.5%
*-commutative99.5%
Applied egg-rr99.5%
if 1.35e-96 < k Initial program 99.5%
Applied egg-rr99.0%
Simplified99.0%
Taylor expanded in n around 0 97.9%
Simplified99.0%
Final simplification99.2%
(FPCore (k n) :precision binary64 (/ (pow (* PI (* 2.0 n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((((double) M_PI) * (2.0 * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((Math.PI * (2.0 * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((math.pi * (2.0 * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((pi * (2.0 * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k / 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.5%
*-lft-identity99.5%
sqr-pow98.9%
pow-sqr99.5%
*-commutative99.5%
associate-*l*99.5%
associate-*r/99.5%
*-commutative99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
div-sub99.5%
metadata-eval99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (* PI (/ 2.0 k)))))
double code(double k, double n) {
return sqrt(n) * sqrt((((double) M_PI) * (2.0 / k)));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt((Math.PI * (2.0 / k)));
}
def code(k, n): return math.sqrt(n) * math.sqrt((math.pi * (2.0 / k)))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(pi * Float64(2.0 / k)))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt((pi * (2.0 / k))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\pi \cdot \frac{2}{k}}
\end{array}
Initial program 99.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
pow1/235.1%
associate-*r*35.1%
associate-*r/35.1%
associate-*l*35.1%
unpow-prod-down43.5%
pow1/243.5%
clear-num43.5%
un-div-inv43.5%
Applied egg-rr43.5%
unpow1/243.5%
associate-/r/43.5%
Simplified43.5%
Final simplification43.5%
(FPCore (k n) :precision binary64 (* (sqrt (/ PI k)) (sqrt (* 2.0 n))))
double code(double k, double n) {
return sqrt((((double) M_PI) / k)) * sqrt((2.0 * n));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI / k)) * Math.sqrt((2.0 * n));
}
def code(k, n): return math.sqrt((math.pi / k)) * math.sqrt((2.0 * n))
function code(k, n) return Float64(sqrt(Float64(pi / k)) * sqrt(Float64(2.0 * n))) end
function tmp = code(k, n) tmp = sqrt((pi / k)) * sqrt((2.0 * n)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi / k), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\frac{\pi}{k}} \cdot \sqrt{2 \cdot n}
\end{array}
Initial program 99.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
associate-*r*35.1%
associate-*r/35.1%
sqrt-prod43.5%
*-commutative43.5%
*-commutative43.5%
Applied egg-rr43.5%
Final simplification43.5%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (* 0.5 (/ k (* PI n))))))
double code(double k, double n) {
return 1.0 / sqrt((0.5 * (k / (((double) M_PI) * n))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((0.5 * (k / (Math.PI * n))));
}
def code(k, n): return 1.0 / math.sqrt((0.5 * (k / (math.pi * n))))
function code(k, n) return Float64(1.0 / sqrt(Float64(0.5 * Float64(k / Float64(pi * n))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((0.5 * (k / (pi * n)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(0.5 * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{0.5 \cdot \frac{k}{\pi \cdot n}}}
\end{array}
Initial program 99.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
clear-num35.0%
sqrt-div36.2%
metadata-eval36.2%
*-un-lft-identity36.2%
*-commutative36.2%
associate-*r*36.2%
*-commutative36.2%
times-frac36.2%
metadata-eval36.2%
*-commutative36.2%
associate-/r*36.2%
Applied egg-rr36.2%
associate-/l/36.2%
Simplified36.2%
Final simplification36.2%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (* 0.5 (/ (/ k PI) n)))))
double code(double k, double n) {
return 1.0 / sqrt((0.5 * ((k / ((double) M_PI)) / n)));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((0.5 * ((k / Math.PI) / n)));
}
def code(k, n): return 1.0 / math.sqrt((0.5 * ((k / math.pi) / n)))
function code(k, n) return Float64(1.0 / sqrt(Float64(0.5 * Float64(Float64(k / pi) / n)))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((0.5 * ((k / pi) / n))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(0.5 * N[(N[(k / Pi), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{0.5 \cdot \frac{\frac{k}{\pi}}{n}}}
\end{array}
Initial program 99.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
clear-num35.0%
sqrt-div36.2%
metadata-eval36.2%
*-un-lft-identity36.2%
*-commutative36.2%
associate-*r*36.2%
*-commutative36.2%
times-frac36.2%
metadata-eval36.2%
*-commutative36.2%
associate-/r*36.2%
Applied egg-rr36.2%
Final simplification36.2%
(FPCore (k n) :precision binary64 (sqrt (* 2.0 (/ n (/ k PI)))))
double code(double k, double n) {
return sqrt((2.0 * (n / (k / ((double) M_PI)))));
}
public static double code(double k, double n) {
return Math.sqrt((2.0 * (n / (k / Math.PI))));
}
def code(k, n): return math.sqrt((2.0 * (n / (k / math.pi))))
function code(k, n) return sqrt(Float64(2.0 * Float64(n / Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt((2.0 * (n / (k / pi)))); end
code[k_, n_] := N[Sqrt[N[(2.0 * N[(n / N[(k / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{2 \cdot \frac{n}{\frac{k}{\pi}}}
\end{array}
Initial program 99.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
associate-/l*35.1%
sqrt-div43.5%
*-un-lft-identity43.5%
times-frac43.5%
metadata-eval43.5%
Applied egg-rr43.5%
sqrt-undiv35.1%
*-un-lft-identity35.1%
times-frac35.1%
metadata-eval35.1%
Applied egg-rr35.1%
Final simplification35.1%
(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.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
Taylor expanded in n around 0 35.1%
Final simplification35.1%
(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.5%
Applied egg-rr90.7%
Simplified90.7%
Taylor expanded in k around 0 35.1%
associate-*r*35.1%
*-commutative35.1%
associate-*l*35.1%
Simplified35.1%
associate-*r*35.1%
associate-*r/35.1%
expm1-log1p-u33.5%
expm1-udef33.8%
Applied egg-rr33.8%
expm1-def33.5%
expm1-log1p35.1%
associate-/r/35.1%
Simplified35.1%
Final simplification35.1%
herbie shell --seed 2024017
(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))))