Average Error: 29.9 → 0.0
Time: 46.4s
Precision: 64
Internal Precision: 128
\[\log \left(N + 1\right) - \log N\]
\[\begin{array}{l} \mathbf{if}\;N \le 10866.35651146119:\\ \;\;\;\;\log \left(\frac{1 + N}{N}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{1}{N} + \frac{\frac{-1}{2}}{N \cdot N}\right) - \frac{\frac{-1}{3}}{N \cdot \left(N \cdot N\right)}\\ \end{array}\]

Error

Bits error versus N

Derivation

  1. Split input into 2 regimes
  2. if N < 10866.35651146119

    1. Initial program 0.1

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

      \[\leadsto \color{blue}{\log_* (1 + N) - \log N}\]
    3. Using strategy rm
    4. Applied log1p-udef0.1

      \[\leadsto \color{blue}{\log \left(1 + N\right)} - \log N\]
    5. Applied diff-log0.1

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

    if 10866.35651146119 < N

    1. Initial program 59.4

      \[\log \left(N + 1\right) - \log N\]
    2. Simplified59.4

      \[\leadsto \color{blue}{\log_* (1 + N) - \log N}\]
    3. Using strategy rm
    4. Applied flip--59.4

      \[\leadsto \color{blue}{\frac{\log_* (1 + N) \cdot \log_* (1 + N) - \log N \cdot \log N}{\log_* (1 + N) + \log N}}\]
    5. Taylor expanded around inf 0.0

      \[\leadsto \color{blue}{\left(\frac{1}{3} \cdot \frac{1}{{N}^{3}} + \frac{1}{N}\right) - \frac{1}{2} \cdot \frac{1}{{N}^{2}}}\]
    6. Simplified0.0

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

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

Reproduce

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