\log \left(N + 1\right) - \log N
\begin{array}{l}
\mathbf{if}\;N \le 4798.860931730865559075027704238891601562:\\
\;\;\;\;\left(\log \left(1 + N\right) - 2 \cdot \log \left(\sqrt[3]{N}\right)\right) - \log \left(\sqrt[3]{N}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{0.3333333333333333148296162562473909929395}{{N}^{3}} - \frac{\frac{0.5}{N}}{N}\right) + \frac{1}{N}\\
\end{array}double f(double N) {
double r104385 = N;
double r104386 = 1.0;
double r104387 = r104385 + r104386;
double r104388 = log(r104387);
double r104389 = log(r104385);
double r104390 = r104388 - r104389;
return r104390;
}
double f(double N) {
double r104391 = N;
double r104392 = 4798.860931730866;
bool r104393 = r104391 <= r104392;
double r104394 = 1.0;
double r104395 = r104394 + r104391;
double r104396 = log(r104395);
double r104397 = 2.0;
double r104398 = cbrt(r104391);
double r104399 = log(r104398);
double r104400 = r104397 * r104399;
double r104401 = r104396 - r104400;
double r104402 = r104401 - r104399;
double r104403 = 0.3333333333333333;
double r104404 = 3.0;
double r104405 = pow(r104391, r104404);
double r104406 = r104403 / r104405;
double r104407 = 0.5;
double r104408 = r104407 / r104391;
double r104409 = r104408 / r104391;
double r104410 = r104406 - r104409;
double r104411 = r104394 / r104391;
double r104412 = r104410 + r104411;
double r104413 = r104393 ? r104402 : r104412;
return r104413;
}



Bits error versus N
Results
if N < 4798.860931730866Initial program 0.1
Simplified0.1
rmApplied add-cube-cbrt0.1
Applied log-prod0.4
Applied associate--r+0.4
Simplified0.4
if 4798.860931730866 < N Initial program 59.7
Simplified59.7
Taylor expanded around inf 0.0
Simplified0.0
Final simplification0.2
herbie shell --seed 2019195 +o rules:numerics
(FPCore (N)
:name "2log (problem 3.3.6)"
(- (log (+ N 1.0)) (log N)))