
(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 10 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 (/ 1.0 (/ (sqrt k) (pow (* 2.0 (* PI n)) (- 0.5 (* k 0.5))))))
double code(double k, double n) {
return 1.0 / (sqrt(k) / pow((2.0 * (((double) M_PI) * n)), (0.5 - (k * 0.5))));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) / Math.pow((2.0 * (Math.PI * n)), (0.5 - (k * 0.5))));
}
def code(k, n): return 1.0 / (math.sqrt(k) / math.pow((2.0 * (math.pi * n)), (0.5 - (k * 0.5))))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) / (Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(k * 0.5))))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) / ((2.0 * (pi * n)) ^ (0.5 - (k * 0.5)))); end
code[k_, n_] := N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Power[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(0.5 - N[(k * 0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\sqrt{k}}{{\left(2 \cdot \left(\pi \cdot n\right)\right)}^{\left(0.5 - k \cdot 0.5\right)}}}
\end{array}
Initial program 99.5%
associate-/r/99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 8e-34) (/ (sqrt (* PI n)) (sqrt (/ k 2.0))) (/ 1.0 (sqrt (* k (pow (/ 0.5 (* PI n)) (- 1.0 k)))))))
double code(double k, double n) {
double tmp;
if (k <= 8e-34) {
tmp = sqrt((((double) M_PI) * n)) / sqrt((k / 2.0));
} else {
tmp = 1.0 / sqrt((k * pow((0.5 / (((double) M_PI) * n)), (1.0 - k))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 8e-34) {
tmp = Math.sqrt((Math.PI * n)) / Math.sqrt((k / 2.0));
} else {
tmp = 1.0 / Math.sqrt((k * Math.pow((0.5 / (Math.PI * n)), (1.0 - k))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 8e-34: tmp = math.sqrt((math.pi * n)) / math.sqrt((k / 2.0)) else: tmp = 1.0 / math.sqrt((k * math.pow((0.5 / (math.pi * n)), (1.0 - k)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 8e-34) tmp = Float64(sqrt(Float64(pi * n)) / sqrt(Float64(k / 2.0))); else tmp = Float64(1.0 / sqrt(Float64(k * (Float64(0.5 / Float64(pi * n)) ^ Float64(1.0 - k))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 8e-34) tmp = sqrt((pi * n)) / sqrt((k / 2.0)); else tmp = 1.0 / sqrt((k * ((0.5 / (pi * n)) ^ (1.0 - k)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 8e-34], N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 / N[Sqrt[N[(k * N[Power[N[(0.5 / N[(Pi * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 8 \cdot 10^{-34}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot n}}{\sqrt{\frac{k}{2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\sqrt{k \cdot {\left(\frac{0.5}{\pi \cdot n}\right)}^{\left(1 - k\right)}}}\\
\end{array}
\end{array}
if k < 7.99999999999999942e-34Initial program 99.4%
add-sqr-sqrt99.0%
sqrt-unprod69.9%
*-commutative69.9%
div-inv69.9%
*-commutative69.9%
div-inv69.9%
frac-times69.9%
Applied egg-rr69.9%
Simplified70.1%
pow-sub70.1%
pow170.1%
associate-*r*70.1%
*-commutative70.1%
associate-*r*70.1%
div-inv70.1%
associate-*r*70.1%
*-commutative70.1%
associate-*r*70.1%
Applied egg-rr70.1%
associate-*r/70.1%
*-rgt-identity70.1%
associate-/l*70.0%
associate-/r/70.1%
*-commutative70.1%
associate-*r*70.1%
*-commutative70.1%
Simplified70.1%
Taylor expanded in k around 0 70.1%
associate-*r*70.1%
*-commutative70.1%
associate-*l*70.1%
Simplified70.1%
sqrt-div99.4%
*-commutative99.4%
associate-*r*99.4%
sqrt-unprod99.2%
associate-/l*99.3%
div-inv99.1%
sqrt-undiv99.2%
Applied egg-rr99.2%
associate-*r/99.4%
*-rgt-identity99.4%
Simplified99.4%
if 7.99999999999999942e-34 < k Initial program 99.6%
associate-/r/99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.0%
pow-sub99.1%
metadata-eval99.1%
div-inv99.1%
pow-sub99.0%
associate-*r*99.0%
metadata-eval99.0%
div-sub99.0%
pow-sub99.1%
Applied egg-rr99.0%
pow1/299.0%
div-inv99.0%
unpow-prod-down99.0%
pow1/299.0%
pow-flip99.0%
*-commutative99.0%
associate-*r*99.0%
*-commutative99.0%
Applied egg-rr99.0%
unpow1/299.0%
associate-*r*99.0%
*-commutative99.0%
neg-sub099.0%
associate--r-99.0%
metadata-eval99.0%
Simplified99.0%
Taylor expanded in n around 0 98.4%
Simplified99.0%
Final simplification99.2%
(FPCore (k n) :precision binary64 (if (<= k 7e-34) (/ (sqrt (* PI n)) (sqrt (/ k 2.0))) (sqrt (/ (pow (* PI (* 2.0 n)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 7e-34) {
tmp = sqrt((((double) M_PI) * n)) / sqrt((k / 2.0));
} else {
tmp = sqrt((pow((((double) M_PI) * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 7e-34) {
tmp = Math.sqrt((Math.PI * n)) / Math.sqrt((k / 2.0));
} else {
tmp = Math.sqrt((Math.pow((Math.PI * (2.0 * n)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 7e-34: tmp = math.sqrt((math.pi * n)) / math.sqrt((k / 2.0)) else: tmp = math.sqrt((math.pow((math.pi * (2.0 * n)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 7e-34) tmp = Float64(sqrt(Float64(pi * n)) / sqrt(Float64(k / 2.0))); else tmp = sqrt(Float64((Float64(pi * Float64(2.0 * n)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 7e-34) tmp = sqrt((pi * n)) / sqrt((k / 2.0)); else tmp = sqrt((((pi * (2.0 * n)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 7e-34], N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 7 \cdot 10^{-34}:\\
\;\;\;\;\frac{\sqrt{\pi \cdot n}}{\sqrt{\frac{k}{2}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\pi \cdot \left(2 \cdot n\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 7e-34Initial program 99.4%
add-sqr-sqrt99.0%
sqrt-unprod69.9%
*-commutative69.9%
div-inv69.9%
*-commutative69.9%
div-inv69.9%
frac-times69.9%
Applied egg-rr69.9%
Simplified70.1%
pow-sub70.1%
pow170.1%
associate-*r*70.1%
*-commutative70.1%
associate-*r*70.1%
div-inv70.1%
associate-*r*70.1%
*-commutative70.1%
associate-*r*70.1%
Applied egg-rr70.1%
associate-*r/70.1%
*-rgt-identity70.1%
associate-/l*70.0%
associate-/r/70.1%
*-commutative70.1%
associate-*r*70.1%
*-commutative70.1%
Simplified70.1%
Taylor expanded in k around 0 70.1%
associate-*r*70.1%
*-commutative70.1%
associate-*l*70.1%
Simplified70.1%
sqrt-div99.4%
*-commutative99.4%
associate-*r*99.4%
sqrt-unprod99.2%
associate-/l*99.3%
div-inv99.1%
sqrt-undiv99.2%
Applied egg-rr99.2%
associate-*r/99.4%
*-rgt-identity99.4%
Simplified99.4%
if 7e-34 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.0%
*-commutative99.0%
div-inv99.0%
*-commutative99.0%
div-inv99.0%
frac-times99.0%
Applied egg-rr99.0%
Simplified99.0%
Final simplification99.2%
(FPCore (k n) :precision binary64 (/ (pow (* 2.0 (* PI n)) (- 0.5 (/ k 2.0))) (sqrt k)))
double code(double k, double n) {
return pow((2.0 * (((double) M_PI) * n)), (0.5 - (k / 2.0))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.pow((2.0 * (Math.PI * n)), (0.5 - (k / 2.0))) / Math.sqrt(k);
}
def code(k, n): return math.pow((2.0 * (math.pi * n)), (0.5 - (k / 2.0))) / math.sqrt(k)
function code(k, n) return Float64((Float64(2.0 * Float64(pi * n)) ^ Float64(0.5 - Float64(k / 2.0))) / sqrt(k)) end
function tmp = code(k, n) tmp = ((2.0 * (pi * n)) ^ (0.5 - (k / 2.0))) / sqrt(k); end
code[k_, n_] := N[(N[Power[N[(2.0 * N[(Pi * n), $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(\pi \cdot n\right)\right)}^{\left(0.5 - \frac{k}{2}\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
associate-*l/99.6%
*-lft-identity99.6%
sqr-pow99.4%
pow-sqr99.6%
associate-*l*99.6%
*-commutative99.6%
associate-*l/99.6%
associate-/l*99.6%
metadata-eval99.6%
/-rgt-identity99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ (sqrt n) (sqrt (* 0.5 (/ k PI)))))
double code(double k, double n) {
return sqrt(n) / sqrt((0.5 * (k / ((double) M_PI))));
}
public static double code(double k, double n) {
return Math.sqrt(n) / Math.sqrt((0.5 * (k / Math.PI)));
}
def code(k, n): return math.sqrt(n) / math.sqrt((0.5 * (k / math.pi)))
function code(k, n) return Float64(sqrt(n) / sqrt(Float64(0.5 * Float64(k / pi)))) end
function tmp = code(k, n) tmp = sqrt(n) / sqrt((0.5 * (k / pi))); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] / N[Sqrt[N[(0.5 * N[(k / Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n}}{\sqrt{0.5 \cdot \frac{k}{\pi}}}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.1%
*-commutative86.1%
div-inv86.1%
*-commutative86.1%
div-inv86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
pow-sub86.3%
pow186.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
div-inv86.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
Applied egg-rr86.3%
associate-*r/86.3%
*-rgt-identity86.3%
associate-/l*86.3%
associate-/r/86.3%
*-commutative86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in k around 0 37.0%
associate-*r*37.0%
*-commutative37.0%
associate-*l*37.0%
Simplified37.0%
associate-/l*37.0%
sqrt-div50.0%
*-un-lft-identity50.0%
times-frac50.0%
metadata-eval50.0%
Applied egg-rr50.0%
Final simplification50.0%
(FPCore (k n) :precision binary64 (/ (sqrt (* PI n)) (sqrt (/ k 2.0))))
double code(double k, double n) {
return sqrt((((double) M_PI) * n)) / sqrt((k / 2.0));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * n)) / Math.sqrt((k / 2.0));
}
def code(k, n): return math.sqrt((math.pi * n)) / math.sqrt((k / 2.0))
function code(k, n) return Float64(sqrt(Float64(pi * n)) / sqrt(Float64(k / 2.0))) end
function tmp = code(k, n) tmp = sqrt((pi * n)) / sqrt((k / 2.0)); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * n), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[(k / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\pi \cdot n}}{\sqrt{\frac{k}{2}}}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.1%
*-commutative86.1%
div-inv86.1%
*-commutative86.1%
div-inv86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
pow-sub86.3%
pow186.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
div-inv86.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
Applied egg-rr86.3%
associate-*r/86.3%
*-rgt-identity86.3%
associate-/l*86.3%
associate-/r/86.3%
*-commutative86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in k around 0 37.0%
associate-*r*37.0%
*-commutative37.0%
associate-*l*37.0%
Simplified37.0%
sqrt-div50.1%
*-commutative50.1%
associate-*r*50.1%
sqrt-unprod50.0%
associate-/l*50.0%
div-inv50.0%
sqrt-undiv50.0%
Applied egg-rr50.0%
associate-*r/50.1%
*-rgt-identity50.1%
Simplified50.1%
Final simplification50.1%
(FPCore (k n) :precision binary64 (/ (sqrt (* PI (* 2.0 n))) (sqrt k)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 * n))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 * n))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((math.pi * (2.0 * n))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(2.0 * n))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 * n))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{\pi \cdot \left(2 \cdot n\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.1%
*-commutative86.1%
div-inv86.1%
*-commutative86.1%
div-inv86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
pow-sub86.3%
pow186.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
div-inv86.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
Applied egg-rr86.3%
associate-*r/86.3%
*-rgt-identity86.3%
associate-/l*86.3%
associate-/r/86.3%
*-commutative86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in k around 0 37.0%
associate-*r*37.0%
*-commutative37.0%
associate-*l*37.0%
Simplified37.0%
sqrt-div50.1%
*-commutative50.1%
associate-*r*50.1%
sqrt-unprod50.0%
*-commutative50.0%
sqrt-prod50.0%
associate-*r*50.0%
sqrt-prod49.9%
sqrt-prod50.1%
*-commutative50.1%
*-commutative50.1%
Applied egg-rr50.1%
Final simplification50.1%
(FPCore (k n) :precision binary64 (/ 1.0 (sqrt (/ k (* PI (* 2.0 n))))))
double code(double k, double n) {
return 1.0 / sqrt((k / (((double) M_PI) * (2.0 * n))));
}
public static double code(double k, double n) {
return 1.0 / Math.sqrt((k / (Math.PI * (2.0 * n))));
}
def code(k, n): return 1.0 / math.sqrt((k / (math.pi * (2.0 * n))))
function code(k, n) return Float64(1.0 / sqrt(Float64(k / Float64(pi * Float64(2.0 * n))))) end
function tmp = code(k, n) tmp = 1.0 / sqrt((k / (pi * (2.0 * n)))); end
code[k_, n_] := N[(1.0 / N[Sqrt[N[(k / N[(Pi * N[(2.0 * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt{\frac{k}{\pi \cdot \left(2 \cdot n\right)}}}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.1%
*-commutative86.1%
div-inv86.1%
*-commutative86.1%
div-inv86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
pow-sub86.3%
pow186.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
div-inv86.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
Applied egg-rr86.3%
associate-*r/86.3%
*-rgt-identity86.3%
associate-/l*86.3%
associate-/r/86.3%
*-commutative86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in k around 0 37.0%
associate-*r*37.0%
*-commutative37.0%
associate-*l*37.0%
Simplified37.0%
clear-num37.0%
sqrt-div38.2%
metadata-eval38.2%
associate-*r*38.2%
*-commutative38.2%
*-commutative38.2%
*-commutative38.2%
Applied egg-rr38.2%
Final simplification38.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%
add-sqr-sqrt99.3%
sqrt-unprod86.1%
*-commutative86.1%
div-inv86.1%
*-commutative86.1%
div-inv86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
pow-sub86.3%
pow186.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
div-inv86.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
Applied egg-rr86.3%
associate-*r/86.3%
*-rgt-identity86.3%
associate-/l*86.3%
associate-/r/86.3%
*-commutative86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in k around 0 37.0%
associate-*r*37.0%
*-commutative37.0%
associate-*l*37.0%
Simplified37.0%
Taylor expanded in n around 0 37.0%
associate-/l*37.0%
Simplified37.0%
Final simplification37.0%
(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(Float64(2.0 * pi) * Float64(n / k))) end
function tmp = code(k, n) tmp = sqrt(((2.0 * pi) * (n / k))); end
code[k_, n_] := N[Sqrt[N[(N[(2.0 * Pi), $MachinePrecision] * N[(n / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(2 \cdot \pi\right) \cdot \frac{n}{k}}
\end{array}
Initial program 99.5%
add-sqr-sqrt99.3%
sqrt-unprod86.1%
*-commutative86.1%
div-inv86.1%
*-commutative86.1%
div-inv86.1%
frac-times86.0%
Applied egg-rr86.1%
Simplified86.1%
pow-sub86.3%
pow186.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
div-inv86.3%
associate-*r*86.3%
*-commutative86.3%
associate-*r*86.3%
Applied egg-rr86.3%
associate-*r/86.3%
*-rgt-identity86.3%
associate-/l*86.3%
associate-/r/86.3%
*-commutative86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in k around 0 37.0%
associate-*r*37.0%
*-commutative37.0%
associate-*l*37.0%
Simplified37.0%
*-commutative37.0%
*-un-lft-identity37.0%
times-frac37.0%
Applied egg-rr37.0%
Final simplification37.0%
herbie shell --seed 2024024
(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))))