
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
double code(double N) {
return log((N + 1.0)) - log(N);
}
real(8) function code(n)
real(8), intent (in) :: n
code = log((n + 1.0d0)) - log(n)
end function
public static double code(double N) {
return Math.log((N + 1.0)) - Math.log(N);
}
def code(N): return math.log((N + 1.0)) - math.log(N)
function code(N) return Float64(log(Float64(N + 1.0)) - log(N)) end
function tmp = code(N) tmp = log((N + 1.0)) - log(N); end
code[N_] := N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log \left(N + 1\right) - \log N
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
double code(double N) {
return log((N + 1.0)) - log(N);
}
real(8) function code(n)
real(8), intent (in) :: n
code = log((n + 1.0d0)) - log(n)
end function
public static double code(double N) {
return Math.log((N + 1.0)) - Math.log(N);
}
def code(N): return math.log((N + 1.0)) - math.log(N)
function code(N) return Float64(log(Float64(N + 1.0)) - log(N)) end
function tmp = code(N) tmp = log((N + 1.0)) - log(N); end
code[N_] := N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\log \left(N + 1\right) - \log N
\end{array}
(FPCore (N)
:precision binary64
(let* ((t_0 (log (fma N N N))))
(if (<= (- (log (+ N 1.0)) (log N)) 0.0006)
(/
1.0
(+
N
(/
(fma N (fma N 0.5 -0.08333333333333333) 0.041666666666666664)
(* N N))))
(* (* t_0 (/ -1.0 t_0)) (log (/ N (+ N 1.0)))))))
double code(double N) {
double t_0 = log(fma(N, N, N));
double tmp;
if ((log((N + 1.0)) - log(N)) <= 0.0006) {
tmp = 1.0 / (N + (fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / (N * N)));
} else {
tmp = (t_0 * (-1.0 / t_0)) * log((N / (N + 1.0)));
}
return tmp;
}
function code(N) t_0 = log(fma(N, N, N)) tmp = 0.0 if (Float64(log(Float64(N + 1.0)) - log(N)) <= 0.0006) tmp = Float64(1.0 / Float64(N + Float64(fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / Float64(N * N)))); else tmp = Float64(Float64(t_0 * Float64(-1.0 / t_0)) * log(Float64(N / Float64(N + 1.0)))); end return tmp end
code[N_] := Block[{t$95$0 = N[Log[N[(N * N + N), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision], 0.0006], N[(1.0 / N[(N + N[(N[(N * N[(N * 0.5 + -0.08333333333333333), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision] * N[Log[N[(N / N[(N + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \log \left(\mathsf{fma}\left(N, N, N\right)\right)\\
\mathbf{if}\;\log \left(N + 1\right) - \log N \leq 0.0006:\\
\;\;\;\;\frac{1}{N + \frac{\mathsf{fma}\left(N, \mathsf{fma}\left(N, 0.5, -0.08333333333333333\right), 0.041666666666666664\right)}{N \cdot N}}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_0 \cdot \frac{-1}{t\_0}\right) \cdot \log \left(\frac{N}{N + 1}\right)\\
\end{array}
\end{array}
if (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) < 5.99999999999999947e-4Initial program 15.9%
Taylor expanded in N around inf
Simplified99.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6499.9
Applied egg-rr99.9%
Taylor expanded in N around inf
associate--l+N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
associate--l+N/A
lower-+.f64N/A
Simplified99.9%
Taylor expanded in N around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.9
Simplified99.9%
if 5.99999999999999947e-4 < (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) Initial program 92.2%
Applied egg-rr94.7%
lift-fma.f64N/A
lift-log.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-log.f64N/A
lift-fma.f64N/A
lift-log.f64N/A
lift-neg.f64N/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
Applied egg-rr94.9%
Final simplification99.6%
(FPCore (N)
:precision binary64
(if (<= (- (log (+ N 1.0)) (log N)) 0.0006)
(/
1.0
(+
N
(/
(fma N (fma N 0.5 -0.08333333333333333) 0.041666666666666664)
(* N N))))
(/ 1.0 (/ -1.0 (log (/ N (+ N 1.0)))))))
double code(double N) {
double tmp;
if ((log((N + 1.0)) - log(N)) <= 0.0006) {
tmp = 1.0 / (N + (fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / (N * N)));
} else {
tmp = 1.0 / (-1.0 / log((N / (N + 1.0))));
}
return tmp;
}
function code(N) tmp = 0.0 if (Float64(log(Float64(N + 1.0)) - log(N)) <= 0.0006) tmp = Float64(1.0 / Float64(N + Float64(fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / Float64(N * N)))); else tmp = Float64(1.0 / Float64(-1.0 / log(Float64(N / Float64(N + 1.0))))); end return tmp end
code[N_] := If[LessEqual[N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision], 0.0006], N[(1.0 / N[(N + N[(N[(N * N[(N * 0.5 + -0.08333333333333333), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(-1.0 / N[Log[N[(N / N[(N + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\log \left(N + 1\right) - \log N \leq 0.0006:\\
\;\;\;\;\frac{1}{N + \frac{\mathsf{fma}\left(N, \mathsf{fma}\left(N, 0.5, -0.08333333333333333\right), 0.041666666666666664\right)}{N \cdot N}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{-1}{\log \left(\frac{N}{N + 1}\right)}}\\
\end{array}
\end{array}
if (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) < 5.99999999999999947e-4Initial program 15.9%
Taylor expanded in N around inf
Simplified99.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6499.9
Applied egg-rr99.9%
Taylor expanded in N around inf
associate--l+N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
associate--l+N/A
lower-+.f64N/A
Simplified99.9%
Taylor expanded in N around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.9
Simplified99.9%
if 5.99999999999999947e-4 < (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) Initial program 92.2%
Applied egg-rr94.7%
lift-+.f64N/A
log-divN/A
lift-log.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-log1p.f64N/A
lower--.f6492.3
Applied egg-rr92.3%
Applied egg-rr94.8%
Applied egg-rr94.8%
(FPCore (N)
:precision binary64
(if (<= (- (log (+ N 1.0)) (log N)) 0.0006)
(/
1.0
(+
N
(/
(fma N (fma N 0.5 -0.08333333333333333) 0.041666666666666664)
(* N N))))
(- (log (/ N (+ N 1.0))))))
double code(double N) {
double tmp;
if ((log((N + 1.0)) - log(N)) <= 0.0006) {
tmp = 1.0 / (N + (fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / (N * N)));
} else {
tmp = -log((N / (N + 1.0)));
}
return tmp;
}
function code(N) tmp = 0.0 if (Float64(log(Float64(N + 1.0)) - log(N)) <= 0.0006) tmp = Float64(1.0 / Float64(N + Float64(fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / Float64(N * N)))); else tmp = Float64(-log(Float64(N / Float64(N + 1.0)))); end return tmp end
code[N_] := If[LessEqual[N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision], 0.0006], N[(1.0 / N[(N + N[(N[(N * N[(N * 0.5 + -0.08333333333333333), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[Log[N[(N / N[(N + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\log \left(N + 1\right) - \log N \leq 0.0006:\\
\;\;\;\;\frac{1}{N + \frac{\mathsf{fma}\left(N, \mathsf{fma}\left(N, 0.5, -0.08333333333333333\right), 0.041666666666666664\right)}{N \cdot N}}\\
\mathbf{else}:\\
\;\;\;\;-\log \left(\frac{N}{N + 1}\right)\\
\end{array}
\end{array}
if (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) < 5.99999999999999947e-4Initial program 15.9%
Taylor expanded in N around inf
Simplified99.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6499.9
Applied egg-rr99.9%
Taylor expanded in N around inf
associate--l+N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
associate--l+N/A
lower-+.f64N/A
Simplified99.9%
Taylor expanded in N around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.9
Simplified99.9%
if 5.99999999999999947e-4 < (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) Initial program 92.2%
lift-+.f64N/A
diff-logN/A
clear-numN/A
log-recN/A
diff-logN/A
lift-log.f64N/A
lift-log.f64N/A
lower-neg.f64N/A
lift-log.f64N/A
lift-log.f64N/A
diff-logN/A
lower-log.f64N/A
lower-/.f6494.7
Applied egg-rr94.7%
(FPCore (N)
:precision binary64
(if (<= (- (log (+ N 1.0)) (log N)) 0.001)
(/
1.0
(+
N
(/
(fma N (fma N 0.5 -0.08333333333333333) 0.041666666666666664)
(* N N))))
(log (+ 1.0 (/ 1.0 N)))))
double code(double N) {
double tmp;
if ((log((N + 1.0)) - log(N)) <= 0.001) {
tmp = 1.0 / (N + (fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / (N * N)));
} else {
tmp = log((1.0 + (1.0 / N)));
}
return tmp;
}
function code(N) tmp = 0.0 if (Float64(log(Float64(N + 1.0)) - log(N)) <= 0.001) tmp = Float64(1.0 / Float64(N + Float64(fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / Float64(N * N)))); else tmp = log(Float64(1.0 + Float64(1.0 / N))); end return tmp end
code[N_] := If[LessEqual[N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision], 0.001], N[(1.0 / N[(N + N[(N[(N * N[(N * 0.5 + -0.08333333333333333), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Log[N[(1.0 + N[(1.0 / N), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\log \left(N + 1\right) - \log N \leq 0.001:\\
\;\;\;\;\frac{1}{N + \frac{\mathsf{fma}\left(N, \mathsf{fma}\left(N, 0.5, -0.08333333333333333\right), 0.041666666666666664\right)}{N \cdot N}}\\
\mathbf{else}:\\
\;\;\;\;\log \left(1 + \frac{1}{N}\right)\\
\end{array}
\end{array}
if (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) < 1e-3Initial program 16.1%
Taylor expanded in N around inf
Simplified99.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6499.8
Applied egg-rr99.8%
Taylor expanded in N around inf
associate--l+N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
associate--l+N/A
lower-+.f64N/A
Simplified99.9%
Taylor expanded in N around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.9
Simplified99.9%
if 1e-3 < (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) Initial program 92.9%
lift-+.f64N/A
diff-logN/A
lower-log.f64N/A
lower-/.f6493.3
Applied egg-rr93.3%
Taylor expanded in N around inf
lower-+.f64N/A
lower-/.f6493.4
Simplified93.4%
(FPCore (N) :precision binary64 (/ 1.0 (+ N (/ (fma N (fma N 0.5 -0.08333333333333333) 0.041666666666666664) (* N N)))))
double code(double N) {
return 1.0 / (N + (fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / (N * N)));
}
function code(N) return Float64(1.0 / Float64(N + Float64(fma(N, fma(N, 0.5, -0.08333333333333333), 0.041666666666666664) / Float64(N * N)))) end
code[N_] := N[(1.0 / N[(N + N[(N[(N * N[(N * 0.5 + -0.08333333333333333), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{N + \frac{\mathsf{fma}\left(N, \mathsf{fma}\left(N, 0.5, -0.08333333333333333\right), 0.041666666666666664\right)}{N \cdot N}}
\end{array}
Initial program 21.2%
Taylor expanded in N around inf
Simplified96.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6496.8
Applied egg-rr96.8%
Taylor expanded in N around inf
associate--l+N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
associate--l+N/A
lower-+.f64N/A
Simplified97.2%
Taylor expanded in N around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6497.2
Simplified97.2%
(FPCore (N) :precision binary64 (/ 1.0 (+ N (+ 0.5 (/ -0.08333333333333333 N)))))
double code(double N) {
return 1.0 / (N + (0.5 + (-0.08333333333333333 / N)));
}
real(8) function code(n)
real(8), intent (in) :: n
code = 1.0d0 / (n + (0.5d0 + ((-0.08333333333333333d0) / n)))
end function
public static double code(double N) {
return 1.0 / (N + (0.5 + (-0.08333333333333333 / N)));
}
def code(N): return 1.0 / (N + (0.5 + (-0.08333333333333333 / N)))
function code(N) return Float64(1.0 / Float64(N + Float64(0.5 + Float64(-0.08333333333333333 / N)))) end
function tmp = code(N) tmp = 1.0 / (N + (0.5 + (-0.08333333333333333 / N))); end
code[N_] := N[(1.0 / N[(N + N[(0.5 + N[(-0.08333333333333333 / N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{N + \left(0.5 + \frac{-0.08333333333333333}{N}\right)}
\end{array}
Initial program 21.2%
Taylor expanded in N around inf
Simplified96.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6496.8
Applied egg-rr96.8%
Taylor expanded in N around inf
associate--l+N/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-+.f64N/A
lower-*.f64N/A
+-commutativeN/A
associate--l+N/A
lower-+.f64N/A
Simplified97.2%
Taylor expanded in N around inf
sub-negN/A
lower-+.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f6496.2
Simplified96.2%
(FPCore (N) :precision binary64 (/ 1.0 (+ N 0.5)))
double code(double N) {
return 1.0 / (N + 0.5);
}
real(8) function code(n)
real(8), intent (in) :: n
code = 1.0d0 / (n + 0.5d0)
end function
public static double code(double N) {
return 1.0 / (N + 0.5);
}
def code(N): return 1.0 / (N + 0.5)
function code(N) return Float64(1.0 / Float64(N + 0.5)) end
function tmp = code(N) tmp = 1.0 / (N + 0.5); end
code[N_] := N[(1.0 / N[(N + 0.5), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{N + 0.5}
\end{array}
Initial program 21.2%
Taylor expanded in N around inf
Simplified96.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6496.8
Applied egg-rr96.8%
Taylor expanded in N around inf
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
lower-+.f6494.2
Simplified94.2%
(FPCore (N) :precision binary64 (/ 1.0 N))
double code(double N) {
return 1.0 / N;
}
real(8) function code(n)
real(8), intent (in) :: n
code = 1.0d0 / n
end function
public static double code(double N) {
return 1.0 / N;
}
def code(N): return 1.0 / N
function code(N) return Float64(1.0 / N) end
function tmp = code(N) tmp = 1.0 / N; end
code[N_] := N[(1.0 / N), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{N}
\end{array}
Initial program 21.2%
Taylor expanded in N around inf
lower-/.f6486.6
Simplified86.6%
(FPCore (N) :precision binary64 2.0)
double code(double N) {
return 2.0;
}
real(8) function code(n)
real(8), intent (in) :: n
code = 2.0d0
end function
public static double code(double N) {
return 2.0;
}
def code(N): return 2.0
function code(N) return 2.0 end
function tmp = code(N) tmp = 2.0; end
code[N_] := 2.0
\begin{array}{l}
\\
2
\end{array}
Initial program 21.2%
Taylor expanded in N around inf
Simplified96.8%
lift-/.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift--.f64N/A
lift-/.f64N/A
lift-+.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6496.8
Applied egg-rr96.8%
Taylor expanded in N around inf
distribute-rgt-inN/A
*-lft-identityN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
lower-+.f6494.2
Simplified94.2%
Taylor expanded in N around 0
Simplified9.7%
(FPCore (N) :precision binary64 (log1p (/ 1.0 N)))
double code(double N) {
return log1p((1.0 / N));
}
public static double code(double N) {
return Math.log1p((1.0 / N));
}
def code(N): return math.log1p((1.0 / N))
function code(N) return log1p(Float64(1.0 / N)) end
code[N_] := N[Log[1 + N[(1.0 / N), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\mathsf{log1p}\left(\frac{1}{N}\right)
\end{array}
(FPCore (N) :precision binary64 (log (+ 1.0 (/ 1.0 N))))
double code(double N) {
return log((1.0 + (1.0 / N)));
}
real(8) function code(n)
real(8), intent (in) :: n
code = log((1.0d0 + (1.0d0 / n)))
end function
public static double code(double N) {
return Math.log((1.0 + (1.0 / N)));
}
def code(N): return math.log((1.0 + (1.0 / N)))
function code(N) return log(Float64(1.0 + Float64(1.0 / N))) end
function tmp = code(N) tmp = log((1.0 + (1.0 / N))); end
code[N_] := N[Log[N[(1.0 + N[(1.0 / N), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\log \left(1 + \frac{1}{N}\right)
\end{array}
(FPCore (N) :precision binary64 (+ (+ (+ (/ 1.0 N) (/ -1.0 (* 2.0 (pow N 2.0)))) (/ 1.0 (* 3.0 (pow N 3.0)))) (/ -1.0 (* 4.0 (pow N 4.0)))))
double code(double N) {
return (((1.0 / N) + (-1.0 / (2.0 * pow(N, 2.0)))) + (1.0 / (3.0 * pow(N, 3.0)))) + (-1.0 / (4.0 * pow(N, 4.0)));
}
real(8) function code(n)
real(8), intent (in) :: n
code = (((1.0d0 / n) + ((-1.0d0) / (2.0d0 * (n ** 2.0d0)))) + (1.0d0 / (3.0d0 * (n ** 3.0d0)))) + ((-1.0d0) / (4.0d0 * (n ** 4.0d0)))
end function
public static double code(double N) {
return (((1.0 / N) + (-1.0 / (2.0 * Math.pow(N, 2.0)))) + (1.0 / (3.0 * Math.pow(N, 3.0)))) + (-1.0 / (4.0 * Math.pow(N, 4.0)));
}
def code(N): return (((1.0 / N) + (-1.0 / (2.0 * math.pow(N, 2.0)))) + (1.0 / (3.0 * math.pow(N, 3.0)))) + (-1.0 / (4.0 * math.pow(N, 4.0)))
function code(N) return Float64(Float64(Float64(Float64(1.0 / N) + Float64(-1.0 / Float64(2.0 * (N ^ 2.0)))) + Float64(1.0 / Float64(3.0 * (N ^ 3.0)))) + Float64(-1.0 / Float64(4.0 * (N ^ 4.0)))) end
function tmp = code(N) tmp = (((1.0 / N) + (-1.0 / (2.0 * (N ^ 2.0)))) + (1.0 / (3.0 * (N ^ 3.0)))) + (-1.0 / (4.0 * (N ^ 4.0))); end
code[N_] := N[(N[(N[(N[(1.0 / N), $MachinePrecision] + N[(-1.0 / N[(2.0 * N[Power[N, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(3.0 * N[Power[N, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-1.0 / N[(4.0 * N[Power[N, 4.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\frac{1}{N} + \frac{-1}{2 \cdot {N}^{2}}\right) + \frac{1}{3 \cdot {N}^{3}}\right) + \frac{-1}{4 \cdot {N}^{4}}
\end{array}
herbie shell --seed 2024207
(FPCore (N)
:name "2log (problem 3.3.6)"
:precision binary64
:pre (and (> N 1.0) (< N 1e+40))
:alt
(! :herbie-platform default (log1p (/ 1 N)))
:alt
(! :herbie-platform default (log (+ 1 (/ 1 N))))
:alt
(! :herbie-platform default (+ (/ 1 N) (/ -1 (* 2 (pow N 2))) (/ 1 (* 3 (pow N 3))) (/ -1 (* 4 (pow N 4)))))
(- (log (+ N 1.0)) (log N)))