\log \left(N + 1\right) - \log N
\begin{array}{l}
\mathbf{if}\;N \le 8116.362270388288379763253033161163330078:\\
\;\;\;\;\frac{1}{2} \cdot \log \left(\frac{N + 1}{N}\right) + \log \left(\sqrt{\frac{N + 1}{N}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{{N}^{2}} \cdot \left(\frac{0.3333333333333333148296162562473909929395}{N} - 0.5\right) + \frac{1}{N}\\
\end{array}double f(double N) {
double r41818 = N;
double r41819 = 1.0;
double r41820 = r41818 + r41819;
double r41821 = log(r41820);
double r41822 = log(r41818);
double r41823 = r41821 - r41822;
return r41823;
}
double f(double N) {
double r41824 = N;
double r41825 = 8116.362270388288;
bool r41826 = r41824 <= r41825;
double r41827 = 0.5;
double r41828 = 1.0;
double r41829 = r41824 + r41828;
double r41830 = r41829 / r41824;
double r41831 = log(r41830);
double r41832 = r41827 * r41831;
double r41833 = sqrt(r41830);
double r41834 = log(r41833);
double r41835 = r41832 + r41834;
double r41836 = 1.0;
double r41837 = 2.0;
double r41838 = pow(r41824, r41837);
double r41839 = r41836 / r41838;
double r41840 = 0.3333333333333333;
double r41841 = r41840 / r41824;
double r41842 = 0.5;
double r41843 = r41841 - r41842;
double r41844 = r41839 * r41843;
double r41845 = r41828 / r41824;
double r41846 = r41844 + r41845;
double r41847 = r41826 ? r41835 : r41846;
return r41847;
}



Bits error versus N
Results
if N < 8116.362270388288Initial program 0.1
rmApplied diff-log0.1
rmApplied add-sqr-sqrt0.1
Applied log-prod0.1
rmApplied pow10.1
Applied sqrt-pow10.1
Applied log-pow0.1
if 8116.362270388288 < N Initial program 59.4
Taylor expanded around inf 0.0
Simplified0.0
Final simplification0.1
herbie shell --seed 2020001
(FPCore (N)
:name "2log (problem 3.3.6)"
:precision binary64
(- (log (+ N 1)) (log N)))