Average Error: 30.2 → 0.1
Time: 5.0s
Precision: 64
\[\log \left(N + 1\right) - \log N\]
↓
\[\begin{array}{l} \mathbf{if}\;N \le 9018.88736323637386:\\ \;\;\;\;\log \left(\frac{N + 1}{N}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{{N}^{2}} \cdot \left(\frac{0.333333333333333315}{N} - 0.5\right) + \frac{1}{N}\\ \end{array}\]
\log \left(N + 1\right) - \log N
↓
\begin{array}{l}
\mathbf{if}\;N \le 9018.88736323637386:\\
\;\;\;\;\log \left(\frac{N + 1}{N}\right)\\

\mathbf{else}:\\
\;\;\;\;\frac{1}{{N}^{2}} \cdot \left(\frac{0.333333333333333315}{N} - 0.5\right) + \frac{1}{N}\\

\end{array}
double f(double N) {
        double r217 = N;
        double r218 = 1.0;
        double r219 = r217 + r218;
        double r220 = log(r219);
        double r221 = log(r217);
        double r222 = r220 - r221;
        return r222;
}
↓
double f(double N) {
        double r223 = N;
        double r224 = 9018.887363236374;
        bool r225 = r223 <= r224;
        double r226 = 1.0;
        double r227 = r223 + r226;
        double r228 = r227 / r223;
        double r229 = log(r228);
        double r230 = 1.0;
        double r231 = 2.0;
        double r232 = pow(r223, r231);
        double r233 = r230 / r232;
        double r234 = 0.3333333333333333;
        double r235 = r234 / r223;
        double r236 = 0.5;
        double r237 = r235 - r236;
        double r238 = r233 * r237;
        double r239 = r226 / r223;
        double r240 = r238 + r239;
        double r241 = r225 ? r229 : r240;
        return r241;
}

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Split input into 2 regimes

  2. if N < 9018.887363236374

    1. Initial program 0.1

      \[\log \left(N + 1\right) - \log N\]
    2. Using strategy rm

    3. Applied diff-log0.1

      \[\leadsto \color{blue}{\log \left(\frac{N + 1}{N}\right)}\]

    if 9018.887363236374 < N

    1. Initial program 59.5

      \[\log \left(N + 1\right) - \log N\]

    2. Taylor expanded around inf 0.0

      \[\leadsto \color{blue}{\left(0.333333333333333315 \cdot \frac{1}{{N}^{3}} + 1 \cdot \frac{1}{N}\right) - 0.5 \cdot \frac{1}{{N}^{2}}}\]

    3. Simplified0.0

      \[\leadsto \color{blue}{\frac{1}{{N}^{2}} \cdot \left(\frac{0.333333333333333315}{N} - 0.5\right) + \frac{1}{N}}\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;N \le 9018.88736323637386:\\ \;\;\;\;\log \left(\frac{N + 1}{N}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{{N}^{2}} \cdot \left(\frac{0.333333333333333315}{N} - 0.5\right) + \frac{1}{N}\\ \end{array}\]

Reproduce

herbie shell --seed 2020025 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  :precision binary64
  (- (log (+ N 1)) (log N)))