Average Error: 29.5 → 0.2
Time: 52.0s
Precision: 64
Internal Precision: 1600
\[\log \left(N + 1\right) - \log N\]
↓
\[\begin{array}{l} \mathbf{if}\;\log \left(N + 1\right) - \log N \le 4.0142178601380495 \cdot 10^{-08}:\\ \;\;\;\;(\left(\frac{1}{N \cdot N}\right) \cdot \left(\frac{\frac{1}{3}}{N} - \frac{1}{2}\right) + \left(\frac{1}{N}\right))_*\\ \mathbf{else}:\\ \;\;\;\;(e^{\log_* (1 + \log_* (1 + N))} - 1)^* - \log N\\ \end{array}\]

Error

Bits error versus N

Derivation

  1. Split input into 2 regimes

  2. if (- (log (+ N 1)) (log N)) < 4.0142178601380495e-08

    1. Initial program 60.0

      \[\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. Applied simplify0.0

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

    if 4.0142178601380495e-08 < (- (log (+ N 1)) (log N))

    1. Initial program 0.4

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

    3. Applied expm1-log1p-u0.4

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

    4. Applied simplify0.4

      \[\leadsto (e^{\color{blue}{\log_* (1 + \log_* (1 + N))}} - 1)^* - \log N\]
  3. Recombined 2 regimes into one program.

Runtime

Time bar (total: 52.0s)Debug logProfile

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