Average Error: 29.7 → 0.1
Time: 44.2s
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 8.011007441346735 \cdot 10^{-06}:\\ \;\;\;\;(\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}:\\ \;\;\;\;\left(\sqrt[3]{\log_* (1 + N)} \cdot \sqrt[3]{\log_* (1 + N)}\right) \cdot \sqrt[3]{\log_* (1 + N)} - \log N\\ \end{array}\]

Error

Bits error versus N

Derivation

  1. Split input into 2 regimes

  2. if (- (log (+ N 1)) (log N)) < 8.011007441346735e-06

    1. Initial program 59.6

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

    2. Applied simplify59.6

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

    3. 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}}}\]

    4. 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 8.011007441346735e-06 < (- (log (+ N 1)) (log N))

    1. Initial program 0.1

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

    2. Applied simplify0.1

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

    4. Applied add-cube-cbrt0.2

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

Runtime

Time bar (total: 44.2s)Debug logProfile

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