
(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}
Herbie found 7 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 (/ (pow (* n (+ PI PI)) (fma k -0.5 0.5)) (sqrt k)))
double code(double k, double n) {
return pow((n * (((double) M_PI) + ((double) M_PI))), fma(k, -0.5, 0.5)) / sqrt(k);
}
function code(k, n) return Float64((Float64(n * Float64(pi + pi)) ^ fma(k, -0.5, 0.5)) / sqrt(k)) end
code[k_, n_] := N[(N[Power[N[(n * N[(Pi + Pi), $MachinePrecision]), $MachinePrecision], N[(k * -0.5 + 0.5), $MachinePrecision]], $MachinePrecision] / N[Sqrt[k], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{{\left(n \cdot \left(\pi + \pi\right)\right)}^{\left(\mathsf{fma}\left(k, -0.5, 0.5\right)\right)}}{\sqrt{k}}
\end{array}
Initial program 99.5%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6499.5
Applied rewrites99.5%
(FPCore (k n) :precision binary64 (if (<= k 1.7e-50) (* (sqrt n) (sqrt (/ (+ PI PI) k))) (sqrt (/ (pow (* (+ n n) PI) (fma k -1.0 1.0)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.7e-50) {
tmp = sqrt(n) * sqrt(((((double) M_PI) + ((double) M_PI)) / k));
} else {
tmp = sqrt((pow(((n + n) * ((double) M_PI)), fma(k, -1.0, 1.0)) / k));
}
return tmp;
}
function code(k, n) tmp = 0.0 if (k <= 1.7e-50) tmp = Float64(sqrt(n) * sqrt(Float64(Float64(pi + pi) / k))); else tmp = sqrt(Float64((Float64(Float64(n + n) * pi) ^ fma(k, -1.0, 1.0)) / k)); end return tmp end
code[k_, n_] := If[LessEqual[k, 1.7e-50], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(n + n), $MachinePrecision] * Pi), $MachinePrecision], N[(k * -1.0 + 1.0), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1.7 \cdot 10^{-50}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\frac{\pi + \pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(n + n\right) \cdot \pi\right)}^{\left(\mathsf{fma}\left(k, -1, 1\right)\right)}}{k}}\\
\end{array}
\end{array}
if k < 1.70000000000000007e-50Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-+.f64N/A
div-addN/A
distribute-lft-inN/A
distribute-rgt-outN/A
lift-+.f64N/A
sqrt-unprodN/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites49.5%
if 1.70000000000000007e-50 < k Initial program 99.5%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6499.5
Applied rewrites99.5%
lift-/.f64N/A
lift-pow.f64N/A
exp-to-powN/A
lift-log.f64N/A
lift-*.f64N/A
exp-fabsN/A
lift-exp.f64N/A
rem-sqrt-square-revN/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites88.0%
lift-*.f64N/A
lift-fma.f64N/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
metadata-evalN/A
lower-fma.f6488.0
Applied rewrites88.0%
(FPCore (k n) :precision binary64 (if (<= k 1.0) (* (sqrt n) (sqrt (/ (+ PI PI) k))) (sqrt (/ (pow (* (+ n n) PI) (* -1.0 k)) k))))
double code(double k, double n) {
double tmp;
if (k <= 1.0) {
tmp = sqrt(n) * sqrt(((((double) M_PI) + ((double) M_PI)) / k));
} else {
tmp = sqrt((pow(((n + n) * ((double) M_PI)), (-1.0 * k)) / k));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 1.0) {
tmp = Math.sqrt(n) * Math.sqrt(((Math.PI + Math.PI) / k));
} else {
tmp = Math.sqrt((Math.pow(((n + n) * Math.PI), (-1.0 * k)) / k));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 1.0: tmp = math.sqrt(n) * math.sqrt(((math.pi + math.pi) / k)) else: tmp = math.sqrt((math.pow(((n + n) * math.pi), (-1.0 * k)) / k)) return tmp
function code(k, n) tmp = 0.0 if (k <= 1.0) tmp = Float64(sqrt(n) * sqrt(Float64(Float64(pi + pi) / k))); else tmp = sqrt(Float64((Float64(Float64(n + n) * pi) ^ Float64(-1.0 * k)) / k)); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 1.0) tmp = sqrt(n) * sqrt(((pi + pi) / k)); else tmp = sqrt(((((n + n) * pi) ^ (-1.0 * k)) / k)); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 1.0], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[Power[N[(N[(n + n), $MachinePrecision] * Pi), $MachinePrecision], N[(-1.0 * k), $MachinePrecision]], $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 1:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\frac{\pi + \pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{{\left(\left(n + n\right) \cdot \pi\right)}^{\left(-1 \cdot k\right)}}{k}}\\
\end{array}
\end{array}
if k < 1Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-+.f64N/A
div-addN/A
distribute-lft-inN/A
distribute-rgt-outN/A
lift-+.f64N/A
sqrt-unprodN/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites49.5%
if 1 < k Initial program 99.5%
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6499.5
Applied rewrites99.5%
lift-/.f64N/A
lift-pow.f64N/A
exp-to-powN/A
lift-log.f64N/A
lift-*.f64N/A
exp-fabsN/A
lift-exp.f64N/A
rem-sqrt-square-revN/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites88.0%
Taylor expanded in k around inf
lower-*.f6453.6
Applied rewrites53.6%
(FPCore (k n)
:precision binary64
(if (<= k 7e-8)
(* (sqrt n) (sqrt (/ (+ PI PI) k)))
(if (<= k 1.16e+176)
(* n (sqrt (* 2.0 (/ PI (* k n)))))
(sqrt (log (exp (* (/ (+ n n) k) PI)))))))
double code(double k, double n) {
double tmp;
if (k <= 7e-8) {
tmp = sqrt(n) * sqrt(((((double) M_PI) + ((double) M_PI)) / k));
} else if (k <= 1.16e+176) {
tmp = n * sqrt((2.0 * (((double) M_PI) / (k * n))));
} else {
tmp = sqrt(log(exp((((n + n) / k) * ((double) M_PI)))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 7e-8) {
tmp = Math.sqrt(n) * Math.sqrt(((Math.PI + Math.PI) / k));
} else if (k <= 1.16e+176) {
tmp = n * Math.sqrt((2.0 * (Math.PI / (k * n))));
} else {
tmp = Math.sqrt(Math.log(Math.exp((((n + n) / k) * Math.PI))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 7e-8: tmp = math.sqrt(n) * math.sqrt(((math.pi + math.pi) / k)) elif k <= 1.16e+176: tmp = n * math.sqrt((2.0 * (math.pi / (k * n)))) else: tmp = math.sqrt(math.log(math.exp((((n + n) / k) * math.pi)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 7e-8) tmp = Float64(sqrt(n) * sqrt(Float64(Float64(pi + pi) / k))); elseif (k <= 1.16e+176) tmp = Float64(n * sqrt(Float64(2.0 * Float64(pi / Float64(k * n))))); else tmp = sqrt(log(exp(Float64(Float64(Float64(n + n) / k) * pi)))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 7e-8) tmp = sqrt(n) * sqrt(((pi + pi) / k)); elseif (k <= 1.16e+176) tmp = n * sqrt((2.0 * (pi / (k * n)))); else tmp = sqrt(log(exp((((n + n) / k) * pi)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 7e-8], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 1.16e+176], N[(n * N[Sqrt[N[(2.0 * N[(Pi / N[(k * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[Log[N[Exp[N[(N[(N[(n + n), $MachinePrecision] / k), $MachinePrecision] * Pi), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 7 \cdot 10^{-8}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\frac{\pi + \pi}{k}}\\
\mathbf{elif}\;k \leq 1.16 \cdot 10^{+176}:\\
\;\;\;\;n \cdot \sqrt{2 \cdot \frac{\pi}{k \cdot n}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\log \left(e^{\frac{n + n}{k} \cdot \pi}\right)}\\
\end{array}
\end{array}
if k < 7.00000000000000048e-8Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-+.f64N/A
div-addN/A
distribute-lft-inN/A
distribute-rgt-outN/A
lift-+.f64N/A
sqrt-unprodN/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites49.5%
if 7.00000000000000048e-8 < k < 1.16e176Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
Taylor expanded in n around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
if 1.16e176 < k Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
lift-*.f64N/A
*-commutativeN/A
lift-PI.f64N/A
add-log-expN/A
log-pow-revN/A
lower-log.f64N/A
lift-PI.f64N/A
pow-expN/A
lift-/.f64N/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
lift-/.f64N/A
lower-exp.f6414.7
lift-/.f64N/A
lift-*.f64N/A
associate-*l/N/A
lift-/.f64N/A
lower-*.f6414.7
Applied rewrites14.7%
(FPCore (k n) :precision binary64 (if (<= k 7e-8) (* (sqrt n) (sqrt (/ (+ PI PI) k))) (* n (sqrt (* 2.0 (/ PI (* k n)))))))
double code(double k, double n) {
double tmp;
if (k <= 7e-8) {
tmp = sqrt(n) * sqrt(((((double) M_PI) + ((double) M_PI)) / k));
} else {
tmp = n * sqrt((2.0 * (((double) M_PI) / (k * n))));
}
return tmp;
}
public static double code(double k, double n) {
double tmp;
if (k <= 7e-8) {
tmp = Math.sqrt(n) * Math.sqrt(((Math.PI + Math.PI) / k));
} else {
tmp = n * Math.sqrt((2.0 * (Math.PI / (k * n))));
}
return tmp;
}
def code(k, n): tmp = 0 if k <= 7e-8: tmp = math.sqrt(n) * math.sqrt(((math.pi + math.pi) / k)) else: tmp = n * math.sqrt((2.0 * (math.pi / (k * n)))) return tmp
function code(k, n) tmp = 0.0 if (k <= 7e-8) tmp = Float64(sqrt(n) * sqrt(Float64(Float64(pi + pi) / k))); else tmp = Float64(n * sqrt(Float64(2.0 * Float64(pi / Float64(k * n))))); end return tmp end
function tmp_2 = code(k, n) tmp = 0.0; if (k <= 7e-8) tmp = sqrt(n) * sqrt(((pi + pi) / k)); else tmp = n * sqrt((2.0 * (pi / (k * n)))); end tmp_2 = tmp; end
code[k_, n_] := If[LessEqual[k, 7e-8], N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(n * N[Sqrt[N[(2.0 * N[(Pi / N[(k * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;k \leq 7 \cdot 10^{-8}:\\
\;\;\;\;\sqrt{n} \cdot \sqrt{\frac{\pi + \pi}{k}}\\
\mathbf{else}:\\
\;\;\;\;n \cdot \sqrt{2 \cdot \frac{\pi}{k \cdot n}}\\
\end{array}
\end{array}
if k < 7.00000000000000048e-8Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-+.f64N/A
div-addN/A
distribute-lft-inN/A
distribute-rgt-outN/A
lift-+.f64N/A
sqrt-unprodN/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites49.5%
if 7.00000000000000048e-8 < k Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
Taylor expanded in n around inf
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-PI.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
(FPCore (k n) :precision binary64 (* (sqrt n) (sqrt (/ (+ PI PI) k))))
double code(double k, double n) {
return sqrt(n) * sqrt(((((double) M_PI) + ((double) M_PI)) / k));
}
public static double code(double k, double n) {
return Math.sqrt(n) * Math.sqrt(((Math.PI + Math.PI) / k));
}
def code(k, n): return math.sqrt(n) * math.sqrt(((math.pi + math.pi) / k))
function code(k, n) return Float64(sqrt(n) * sqrt(Float64(Float64(pi + pi) / k))) end
function tmp = code(k, n) tmp = sqrt(n) * sqrt(((pi + pi) / k)); end
code[k_, n_] := N[(N[Sqrt[n], $MachinePrecision] * N[Sqrt[N[(N[(Pi + Pi), $MachinePrecision] / k), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt{n} \cdot \sqrt{\frac{\pi + \pi}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
lift-+.f64N/A
div-addN/A
distribute-lft-inN/A
distribute-rgt-outN/A
lift-+.f64N/A
sqrt-unprodN/A
sqrt-undivN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
Applied rewrites49.5%
(FPCore (k n) :precision binary64 (sqrt (* PI (/ (+ n n) k))))
double code(double k, double n) {
return sqrt((((double) M_PI) * ((n + n) / k)));
}
public static double code(double k, double n) {
return Math.sqrt((Math.PI * ((n + n) / k)));
}
def code(k, n): return math.sqrt((math.pi * ((n + n) / k)))
function code(k, n) return sqrt(Float64(pi * Float64(Float64(n + n) / k))) end
function tmp = code(k, n) tmp = sqrt((pi * ((n + n) / k))); end
code[k_, n_] := N[Sqrt[N[(Pi * N[(N[(n + n), $MachinePrecision] / k), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\pi \cdot \frac{n + n}{k}}
\end{array}
Initial program 99.5%
Taylor expanded in k around 0
lower-/.f64N/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-PI.f64N/A
lower-sqrt.f6449.5
Applied rewrites49.5%
lift-/.f64N/A
lift-pow.f64N/A
unpow1/2N/A
lift-*.f64N/A
count-2-revN/A
lift-*.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-+.f64N/A
lift-*.f64N/A
lift-sqrt.f64N/A
sqrt-undivN/A
lower-sqrt.f64N/A
lower-/.f6438.1
Applied rewrites38.1%
lift-/.f64N/A
mult-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-/.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-/.f64N/A
mult-flip-revN/A
lower-/.f6438.1
Applied rewrites38.1%
herbie shell --seed 2025159
(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))))