Average Error: 29.6 → 0.1
Time: 12.6s
Precision: 64
\[\log \left(N + 1\right) - \log N\]
↓
\[\begin{array}{l} \mathbf{if}\;N \le 7426.105103924180184549186378717422485352:\\ \;\;\;\;\log \left(\frac{1 + N}{N}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{0.3333333333333333148296162562473909929395}{N} - 0.5\right) \cdot \frac{\frac{1}{N}}{N} + \frac{1}{N}\\ \end{array}\]
\log \left(N + 1\right) - \log N
↓
\begin{array}{l}
\mathbf{if}\;N \le 7426.105103924180184549186378717422485352:\\
\;\;\;\;\log \left(\frac{1 + N}{N}\right)\\

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

\end{array}
double f(double N) {
        double r24013 = N;
        double r24014 = 1.0;
        double r24015 = r24013 + r24014;
        double r24016 = log(r24015);
        double r24017 = log(r24013);
        double r24018 = r24016 - r24017;
        return r24018;
}
↓
double f(double N) {
        double r24019 = N;
        double r24020 = 7426.10510392418;
        bool r24021 = r24019 <= r24020;
        double r24022 = 1.0;
        double r24023 = r24022 + r24019;
        double r24024 = r24023 / r24019;
        double r24025 = log(r24024);
        double r24026 = 0.3333333333333333;
        double r24027 = r24026 / r24019;
        double r24028 = 0.5;
        double r24029 = r24027 - r24028;
        double r24030 = 1.0;
        double r24031 = r24030 / r24019;
        double r24032 = r24031 / r24019;
        double r24033 = r24029 * r24032;
        double r24034 = r24022 / r24019;
        double r24035 = r24033 + r24034;
        double r24036 = r24021 ? r24025 : r24035;
        return r24036;
}

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 < 7426.10510392418

    1. Initial program 0.1

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

    2. Simplified0.1

      \[\leadsto \color{blue}{\log \left(1 + N\right) - \log N}\]
    3. Using strategy rm

    4. Applied diff-log0.1

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

    5. Simplified0.1

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

    if 7426.10510392418 < N

    1. Initial program 59.6

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

    2. Simplified59.6

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

    3. Taylor expanded around inf 0.0

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

    4. Simplified0.0

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

  4. Final simplification0.1

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

Reproduce

herbie shell --seed 2019194 +o rules:numerics
(FPCore (N)
  :name "2log (problem 3.3.6)"
  (- (log (+ N 1.0)) (log N)))