\log \left(N + 1\right) - \log N
\begin{array}{l}
\mathbf{if}\;N \le 13931.9619516847724:\\
\;\;\;\;\log \left(\frac{N + 1}{N}\right)\\
\mathbf{else}:\\
\;\;\;\;\log \left(e^{\frac{1}{{N}^{2}}}\right) \cdot \frac{0.333333333333333315}{N} + \left(\frac{1}{N} - \frac{\frac{0.5}{N}}{N}\right)\\
\end{array}double f(double N) {
double r41091 = N;
double r41092 = 1.0;
double r41093 = r41091 + r41092;
double r41094 = log(r41093);
double r41095 = log(r41091);
double r41096 = r41094 - r41095;
return r41096;
}
double f(double N) {
double r41097 = N;
double r41098 = 13931.961951684772;
bool r41099 = r41097 <= r41098;
double r41100 = 1.0;
double r41101 = r41097 + r41100;
double r41102 = r41101 / r41097;
double r41103 = log(r41102);
double r41104 = 1.0;
double r41105 = 2.0;
double r41106 = pow(r41097, r41105);
double r41107 = r41104 / r41106;
double r41108 = exp(r41107);
double r41109 = log(r41108);
double r41110 = 0.3333333333333333;
double r41111 = r41110 / r41097;
double r41112 = r41109 * r41111;
double r41113 = r41100 / r41097;
double r41114 = 0.5;
double r41115 = r41114 / r41097;
double r41116 = r41115 / r41097;
double r41117 = r41113 - r41116;
double r41118 = r41112 + r41117;
double r41119 = r41099 ? r41103 : r41118;
return r41119;
}



Bits error versus N
Results
if N < 13931.961951684772Initial program 0.1
rmApplied diff-log0.1
if 13931.961951684772 < N Initial program 59.5
Taylor expanded around inf 0.0
Simplified0.0
rmApplied sub-neg0.0
Applied distribute-lft-in0.0
Applied associate-+l+0.0
Simplified0.0
rmApplied add-log-exp0.0
Final simplification0.1
herbie shell --seed 2020056
(FPCore (N)
:name "2log (problem 3.3.6)"
:precision binary64
(- (log (+ N 1)) (log N)))