\log \left(N + 1\right) - \log N
\begin{array}{l}
\mathbf{if}\;N \le 7693.69820421591703:\\
\;\;\;\;\log \left(\frac{\sqrt{N + 1}}{\sqrt[3]{N} \cdot \sqrt[3]{N}}\right) + \log \left(\frac{\sqrt{N + 1}}{{N}^{\frac{1}{3}}}\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{1}{{N}^{2}}, \frac{0.333333333333333315}{N} - 0.5, \frac{1}{N}\right)\\
\end{array}double f(double N) {
double r67404 = N;
double r67405 = 1.0;
double r67406 = r67404 + r67405;
double r67407 = log(r67406);
double r67408 = log(r67404);
double r67409 = r67407 - r67408;
return r67409;
}
double f(double N) {
double r67410 = N;
double r67411 = 7693.698204215917;
bool r67412 = r67410 <= r67411;
double r67413 = 1.0;
double r67414 = r67410 + r67413;
double r67415 = sqrt(r67414);
double r67416 = cbrt(r67410);
double r67417 = r67416 * r67416;
double r67418 = r67415 / r67417;
double r67419 = log(r67418);
double r67420 = 0.3333333333333333;
double r67421 = pow(r67410, r67420);
double r67422 = r67415 / r67421;
double r67423 = log(r67422);
double r67424 = r67419 + r67423;
double r67425 = 1.0;
double r67426 = 2.0;
double r67427 = pow(r67410, r67426);
double r67428 = r67425 / r67427;
double r67429 = 0.3333333333333333;
double r67430 = r67429 / r67410;
double r67431 = 0.5;
double r67432 = r67430 - r67431;
double r67433 = r67413 / r67410;
double r67434 = fma(r67428, r67432, r67433);
double r67435 = r67412 ? r67424 : r67434;
return r67435;
}



Bits error versus N
if N < 7693.698204215917Initial program 0.1
rmApplied diff-log0.1
rmApplied add-cube-cbrt0.2
Applied add-sqr-sqrt0.2
Applied times-frac0.2
Applied log-prod0.4
rmApplied pow1/30.3
if 7693.698204215917 < N Initial program 59.4
Taylor expanded around inf 0.0
Simplified0.0
Final simplification0.2
herbie shell --seed 2020062 +o rules:numerics
(FPCore (N)
:name "2log (problem 3.3.6)"
:precision binary64
(- (log (+ N 1)) (log N)))