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

Error

Bits error versus N

Derivation

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

    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 10615.219937138987 < N

    1. Initial program 59.5

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

      \[\leadsto \color{blue}{\log \left(\frac{N + 1}{N}\right)}\]
    4. 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}}}\]
    5. Simplified0.0

      \[\leadsto \color{blue}{\left(\frac{1}{N} + \frac{\frac{-1}{2}}{N \cdot N}\right) + \frac{\frac{\frac{1}{3}}{N \cdot N}}{N}}\]
    6. Taylor expanded around 0 0.0

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

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

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

Reproduce

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