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

Error

Bits error versus N

Derivation

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

    1. Initial program 0.1

      \[\log \left(N + 1\right) - \log N\]
    2. Using strategy rm
    3. Applied add-sqr-sqrt0.1

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

    if 4422.153740354562 < N

    1. Initial program 59.6

      \[\log \left(N + 1\right) - \log N\]
    2. 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}}}\]
    3. 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}}\]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.1

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

Reproduce

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