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

Error

Bits error versus N

Derivation

  1. Split input into 2 regimes

  2. if N < 2500116.352981572

    1. Initial program 0.2

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

    if 2500116.352981572 < N

    1. Initial program 59.8

      \[\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}{\frac{1}{N} + \left(\frac{\frac{1}{3}}{N} - \frac{1}{2}\right) \cdot \frac{1}{N \cdot N}}\]

    4. Applied simplify0.0

      \[\leadsto \frac{1}{N} + \color{blue}{\frac{\frac{\frac{1}{3}}{N} - \frac{1}{2}}{N \cdot N}}\]
  3. Recombined 2 regimes into one program.
  4. Removed slow pow expressions.

Runtime

Time bar (total: 59.3s)Debug logProfile

herbie shell --seed '#(1062803647 245428163 493620569 3595423923 1908391097 2390014376)' 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  (- (log (+ N 1)) (log N)))