
(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%
*-commutative99.6%
associate-*r*99.6%
div-sub99.6%
metadata-eval99.6%
associate-*r*99.6%
*-commutative99.6%
associate-*l*99.6%
div-inv99.6%
metadata-eval99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (if (<= k 8e-34) (/ 1.0 (/ (sqrt k) (sqrt (* 2.0 (* PI n))))) (sqrt (/ (pow (* n (* 2.0 PI)) (- 1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 8e-34) {
tmp = 1.0 / (sqrt(k) / sqrt((2.0 * (((double) M_PI) * n))));
} else {
tmp = sqrt((pow((n * (2.0 * ((double) M_PI))), (1.0 - k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 8e-34) {
tmp = 1.0 / (Math.sqrt(k) / Math.sqrt((2.0 * (Math.PI * n))));
} else {
tmp = Math.sqrt((Math.pow((n * (2.0 * Math.PI)), (1.0 - k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 8e-34: tmp = 1.0 / (math.sqrt(k) / math.sqrt((2.0 * (math.pi * n)))) else: tmp = math.sqrt((math.pow((n * (2.0 * math.pi)), (1.0 - k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 8e-34) tmp = Float64(1.0 / Float64(sqrt(k) / sqrt(Float64(2.0 * Float64(pi * n))))); else tmp = sqrt(Float64((Float64(n * Float64(2.0 * pi)) ^ Float64(1.0 - k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 8e-34) tmp = 1.0 / (sqrt(k) / sqrt((2.0 * (pi * n)))); else tmp = sqrt((((n * (2.0 * pi)) ^ (1.0 - k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 8e-34], N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision], N[(1.0 - k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 8 \cdot 10^{-34}:\\
\;\;\;\;\frac{1}{\frac{\sqrt{k}}{\sqrt{2 \cdot \left(\pi \cdot n\right)}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(n \cdot \left(2 \cdot \pi\right)\right)}^{\left(1 - k\right)}}{k}}\\
\end{array}
\end{array}
if k < 7.99999999999999942e-34Initial program 99.4%
Taylor expanded in k around 0 99.1%
associate-*l/99.2%
*-un-lft-identity99.2%
sqrt-unprod99.4%
*-commutative99.4%
*-commutative99.4%
associate-*r*99.4%
clear-num99.5%
associate-*r*99.5%
Applied egg-rr99.5%
if 7.99999999999999942e-34 < k Initial program 99.6%
add-sqr-sqrt99.6%
sqrt-unprod99.0%
*-commutative99.0%
*-commutative99.0%
associate-*r*99.0%
div-sub99.0%
metadata-eval99.0%
div-inv99.0%
*-commutative99.0%
Applied egg-rr99.0%
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.6%
*-lft-identity99.6%
sqr-pow99.4%
sqr-pow99.6%
*-commutative99.6%
associate-*l*99.6%
div-sub99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (k n) :precision binary64 (/ 1.0 (/ (sqrt k) (sqrt (* 2.0 (* PI n))))))
double code(double k, double n) {
return 1.0 / (sqrt(k) / sqrt((2.0 * (((double) M_PI) * n))));
}
public static double code(double k, double n) {
return 1.0 / (Math.sqrt(k) / Math.sqrt((2.0 * (Math.PI * n))));
}
def code(k, n): return 1.0 / (math.sqrt(k) / math.sqrt((2.0 * (math.pi * n))))
function code(k, n) return Float64(1.0 / Float64(sqrt(k) / sqrt(Float64(2.0 * Float64(pi * n))))) end
function tmp = code(k, n) tmp = 1.0 / (sqrt(k) / sqrt((2.0 * (pi * n)))); end
code[k_, n_] := N[(1.0 / N[(N[Sqrt[k], $MachinePrecision] / N[Sqrt[N[(2.0 * N[(Pi * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\frac{\sqrt{k}}{\sqrt{2 \cdot \left(\pi \cdot n\right)}}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 49.9%
associate-*l/50.0%
*-un-lft-identity50.0%
sqrt-unprod50.1%
*-commutative50.1%
*-commutative50.1%
associate-*r*50.1%
clear-num50.1%
associate-*r*50.1%
Applied egg-rr50.1%
Final simplification50.1%
(FPCore (k n) :precision binary64 (* (sqrt (* PI (/ 2.0 k))) (sqrt n)))
double code(double k, double n) {
return sqrt((((double) M_PI) * (2.0 / k))) * sqrt(n);
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * (2.0 / k))) * Math.sqrt(n);
}
def code(k, n): return math.sqrt((math.pi * (2.0 / k))) * math.sqrt(n)
function code(k, n) return Float64(sqrt(Float64(pi * Float64(2.0 / k))) * sqrt(n)) end
function tmp = code(k, n) tmp = sqrt((pi * (2.0 / k))) * sqrt(n); end
code[k_, n_] := N[(N[Sqrt[N[(Pi * N[(2.0 / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[n], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \frac{2}{k}} \cdot \sqrt{n}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 49.9%
expm1-log1p-u47.4%
expm1-udef46.7%
associate-*l/46.7%
*-un-lft-identity46.7%
sqrt-unprod46.7%
*-commutative46.7%
*-commutative46.7%
associate-*r*46.7%
sqrt-undiv34.9%
associate-*r*34.9%
Applied egg-rr34.9%
expm1-def35.6%
expm1-log1p37.0%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
associate-/r/37.0%
associate-*r*37.0%
Applied egg-rr37.0%
pow1/237.0%
associate-*l*37.0%
*-commutative37.0%
associate-*r*37.0%
unpow-prod-down49.7%
*-commutative49.7%
pow1/249.7%
Applied egg-rr49.7%
unpow1/249.7%
Simplified49.7%
Final simplification49.7%
(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 49.9%
expm1-log1p-u47.4%
expm1-udef46.7%
associate-*l/46.7%
*-un-lft-identity46.7%
sqrt-unprod46.7%
*-commutative46.7%
*-commutative46.7%
associate-*r*46.7%
sqrt-undiv34.9%
associate-*r*34.9%
Applied egg-rr34.9%
expm1-def35.6%
expm1-log1p37.0%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
associate-/r/37.0%
sqrt-prod50.0%
*-commutative50.0%
Applied egg-rr50.0%
Final simplification50.0%
(FPCore (k n) :precision binary64 (/ (sqrt (* n (* 2.0 PI))) (sqrt k)))
double code(double k, double n) {
return sqrt((n * (2.0 * ((double) M_PI)))) / sqrt(k);
}
public static double code(double k, double n) {
return Math.sqrt((n * (2.0 * Math.PI))) / Math.sqrt(k);
}
def code(k, n): return math.sqrt((n * (2.0 * math.pi))) / math.sqrt(k)
function code(k, n) return Float64(sqrt(Float64(n * Float64(2.0 * pi))) / sqrt(k)) end
function tmp = code(k, n) tmp = sqrt((n * (2.0 * pi))) / sqrt(k); end
code[k_, n_] := N[(N[Sqrt[N[(n * N[(2.0 * Pi), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt{n \cdot \left(2 \cdot \pi\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 49.9%
associate-*l/50.0%
*-un-lft-identity50.0%
sqrt-unprod50.1%
*-commutative50.1%
*-commutative50.1%
associate-*r*50.1%
clear-num50.1%
associate-*r*50.1%
Applied egg-rr50.1%
associate-/r/50.1%
/-rgt-identity50.1%
times-frac50.1%
*-lft-identity50.1%
*-commutative50.1%
*-commutative50.1%
associate-*l*50.1%
*-commutative50.1%
*-rgt-identity50.1%
Simplified50.1%
Final simplification50.1%
(FPCore (k n) :precision binary64 (pow (* 0.5 (/ k (* PI n))) -0.5))
double code(double k, double n) {
return pow((0.5 * (k / (((double) M_PI) * n))), -0.5);
}
public static double code(double k, double n) {
return Math.pow((0.5 * (k / (Math.PI * n))), -0.5);
}
def code(k, n): return math.pow((0.5 * (k / (math.pi * n))), -0.5)
function code(k, n) return Float64(0.5 * Float64(k / Float64(pi * n))) ^ -0.5 end
function tmp = code(k, n) tmp = (0.5 * (k / (pi * n))) ^ -0.5; end
code[k_, n_] := N[Power[N[(0.5 * N[(k / N[(Pi * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.5], $MachinePrecision]
\begin{array}{l}
\\
{\left(0.5 \cdot \frac{k}{\pi \cdot n}\right)}^{-0.5}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0 49.9%
expm1-log1p-u47.4%
expm1-udef46.7%
associate-*l/46.7%
*-un-lft-identity46.7%
sqrt-unprod46.7%
*-commutative46.7%
*-commutative46.7%
associate-*r*46.7%
sqrt-undiv34.9%
associate-*r*34.9%
Applied egg-rr34.9%
expm1-def35.6%
expm1-log1p37.0%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
associate-/r/37.0%
associate-*r*37.0%
Applied egg-rr37.0%
associate-*l/37.0%
associate-/l*37.0%
associate-/r/37.0%
div-inv37.0%
metadata-eval37.0%
clear-num37.0%
times-frac37.0%
*-commutative37.0%
associate-/l*37.0%
metadata-eval37.0%
add-sqr-sqrt36.9%
frac-times36.9%
sqrt-unprod38.0%
add-sqr-sqrt38.2%
pow1/238.2%
pow-flip38.3%
Applied egg-rr38.2%
associate-/l/38.2%
Simplified38.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%
Taylor expanded in k around 0 49.9%
expm1-log1p-u47.4%
expm1-udef46.7%
associate-*l/46.7%
*-un-lft-identity46.7%
sqrt-unprod46.7%
*-commutative46.7%
*-commutative46.7%
associate-*r*46.7%
sqrt-undiv34.9%
associate-*r*34.9%
Applied egg-rr34.9%
expm1-def35.6%
expm1-log1p37.0%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
associate-/r/37.0%
associate-*r*37.0%
Applied egg-rr37.0%
Taylor expanded in k around 0 37.0%
associate-/l*37.0%
Simplified37.0%
Final simplification37.0%
(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.5%
Taylor expanded in k around 0 49.9%
expm1-log1p-u47.4%
expm1-udef46.7%
associate-*l/46.7%
*-un-lft-identity46.7%
sqrt-unprod46.7%
*-commutative46.7%
*-commutative46.7%
associate-*r*46.7%
sqrt-undiv34.9%
associate-*r*34.9%
Applied egg-rr34.9%
expm1-def35.6%
expm1-log1p37.0%
associate-/l*37.0%
*-commutative37.0%
Simplified37.0%
associate-/r/37.0%
associate-*r*37.0%
Applied egg-rr37.0%
Taylor expanded in k around 0 37.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))))